Efficient routeing in Poisson small-world networks

DOI10.1239/jap/1158784938zbMath1131.05083arXivmath/0508410MaRDI QIDQ5754679

Ayalvadi J. Ganesh, Moez Draief

Publication date: 23 August 2007

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

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

zbMATH Keywords

small world; Random graphs; routeing

Mathematics Subject Classification ID

60D05: Geometric probability and stochastic geometry

05C80: Random graphs (graph-theoretic aspects)

68R10: Graph theory (including graph drawing) in computer science

60C05: Combinatorial probability

Related Items

A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents, Neighbor selection and hitting probability in small-world graphs, Navigation on a Poisson point process, Scaling laws for delay-sensitive traffic in Rayleigh fading networks, Decentralized search on spheres using small-world Markov chains: expected hitting times and structural properties, Eigenvalues of Euclidean random matrices

Cites Work

• Unnamed Item
• Geometry of the uniform spanning forest: transitions in dimensions 4, 8, 12,\dots
• The diameter of long-range percolation clusters on finite cycles
• Small worlds
• The diameter of a long-range percolation graph
• The small-world phenomenon
• Random Geometric Graphs
• Collective dynamics of ‘small-world’ networks
• Navigation in small-world networks: a scale-free continuum model