On the connectivity and diameter of small-world networks
From MaRDI portal
Publication:5443140
DOI10.1239/aap/1198177228zbMath1132.05057MaRDI QIDQ5443140
Publication date: 20 February 2008
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1198177228
05C80: Random graphs (graph-theoretic aspects)
Related Items
Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution, The distribution of the number of isolated nodes in the 1-dimensional soft random geometric graph, Navigation on a Poisson point process, Diameters of random circulant graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The longest edge of the random minimal spanning tree
- Renormalization group analysis of the small-world network model
- Small worlds
- The diameter of a long-range percolation graph
- The small-world phenomenon
- Random Geometric Graphs
- Connectivity of random k-nearest-neighbour graphs
- Continuum Percolation