arXiv Analytics

Sign in

arXiv:2307.09911 [math.PR]AbstractReferencesReviewsResources

Universal `winner-takes-it-all' phenomenon in scale-free random graphs

Remco van der Hofstad

Published 2023-07-19Version 1

We study competition on scale-free random graphs, where the degree distribution satisfies an asymptotic power-law with infinite variance. Our competition process is such that the two types attempt at occupying vertices incident to the presently occupied sets, and the passage times are independent and identically distributed, possibly with different distributions for the two types. Once vertices are occupied by a type, they remain on being so. We focus on the explosive setting, where our main result shows that the winning type occupies all but a finite number of vertices. This universal `winner-takes-it-all' phenomenon significantly generalises previous work with Deijfen for exponential edge-weights, and considerably simplifies its proof.

Related articles: Most relevant | Search more
arXiv:1408.3610 [math.PR] (Published 2014-08-15)
PageRank in scale-free random graphs
arXiv:2008.11557 [math.PR] (Published 2020-08-26)
Asymptotics for cliques in scale-free random graphs
arXiv:2303.09198 [math.PR] (Published 2023-03-16)
Large deviations for triangles in scale-free random graphs