Back to Search
Start Over
“What Do Your Friends Think?”: Efficient Polling Methods for Networks Using Friendship Paradox.
- Source :
- IEEE Transactions on Knowledge & Data Engineering; Mar2021, Vol. 33 Issue 3, p1291-1305, 15p
- Publication Year :
- 2021
-
Abstract
- 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 two 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, and (ii) the social network graph is unknown but, uniformly sampled nodes from the network are available. For both cases, 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. [ABSTRACT FROM AUTHOR]
- Subjects :
- FRIENDSHIP
SOCIAL networks
RANDOM walks
PARADOX
GRAPH algorithms
Subjects
Details
- Language :
- English
- ISSN :
- 10414347
- Volume :
- 33
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Knowledge & Data Engineering
- Publication Type :
- Academic Journal
- Accession number :
- 148595946
- Full Text :
- https://doi.org/10.1109/TKDE.2019.2940914