Lectures on random geometric graphs

DOI10.1017/CBO9781316479988.004MaRDI QIDQ5283766zbMATH OpenOpenAlexFDO

Authors Mathew D. Penrose

Publication date 24 July 2017

Full work available at URL https://doi.org/10.1017/cbo9781316479988.004

zbMATH Keywords

connectivityedge countsHamiltonicitymaximum degreenormal approximation

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Random graphs (graph-theoretic aspects) (05C80)

Recommendations

• scientific article; zbMATH DE number 3891422
• Random graphs, geometry and asymptotic structure
• scientific article; zbMATH DE number 5942363
• Random Geometric Graphs
• Geometric inhomogeneous random graphs
• Probabilistic properties of highly connected random geometric graphs
• Probabilistic properties of highly connected random geometric graphs
• Geodesic cycles in random graphs
• scientific article; zbMATH DE number 446476

Cited in

(8)

• Random graphs, geometry and asymptotic structure
• scientific article; zbMATH DE number 1917747 (Why is no real title available?)
• Geometry, structure and randomness in combinatorics. Lectures of the workshop, Pisa, Italy, September 3--7, 2012
• Learning random points from geometric graphs or orderings
• Hamiltonicity of graphs perturbed by a random geometric graph
• Sharp threshold for embedding balanced spanning trees in random geometric graphs
• Powers of Hamilton cycles in dense graphs perturbed by a random geometric graph
• Sharp threshold for embedding balanced spanning trees in random geometric graphs (extended abstract)

This page was built for publication: Lectures on random geometric graphs

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