Stretch and diameter in random geometric graphs
From MaRDI portal
Publication:1702131
DOI10.1007/s00453-016-0253-5zbMath1380.05179OpenAlexW2558759569MaRDI QIDQ1702131
Publication date: 28 February 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-016-0253-5
Social networks; opinion dynamics (91D30) Random graphs (graph-theoretic aspects) (05C80) Stochastic network models in operations research (90B15) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Characterization and structure theory of statistical distributions (62E10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Size of the giant component in a random geometric graph
- Random geometric graph diameter in the unit ball
- Oriented percolation in two dimensions
- Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
- Percolation
- Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
- Random Geometric Graphs