Nonuniversality of weighted random graphs with infinite variance degree

DOI10.1017/jpr.2016.92zbMath1396.05098arXiv1506.01255OpenAlexW2604389799MaRDI QIDQ4684844

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

Publication date: 26 September 2018

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

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

zbMATH Keywords

universalityconfiguration modelfirst-passage percolationpower-law degree

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Convergence of probability measures (60B10)

Related Items

Local neighbourhoods for first-passage percolation on the configuration model ⋮ The winner takes it all but one ⋮ Long paths in first passage percolation on the complete graph II. Global branching dynamics ⋮ Tight fluctuations of weight-distances in random graphs with infinite-variance degrees ⋮ Network models: structure and function. Abstracts from the workshop held December 10--16, 2017 ⋮ Weighted distances in scale-free configuration models ⋮ Speeding up non-Markovian first-passage percolation with a few extra edges ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ First passage percolation on sparse random graphs with boundary weights ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ Percolation on Random Graphs with a Fixed Degree Sequence ⋮ Distance evolutions in growing preferential attachment graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The winner takes it all
• On explosions in heavy-tailed branching random walks
• Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• First passage percolation on random graphs with finite mean degrees
• Distances in random graphs with finite mean and infinite variance degrees
• Statistical mechanics of complex networks
• A new approach to the giant component problem
• The simple branching process: a note on convergence when the mean is infinite
• The Structure and Function of Complex Networks
• A critical point for random graphs with a given degree sequence
• Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
• Explosiveness of age-dependent branching processes
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Percolation on Sparse Random Graphs with Given Degree Sequence