Article contents
Nearest-neighbor graphs on the cantor set
Published online by Cambridge University Press: 01 July 2016
Abstract
Let be a collection of n uniform, independent, and identically distributed points on the Cantor ternary set. We consider the asymptotics for the expected total edge length of the directed and undirected nearest-neighbor graph on
We prove convergence to a constant of the rescaled expected total edge length of this random graph. The rescaling factor is a function of the fractal dimension and has a log-periodic, nonconstant behavior.
MSC classification
- Type
- Stochastic Geometry and Statistical Applications
- Information
- Copyright
- Copyright © Applied Probability Trust 2009
References
- 1
- Cited by