The winner takes it all

DOI10.1214/15-AAP1151MaRDI QIDQ341622zbMATH OpenFDO

Authors Maria Deijfen, Remco van der Hofstad

Publication date 16 November 2016

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1306.6467, https://projecteuclid.org/euclid.aoap/1472745463

zbMATH Keywords

first passage percolationrandom graphsconfiguration modelcompeting growthcontinuous-time branching process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Stochastic network models in operations research (90B15)

Abstract: We study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1 (2) infected at rate $lambd{a}_1$ ($lambd{a}_2$) times the number of edges connecting it to a type 1 (2) infected neighbor. Our main result is that, if the degree distribution is a power-law with exponent $auin(2,3)$, then, as the number of vertices tends to infinity and with high probability, one of the infection types will occupy all but a finite number of vertices. Furthermore, which one of the infections wins is random and both infections have a positive probability of winning regardless of the values of $lambd{a}_1$ and $lambd{a}_2$. The picture is similar with multiple starting points for the infections.

Recommendations

• Competing first passage percolation on random graphs with finite variance degrees
• Shape of territories in some competing growth models
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• Competing first passage percolation on random regular graphs
• First passage percolation and a model for competing spatial growth

Cited in

(10)

• Victor vanquished
• Coexistence in preferential attachment networks
• Competition in growth and urns
• First passage percolation on the Newman-Watts small world model
• Voronoi cells in random split trees
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• The winner takes it all but one
• Competing first passage percolation on random graphs with finite variance degrees
• Chase-escape on the configuration model
• Nonuniversality of weighted random graphs with infinite variance degree

This page was built for publication: The winner takes it all

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q341622)