The winner takes it all but one

DOI10.1017/jpr.2023.23arXiv2204.04125MaRDI QIDQ6198965

Matteo Sfragara, Maria Deijfen, Remco van der Hofstad

Publication date: 23 February 2024

Published in: Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

random graphscoexistencefirst passage percolationconfiguration modelcompeting growth

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The winner takes it all
• Distance in random graphs with infinite mean degrees
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
• Coexistence for Richardson type competing spatial growth models
• Coexistence in two-type first-passage percolation models
• Absence of mutual unbounded growth for almost all parameter values in the two-type Richardson model.
• First passage percolation on random graphs with finite mean degrees
• Universality for first passage percolation on sparse random graphs
• Weak disorder asymptotics in the stochastic mean-field model of distance
• Distances in random graphs with finite mean and infinite variance degrees
• A Random Graph Model for Power Law Graphs
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• Statistical mechanics of complex networks
• 50 Years of First-Passage Percolation
• The Pleasures and Pains of Studying the Two-Type Richardson Model
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• First passage percolation and a model for competing spatial growth
• The Structure and Function of Complex Networks
• Nonuniversality of weighted random graphs with infinite variance degree
• A critical point for random graphs with a given degree sequence
• Competing first passage percolation on random graphs with finite variance degrees
• Competing first passage percolation on random regular graphs
• Distances in random graphs with finite variance degrees

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