Competing first passage percolation on random graphs with finite variance degrees

DOI10.1002/rsa.20846zbMath1479.05320arXiv1711.02902OpenAlexW2920773363WikidataQ128301176 ScholiaQ128301176MaRDI QIDQ4973636

Daniel Ahlberg, Maria Deijfen, Svante Janson

Publication date: 28 November 2019

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

random graphscoexistencefirst passage percolationconfiguration modelcompeting growthcontinuous-time branching process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (2)

The winner takes it all but one ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017

This page was built for publication: Competing first passage percolation on random graphs with finite variance degrees