Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds

We study competition of two spreading colors starting from single sources on the configuration model with i.i.d. degrees following a power-law distribution with exponent τ ∈ (2, 3). In this model two colors spread with a fixed but not necessarily equal speed on the unweighted random graph. We show that if the speeds are not equal, then the faster color paints almost all vertices, while the slower color can paint only a random subpolynomial fraction of the vertices. We investigate the case when the speeds are equal and typical distances in a follow-up paper.

[1]  Olle Häggström,et al.  The Initial Configuration is Irrelevant for the Possibility of Mutual Unbounded Growth in the Two-Type Richardson Model , 2006, Comb. Probab. Comput..

[2]  P. L. Davies.  The simple branching process : a note on convergence when the mean is infinite , 1978 .

[3]  Mark E. J. Newman,et al.  Competing epidemics on complex networks , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  First-passage competition with different speeds: positive density for both species is impossible , 2006, math/0608667.

[5]  Olle Haggstrom,et al.  The two-type Richardson model with unbounded initial configurations , 2007, 0710.5602.

[6]  Christos Faloutsos,et al.  Winner takes all: competing viruses or ideas on fair-play networks , 2012, WWW.

[7]  F. Buttle.  Word of mouth: understanding and managing referral marketing , 1998 .

[8]  Chrysanthos Dellarocas,et al.  The Digitization of Word-of-Mouth: Promise and Challenges of Online Feedback Mechanisms , 2003, Manag. Sci..

[9]  Yuval Peres,et al.  Competing first passage percolation on random regular graphs , 2011, Random Struct. Algorithms.

[10]  Naoki Masuda,et al.  Epidemic dynamics of two species of interacting particles on scale-free networks. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[11]  Robert P. Leone,et al.  How valuable is word of mouth? , 2007, Harvard business review.

[12]  M. Newman.  Threshold effects for two pathogens spreading on a network. , 2005, Physical review letters.

[13]  Marc Lipsitch,et al.  No coexistence for free: neutral null models for multistrain pathogens. , 2009, Epidemics.

[14]  Bruce A. Reed,et al.  The Size of the Giant Component of a Random Graph with a Given Degree Sequence , 1998, Combinatorics, Probability and Computing.

[15]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[16]  Svante Janson,et al.  SUSCEPTIBILITY OF RANDOM GRAPHS WITH GIVEN VERTEX DEGREES , 2009 .

[17]  Remco van der Hofstad,et al.  The winner takes it all , 2013, 1306.6467.

[18]  Remco van der Hofstad,et al.  First Passage Percolation on the Erdős–Rényi Random Graph , 2010, Combinatorics, Probability and Computing.

[19]  Olivier Garet,et al.  Coexistence in two-type first-passage percolation models , 2003 .

[20]  Gordon C. Bruner,et al.  Attitude toward Location-based Advertising , 2007 .

[21]  Béla Bollobás,et al.  A Probabilistic Proof of an Asymptotic Formula for the Number of Labelled Regular Graphs , 1980, Eur. J. Comb..

[22]  Himabindu Pucha,et al.  Performance comparison of scalable location services for geographic ad hoc routing , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[23]  E. Seneta.  The simple branching process with infinite mean. I , 1973 .

[24]  G. Hooghiemstra,et al.  Universality for first passage percolation on sparse uniform and rank-1 random graphs , 2014 .

[25]  Christopher Hoffman.  Geodesics in first passage percolation , 2005 .

[26]  G. Hooghiemstra,et al.  First passage percolation on random graphs with finite mean degrees , 2009, 0903.5136.

[27]  Christos Faloutsos,et al.  Interacting viruses in networks: can both survive? , 2012, KDD.

[28]  J. Arndt.  Role of Product-Related Conversations in the Diffusion of a New Product , 1967 .

[29]  Robin Pemantle,et al.  First passage percolation and a model for competing spatial growth , 1997 .

[30]  Glenn Ellison,et al.  Word-of-Mouth Communication and Social Learning , 1995 .

[31]  Jure Leskovec,et al.  The dynamics of viral marketing , 2005, EC '06.

[32]  Gerald B. Folland,et al.  Real Analysis: Modern Techniques and Their Applications , 1984 .

[33]  Elchanan Mossel,et al.  Coexistence in Preferential Attachment Networks , 2013, Combinatorics, Probability and Computing.

[34]  Bruce A. Reed,et al.  A Critical Point for Random Graphs with a Given Degree Sequence , 1995, Random Struct. Algorithms.

[35]  Christopher Hoffman.  Coexistence for Richardson type competing spatial growth models , 2004 .

[36]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[37]  Remco van der Hofstad,et al.  Universality for first passage percolation on sparse random graphs , 2012, 1210.6839.

[38]  Hock-Hai Teo,et al.  Perceived effectiveness of text vs. multimedia Location-Based Advertising messaging , 2009, Int. J. Mob. Commun..

[39]  E. Seneta.  Regularly varying functions in the theory of simple branching processes , 1974, Advances in Applied Probability.

[40]  Colin Cooper,et al.  Analyzing Two Competing Epidemic Processes-The Power of Influential Nodes - , 2014 .

[41]  Béla Bollobás,et al.  Random Graphs , 1985 .

[42]  Drew Fudenberg,et al.  Word-of-mouth learning , 2004, Games Econ. Behav..

[43]  William Feller,et al.  An introduction to probability and its applications , 2014 .

[44]  Remco van der Hofstad,et al.  Distances in Random Graphs with Finite Mean and Infinite Variance Degrees , 2005, math/0502581.