Efficient routeing in Poisson small-world networks
From MaRDI portal
Publication:5754679
DOI10.1239/jap/1158784938zbMath1131.05083arXivmath/0508410OpenAlexW2024204460MaRDI 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
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05)
Related Items
Navigation on a Poisson point process ⋮ A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents ⋮ Scaling laws for delay-sensitive traffic in Rayleigh fading networks ⋮ Random walk centrality for temporal networks ⋮ Neighbor selection and hitting probability in small-world graphs ⋮ 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