Minimum spanning trees of random geometric graphs with location dependent weights

DOI10.3150/20-BEJ1318zbMath1479.05325arXiv2103.00764OpenAlexW3195071726MaRDI QIDQ1983618

Ghurumuruhan Ganesan

Publication date: 10 September 2021

Published in: Bernoulli (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.00764

zbMATH Keywords

minimum spanning treerandom geometric graphslocation dependent edge weights

Mathematics Subject Classification ID

Geometric probability and stochastic geometry (60D05) Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Limit theorems in probability theory (60F99) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connectivity of soft random geometric graphs
• Growth rates of Euclidean minimal spanning trees with power weighted edges
• Probability theory of classical Euclidean optimization problems
• Asymptotics for weighted minimal spanning trees on random points
• The central limit theorem for weighted minimal spanning trees on random points
• Weak laws of large numbers in geometric probability
• Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
• Random Geometric Graphs

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