arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.06505cs.SIphysics.soc-ph
收藏

你的朋友怎么想?基于友谊参数的网络轮询方法

What Do Your Friends Think? Efficient Polling Methods for Networks Using Friendship Paradox

Buddhika Nettasinghe, Vikram Krishnamurthy

摘要:

本文讨论了社会网络的随机投票问题。在预测两名候选人A和B之间的选举结果的情况下,经典的意向民意调查会随机抽样询问个人:你会投票给谁?民意调查的问题是:你认为谁会赢?在本文中,我们提出了一种新型的邻里期望民意调查(NEP)策略,该策略询问随机抽样的个人:您对A的选票分数的估计是多少?因此,在NEP中,被抽样的个体在回答这个问题时会自然地看他们的邻居(由底层社交网络图定义)。因此,NEP方法的均方误差(MSE)依赖于从网络中选择最佳样本集。为此,我们针对以下情况提出了三种NEP算法:(i)社交网络图未知,但可以在图上执行随机游走(顺序探索);(ii)社交网络图未知。对于情况(i)和(ii),提出了两个算法的基础上的图论结论称为友谊悖论。建立了算法的MSE对网络性质的依赖性的理论结果。真实和合成数据集的数值结果来说明算法的性能。

英文摘要:

This paper deals with randomized polling of a social network. In the case of forecasting the outcome of an election between two candidates A and B, classical intent polling asks randomly sampled individuals: who will you vote for? Expectation polling asks: who do you think will win? In this paper, we propose a novel neighborhood expectation polling (NEP) strategy that asks randomly sampled individuals: what is your estimate of the fraction of votes for A? Therefore, in NEP, sampled individuals will naturally look at their neighbors (defined by the underlying social network graph) when answering this question. Hence, the mean squared error (MSE) of NEP methods rely on selecting the optimal set of samples from the network. To this end, we propose three NEP algorithms for the following cases: (i) the social network graph is not known but, random walks (sequential exploration) can be performed on the graph (ii) the social network graph is unknown. For case (i) and (ii), two algorithms based on a graph theoretic consequence called friendship paradox are proposed. Theoretical results on the dependence of the MSE of the algorithms on the properties of the network are established. Numerical results on real and synthetic data sets are provided to illustrate the performance of the algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑