Information Transmission under Random Emission Constraints

We model the transmission of a message on the complete graph with n vertices and limited resources. The vertices of the graph represent servers that may broadcast the message at random. Each server has a random emission capital that decreases at each emission. Quantities of interest are the number of servers that receive the information before the capital of all the informed servers is exhausted and the exhaustion time. We establish limit theorems (law of large numbers, central limit theorem and large deviation principle), as n tends to infinity, for the proportion of visited vertices before exhaustion and for the total duration. The analysis relies on a construction of the transmission procedure as a dynamical selection of successful nodes in a Galton-Watson tree with respect to the success epochs of the coupon collector problem.

[1]  H. Kawahigashi,et al.  Modeling ad hoc sensor networks using random graph theory , 2005, Second IEEE Consumer Communications and Networking Conference, 2005. CCNC. 2005.

[2]  Philippe Flajolet,et al.  Birthday Paradox, Coupon Collectors, Caching Algorithms and Self-Organizing Search , 1992, Discret. Appl. Math..

[3]  CLT for the proportion of infected incividuals for an epidemic model on a complete graph , 2010, 1011.3601.

[4]  Phil Whiting,et al.  Large deviation asymptotics for occupancy problems , 2004 .

[5]  Tanja Hueber,et al.  An Introduction To The Analysis Of Algorithms , 2016 .

[6]  Gady Kozma,et al.  An asymptotic expansion for the discrete harmonic potential , 2002 .

[7]  J. Neveu,et al.  Arbres et processus de Galton-Watson , 1986 .

[8]  Harry Kesten,et al.  The spread of a rumor or infection in a moving population , 2003, math/0312496.

[9]  Fluctuations of the front in a one dimensional model of X+Y-->2X , 2006, math/0607549.

[10]  N. D. Kan.  Martingale approach to the coupon collection problem , 2005 .

[11]  Patrick Billingsley,et al.  Asymptotic Distributions for the Coupon Collector's Problem , 1965 .

[12]  R. Durrett.  Probability: Theory and Examples , 1993 .

[13]  Law of large numbers in an epidemic model , 2012 .

[14]  Thomas G. Kurtz,et al.  Limit theorems for an epidemic model on the com- plete graph , 2008 .

[15]  A. Shiryaev,et al.  Limit Theorems for Stochastic Processes , 1987 .

[16]  M. Alliaume,et al.  Probabilites et Statistiques. , 1932 .

[17]  V. Sidoravicius,et al.  Asymptotic behavior of a stochastic combustion growth process , 2004 .

[18]  S. Boucheron,et al.  BINS AND BALLS: LARGE DEVIATIONS OF THE EMPIRICAL OCCUPANCY PROCESS , 2002 .

[19]  R. Bass,et al.  Review: P. Billingsley, Convergence of probability measures , 1971 .

[20]  F. Baccelli,et al.  Optimal paths on the space-time SINR random graph , 2009, Advances in Applied Probability.

[21]  On Infection Spreading and Competition between Independent Random Walks , 2004 .

[22]  Amir Dembo,et al.  Large Deviations Techniques and Applications , 1998 .

[23]  Xingde Jia,et al.  Wireless networks and random geometric graphs , 2004, 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings..

[24]  P. Erd6s.  ON A CLASSICAL PROBLEM OF PROBABILITY THEORY b , 2001 .

[25]  Zhi-Hong Guan,et al.  Modeling wireless sensor networks using random graph theory , 2008 .

[26]  Philippe Flajolet,et al.  An introduction to the analysis of algorithms , 1995 .

[27]  J. Pitman.  Combinatorial Stochastic Processes , 2006 .

[29]  Thomas Duquesne,et al.  Random Trees, Levy Processes and Spatial Branching Processes , 2002 .

[30]  A phase transition in a model for the spread of an infection , 2004, math/0410371.

[31]  O.S.M.Alves,et al.  The shape theorem for the frog model , 2001, math/0102182.

[32]  H. Kesten,et al.  A Limit Theorem for Multidimensional Galton-Watson Processes , 1966 .