Diameter in ultra‐small scale‐free random graphs

DOI10.1002/rsa.20798zbMath1414.05098arXiv1605.02714OpenAlexW2962947216WikidataQ64894148 ScholiaQ64894148MaRDI QIDQ5381052

Remco van der Hofstad, Francesco Caravenna, Alessandro Garavaglia

Publication date: 7 June 2019

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

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

zbMATH Keywords

random graphsdiameterconfiguration modelpreferential attachment modelscale free graphultra-small graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Distance in graphs (05C12)

Related Items

Local weak convergence for PageRank, MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023, Diameter in ultra‐small scale‐free random graphs, Linking the mixing times of random walks on static and dynamic random graphs, Distance evolutions in growing preferential attachment graphs

Cites Work

• Universality for the distance in finite variance random graphs
• Diameters in preferential attachment models
• When is a scale-free graph ultra-small?
• The diameter of a scale-free random graph
• Distances in random graphs with finite mean and infinite variance degrees
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex Networks
• Typical Distances in Ultrasmall Random Networks
• The Probability That a Random Multigraph is Simple
• A Phase Transition for the Diameter of the Configuration Model
• The Diameter of Random Graphs
• Paths in graphs
• The Diameter of Sparse Random Graphs
• Distances in random graphs with finite variance degrees
• Diameter in ultra‐small scale‐free random graphs
• The diameter of sparse random graphs
• The average distances in random graphs with given expected degrees
• The diameter of sparse random graphs