Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
DOI10.1007/s10955-018-2213-8zbMath1406.05093arXiv1609.07269OpenAlexW2963835249WikidataQ128682787 ScholiaQ128682787MaRDI QIDQ1731016
Enrico Baroni, Júlia Komjáthy, Remco van der Hofstad
Publication date: 6 March 2019
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.07269
Geometric probability and stochastic geometry (60D05) 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 (4)
Cites Work
- Unnamed Item
- On explosions in heavy-tailed branching random walks
- Fixed speed competition on the configuration model with infinite variance degrees: unequal speeds
- Universality for the distance in finite variance random graphs
- On percolation in random graphs with given vertex degrees
- When is a scale-free graph ultra-small?
- Weighted distances in scale-free configuration models
- First passage percolation on random graphs with finite mean degrees
- Distances in random graphs with finite mean and infinite variance degrees
- Random Graphs and Complex Networks
- Critical behavior in inhomogeneous random graphs
- First Passage Percolation on the Erdős–Rényi Random Graph
- The simple branching process: a note on convergence when the mean is infinite
- Nonuniversality of weighted random graphs with infinite variance degree
- One, Two and Three Times log n/n for Paths in a Complete Graph with Random Weights
- Critical Window for Connectivity in the Configuration Model
This page was built for publication: Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
