Diameter and broadcast time of random geometric graphs in arbitrary dimensions
DOI10.1007/S00453-012-9710-YzbMATH Open1275.05050OpenAlexW2019565283MaRDI QIDQ378238FDOQ378238
Authors: Tobias Friedrich, Thomas Sauerwald, Alexandre Stauffer 
Publication date: 11 November 2013
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: http://opus.bath.ac.uk/36409/5/Stauffer_Algorithmica.pdf
Recommendations
diametergraph distancerandom geometric graphslargest connected componentrandomized broadcast algorithmrandomized rumor spreading: Euclidean distance
Random graphs (graph-theoretic aspects) (05C80) Communication theory (94A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12)
Cites Work
- Random Geometric Graphs
- Percolation
- Continuum Percolation
- Thresholding random geometric graph properties motivated by ad hoc sensor networks
- Domination by product measures
- Surface order large deviations for high-density percolation
- Title not available (Why is that?)
- The shortest-path problem for graphs with random arc-lengths
- On Spreading a Rumor
- The longest edge of the random minimal spanning tree
- On the runtime and robustness of randomized broadcasting
- On the chemical distance for supercritical Bernoulli percolation
- Large deviations for discrete and continuous percolation
- First passage percolation for random colorings of \(\mathbb{Z}^ d\)
- On the cover time and mixing time of random geometric graphs
- Randomized broadcast in networks
- The cover time of the giant component of a random graph
- Rumor spreading on random regular graphs and expanders
- Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
- The cover time of random geometric graphs
- Title not available (Why is that?)
- On mixing and edge expansion properties in randomized broadcasting
- Random geometric graph diameter in the unit ball
Cited In (17)
- Super-exponential extinction time of the contact process on random geometric graphs
- On linear-time data dissemination in dynamic rooted trees
- Topology-hiding computation beyond logarithmic diameter
- Detecting a botnet in a network
- On the diameter of hyperbolic random graphs
- On the diameter of hyperbolic random graphs
- Ratio convergence rates for Euclidean first-passage percolation: applications to the graph infinity Laplacian
- Consensus dynamics on random rectangular graphs
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- Topology-hiding computation on all graphs
- Rumors spread slowly in a small-world spatial network
- Title not available (Why is that?)
- Stretch and diameter in random geometric graphs
- Robustness of randomized rumour spreading
- Title not available (Why is that?)
- Space-time percolation and detection by mobile nodes
- On the Push&Pull Protocol for Rumor Spreading
This page was built for publication: Diameter and broadcast time of random geometric graphs in arbitrary dimensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q378238)
