Short-length routes in low-cost networks via Poisson line patterns

Advances in Applied Probability

Volumn 40, Issue 1, 2008, Pages 1-21

  Aldous, David J ^a   Kendall, Wilfrid S ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

Buffon argument; Excess statistic; Mark distribution; Poisson line process; Probabilistic method; Ratio statistic; Slivynak theorem; Spatial network; Steiner tree; Total variation distance; Vasershtein coupling

Indexed keywords

ASYMPTOTIC ANALYSIS; BOUNDARY CONDITIONS; POISSON DISTRIBUTION; STATISTICS;

BUFFON ARGUMENT; POISSON LINE PROCESS; SLIVYNAK THEOREM; SPATIAL NETWORK; TOTAL VARIATION DISTANCE; VASERSHTEIN COUPLING;

PROBABILITY;

EID: 44649144589     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1208358883     Document Type: Article

References (11)

1. GASTNER, M. T. AND NEWMAN, M. E. J. (2006). Shape and efficiency in spatial distribution networks. J. Statist. Mech. Theory Experiment 2006, P01015.
2. HUG, D., REITZNER, M. AND SCHNEIDER, R. (2004). The limit shape of the zero cell in a stationary Poisson hyperplane tessellation. Ann. Prob. 32, 1140-1167.
3. KOVALENKO, I. N. (1997). A proof of a conjecture of David Kendall on the shape of random polygons of large area. Kibernet. Sistem. Anal. 1997, 187 (in Russian). English translation: Cybernet. Systems Anal. 33, 461-467.
4. KOVALENKO, I. N. (1999). A simplified proof of a conjecture of D. G. Kendall concerning shapes of random polygons. J. Appl. Math. Stoch. Anal. 12, 301-310.
5. LAWLER, G. F., SCHRAMM, O. AND WERNER, W. (2004). Conformal invariance of planar loop-erased random walks and uniform spanning trees. Ann. Prob. 32, 939-995.
6. MILES, R. E. (1995). A heuristic proof of a long-standing conjecture of D. G. Kendall concerning the shapes of certain large random polygons. Adv. Appl. Prob. 27, 397-417.
7. READ, N. (2005). Minimum spanning trees and random resistor networks in d dimensions. Phys. Rev. E 72, 036114.
8. SCHWEITZER, F., EBELING, W., ROSE, H. AND WEISS, O. (1998). Optimization of road networks using evolutionary strategies. Evolutionary Comput. 5, 419-438.
9. STEELE, J. M. (1997). Probability Theory and Combinatorial Optimization (CBMS-NSF Regional Conf. Ser. Appl. Math. 69). Society for Industrial and Applied Mathematics, Philadelphia, PA.
10. STOYAN, D., KENDALL, W. S. AND MECKE, J. (1995). Stochastic Geometry and Its Applicatio, 2nd edn. John Wiley, Chichester.
11. YUKICH, J. E. (1998). Probability Theory of Classical Euclidean Optimization Problems (Lecture Notes Math. 1675). Springer, Berlin.