Stretch and diameter in random geometric graphs

DOI10.1007/S00453-016-0253-5MaRDI QIDQ1702131zbMATH OpenOpenAlexFDO

Authors Ghurumuruhan Ganesan

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

zbMATH Keywords

diameterrandom geometric graphsstretch property

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Characterization and structure theory of statistical distributions (62E10) Social networks; opinion dynamics (91D30) Combinatorial probability (60C05) Stochastic network models in operations research (90B15)

Recommendations

• Diameters of random distance graphs
• Random geometric graph diameter in the unit ball
• On the diameter of a class of random graphs
• On the diameter of hyperbolic random graphs
• On the diameter of hyperbolic random graphs
• The diameter of inhomogeneous random graphs
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Diameters of random circulant graphs
• On the diameter of random planar graphs

Cites work

• scientific article; zbMATH DE number 1254188 (Why is no real title available?)
• scientific article; zbMATH DE number 6297797 (Why is no real title available?)
• Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• Oriented percolation in two dimensions
• Percolation
• Random Geometric Graphs
• Random geometric graph diameter in the unit ball
• Size of the giant component in a random geometric graph
• The bin-covering technique for thresholding random geometric graph properties

Cited in

(9)

• Random geometric graph diameter in the unit ball
• Graph Drawing
• Approximating the Stretch Factor of Euclidean Graphs
• Constrained minimum passage time in random geometric graphs
• Consensus dynamics on random rectangular graphs
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions
• On the stretch factor of randomly embedded random graphs
• Size of the giant component in a random geometric graph
• Diameter and broadcast time of random geometric graphs in arbitrary dimensions

This page was built for publication: Stretch and diameter in random geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1702131)