On the connectivity threshold for general uniform metric spaces

DOI10.1016/j.ipl.2010.02.015zbMath1229.68078arXivmath/0604261OpenAlexW2066458074MaRDI QIDQ656572

Gady Kozma, Zvi Lotker, Gideon Stupp

Publication date: 18 January 2012

Published in: Information Processing Letters (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Trees (05C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Connectivity (05C40)

Related Items

An average case analysis of the minimum spanning tree heuristic for the power assignment problem ⋮ Fractal dimension and the persistent homology of random geometric complexes ⋮ Probabilistic connectivity threshold for directional antenna widths ⋮ Probabilistic Connectivity Threshold for Directional Antenna Widths

Cites Work

• The longest edge of the random minimal spanning tree
• The scaling limits of near-critical and dynamical percolation
• A strong law for the longest edge of the minimal spanning tree
• The RSW theorem for continuum percolation and the CLT for Euclidean minimal spanning trees
• Hölder regularity and dimension bounds for random curves
• The minimal spanning tree and the upper box dimension
• Continuum Percolation
• Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item