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

DOI10.1214/EJP.V20-3749MaRDI QIDQ894178zbMATH OpenFDO

Authors Enrico Baroni, Júlia Komjáthy, Remco van der Hofstad

Publication date 27 November 2015

Published in Electronic Journal of Probability (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1408.0475

zbMATH Keywords

co-existencecompetitionconfiguration modelpower law degreesrandom networkstypical distances

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Combinatorial probability (60C05) Stochastic network models in operations research (90B15) Social networks; opinion dynamics (91D30)

Abstract: 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 tau in (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.

Recommendations

• Competing first passage percolation on random graphs with finite variance degrees
• An oriented competition model on \(Z_{+}^{2}\)
• The winner takes it all
• Dynamics of nearest-neighbour competitions on graphs
• Degree Distribution of Competition-Induced Preferential Attachment Graphs

Cited in

(12)

• When is a scale-free graph ultra-small?
• Dynamics of nearest-neighbour competitions on graphs
• Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
• First passage percolation on the Newman-Watts small world model
• The winner takes it all
• Nonuniversality of weighted random graphs with infinite variance degree
• Competing first passage percolation on random graphs with finite variance degrees
• A functional central limit theorem for SI processes on configuration model graphs
• The winner takes it all but one
• Voronoi cells in random split trees
• Universal `winner-takes-it-all' phenomenon in scale-free random graphs
• First passage percolation on Erdös-Rényi graphs with general weights

This page was built for publication: Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds

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