Minimum spanning trees of random geometric graphs with independent edge weights

DOI10.1007/S13171-025-00423-8MaRDI QIDQ6845196zbMATH OpenFDO

Authors Ghurumuruhan Ganesan

Publication date 13 March 2026

Published in Sankhyā. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S13171-025-00423-8

zbMATH Keywords

\(L^2\)-convergencedeviation estimatesminimum weight spanning treesrandom geometric graphsvariance bounds

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Geometric probability and stochastic geometry (60D05) (L^p)-limit theorems (60F25)

Cites work

• A random tree model associated with random graphs
• An Efron-Stein inequality for nonsymmetric statistics
• scientific article; zbMATH DE number 1984546 (Why is no real title available?)
• Minimum spanning trees of random geometric graphs with location dependent weights
• On the value of a random minimum spanning tree problem
• Random Geometric Graphs
• Strong and weighted matchings in inhomogenous random graphs
• The central limit theorem for weighted minimal spanning trees on random points
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• The scaling limit of the minimum spanning tree of the complete graph
• Weak laws of large numbers in geometric probability

This page was built for publication: Minimum spanning trees of random geometric graphs with independent edge weights

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