Nearest-neighbor graphs on the cantor set
From MaRDI portal
Publication:3625646
DOI10.1239/aap/1240319576zbMath1161.60009OpenAlexW1966080870MaRDI QIDQ3625646
Publication date: 6 May 2009
Published in: Advances in Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1239/aap/1240319576
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Functional iterations and periodic oscillations for simple random walk on the Sierpiński graph
- General spacefilling curve heuristics and limit theory for the traveling salesman problem
- Probability theory of classical Euclidean optimization problems
- Central limit theorems for \(k\)-nearest neighbour distances
- Gaussian limits for random measures in geometric probability
- Weak laws of large numbers in geometric probability
- Limit theory for random sequential packing and deposition
- Explicit and asymptotic formulae for the expected values of the order statistics of the Cantor distribution
- Travelling Salesman with a Self-Similar Itinerary
- Spacefilling curves and the planar travelling salesman problem
- The standard Cantor function is subadditive
This page was built for publication: Nearest-neighbor graphs on the cantor set