Typical Distances in Ultrasmall Random Networks

DOI10.1239/aap/1339878725zbMath1244.05199arXiv1102.5680OpenAlexW1977838021MaRDI QIDQ2898920

Steffen Dereich, Peter Mörters, Christian Mönch

Publication date: 12 July 2012

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

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

zbMATH Keywords

diameterpreferential attachmentgraph distanceconfiguration modelscale-free networkpower-law graphconditionally Poissonian graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Paths and cycles (05C38) Combinatorial probability (60C05) Distance in graphs (05C12)

Related Items (14)

Spatial networks and percolation. Abstracts from the workshop held January 17--23, 2021 (hybrid meeting) ⋮ Scale-free network clustering in hyperbolic and other random graphs ⋮ Local weak convergence for PageRank ⋮ Chemical distance in geometric random graphs with long edges and scale-free degree distribution ⋮ MATRIX-MFO tandem workshop: Stochastic reinforcement processes and graphs. Abstracts from the MATRIX-MFO tandem workshop held March 5--10, 2023 ⋮ Large deviations for the degree structure in preferential attachment schemes ⋮ Diameter in ultra‐small scale‐free random graphs ⋮ The idemetric property: when most distances are (almost) the same ⋮ De-anonymization of heterogeneous random graphs in quasilinear time ⋮ The age-dependent random connection model ⋮ Typical distances in a geometric model for complex networks ⋮ Greedy routing and the algorithmic small-world phenomenon ⋮ Unnamed Item ⋮ Distance evolutions in growing preferential attachment graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diameters in preferential attachment models
• Random networks with sublinear preferential attachment: degree evolutions
• Metric structure of random networks
• The diameter of a scale-free random graph
• Random networks with sublinear preferential attachment: the giant component
• Random networks with concave preferential attachment rule
• Distances in random graphs with finite mean and infinite variance degrees
• Probability Inequalities for the Sum of Independent Random Variables
• Universality for distances in power-law random graphs
• The Average Distance in a Random Graph with Given Expected Degrees
• On a conditionally Poissonian graph process

This page was built for publication: Typical Distances in Ultrasmall Random Networks