Information Spreading in a Large Population of Active Transmitters and Passive Receivers
Abstract
This paper discusses a simple stochastic model for the spread of messages in a large population with two types of individuals: transmitters and receivers. Transmitters, after receiving the message, start spreading copies of the message to their neighbors. Receivers may receive the message but will never spread it further. We derive approximations of the broadcast time and the first passage times of selected individuals in populations of size tending to infinity. These approximations explain how much the fact that only a fraction of the individuals are transmitters slows down the propagation of information. Our results also sharply characterize the statistical dependence structure of first passage times using Gumbel and logistic distributions of extreme value statistics.
Keywords
MSC codes
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
D. J. Aldous, When knowing early matters: Gossip, percolation and Nash equilibria, in Prokhorov and Contemporary Probability Theory, Springer, New York, 2013, pp. 3--27.
2.
H. Amini, M. Draief, and M. Lelarge, Flooding in weighted sparse random graphs, SIAM J. Discrete Math., 27 (2013), pp. 1--26.
3.
B. C. Arnold, N. Balakrishnan, and H. N. Nagaraja, A First Course in Order Statistics, Classics in Appl. Math., SIAM, Philadelphia, 2008.
4.
K. B. Athreya and S. Karlin, Limit theorems for the split times of branching processes, J. Math. Mech., 17 (1967) pp. 257--277.
5.
L. E. Baum and P. Billingsley, Asymptotic distributions for the coupon collector's problem, Ann. Math. Stat., 36 (1965), pp. 1835--1839.
6.
S. Bhamidi, First passage percolation on locally treelike networks. I. Dense random graphs, J. Math. Phys., 49 (2008), 125218.
7.
S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra, Universality for first passage percolation on sparse random graphs, arXiv:1210.6839, 2012.
8.
S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra, First passage percolation on random graphs with finite mean degrees, Ann. Appl. Probab., 20 (2010), pp. 1907--1965.
9.
S. Bhamidi, R. van der Hofstad, and G. Hooghiemstra, First passage percolation on the Erdös--Rényi random graph, Combin. Probab. Comput., 20 (2011), pp. 683--707.
10.
D. J. Daley and D. G. Kendall, Stochastic rumours, J. Inst. Math. Appl., 1 (1965), pp. 42--55.
11.
U. Feige, D. Peleg, P. Raghavan, and E. Upfal Randomized broadcast in networks, Random Structures Algorithms, 1 (1990), pp. 447--460.
12.
N. Fountoulakis, A. Huber, and K. Panagiotou, Reliable broadcasting in random networks and the effect of density, in Proceedings of INFOCOM, IEEE, 2010, pp. 1--9.
13.
A. M. Frieze and G. R. Grimmett, The shortest-path problem for graphs with random arc-lengths, Discrete Appl. Math., 10 (1985), pp. 57--77.
14.
S. Janson, One, two and three times $\log n/n$ for paths in a complete graph with random weights, Combin. Probab. Comput., 8 (1999), pp. 347--361.
15.
I. Kolossváry and J. Komjáthy, First passage percolation on inhomogeneous random graphs, Adv. Appl. Probab., 47 (2015).
16.
E. Lebensztayn, F. P. Machado, and P. M. Rodríguez, Limit theorems for a general stochastic rumour model, SIAM J. Appl. Math., 71 (2011), pp. 1476--1486.
17.
S. Molchanov and J. M. Whitmeyer, Two Markov models of the spread of rumors, J. Math. Sociol., 34 (2010), pp. 157--166.
18.
B. Pittel, On spreading a rumor, SIAM J. Appl. Math., 47 (1987), pp. 213--223.
19.
J. Salez, Joint distribution of distances in random regular networks, J. Appl. Probab., 50 (2013), pp. 861--870.
20.
R. van der Hofstad, G. Hooghiemstra, and P. Van Mieghem, The flooding time in random graphs, Extremes, 5 (2002), pp. 111--129.
21.
A. W. van der Vaart, Asymptotic Statistics. Cambridge University Press, Cambridge, UK, 2000.
Information & Authors
Information
Published In
Copyright
© 2015, Society for Industrial and Applied Mathematics.
History
Submitted: 27 December 2014
Accepted: 30 June 2015
Published online: 8 September 2015
Keywords
MSC codes
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- First passage percolation on sparse random graphs with boundary weightsJournal of Applied Probability, Vol. 56, No. 2 | 30 July 2019
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].