Weighted distances in scale-free configuration models

DOI10.1007/s10955-018-1957-5zbMath1404.05187arXiv1709.09481OpenAlexW3103158139WikidataQ92730047 ScholiaQ92730047MaRDI QIDQ1756556

Júlia Komjáthy, Erwin Adriaans

Publication date: 21 December 2018

Published in: Journal of Statistical Physics (Search for Journal in Brave)

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

zbMATH Keywords

first passage percolationrandom networksconfiguration modelscale-freetypical distancespower-law degrees

Mathematics Subject Classification ID

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

Related Items

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 ⋮ Explosion in weighted hyperbolic random graphs and geometric inhomogeneous random graphs ⋮ Penalising transmission to hubs in scale-free spatial random graphs ⋮ Distance evolutions in growing preferential attachment graphs

Cites Work

• Unnamed Item
• Scale-free percolation
• On explosions in heavy-tailed branching random walks
• Distance in random graphs with infinite mean degrees
• Universality for the distance in finite variance random graphs
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• When is a scale-free graph ultra-small?
• First passage percolation on random graphs with finite mean degrees
• Universality for first passage percolation on sparse random graphs
• Distances in random graphs with finite mean and infinite variance degrees
• From the Cover: The structure of scientific collaboration networks
• A Spatial Preferential Attachment Model with Local Clustering
• Extreme value theory, Poisson-Dirichlet distributions, and first passage percolation on random networks
• Statistical mechanics of complex networks
• A Spatial Web Graph Model with Local Influence Regions
• Emergence of Scaling in Random Networks
• First Passage Percolation on the Erdős–Rényi Random Graph
• A new approach to the giant component problem
• The simple branching process: a note on convergence when the mean is infinite
• Nonuniversality of weighted random graphs with infinite variance degree
• First Passage Percolation on Inhomogeneous Random Graphs
• Distances in random graphs with finite variance degrees
• Collective dynamics of ‘small-world’ networks
• The diameter of sparse random graphs