Percolating paths through random points

MaRDI QIDQ5485649zbMATH OpenFDO

Authors David Aldous, Maxim Krikun

Publication date 4 September 2006

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

zbMATH Keywords

combinatorial optimizationcontinuum percolationEuclidean traveling salesman problemfirst passage percolationPoisson process

Mathematics Subject Classification ID

Combinatorial probability (60C05) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Asymptotics for Euclidean minimal spanning trees on random points
• Asymptotic of power-weighted Euclidean functionals
• Continuum percolation and Euclidean minimal spanning trees in high dimensions
• On the long edges in the shortest tour through \(n\) random points
• Moderate deviations for shortest-path lengths on random segment processes

Cited in

(4)

• Optimal flow through the disordered lattice
• Household-level economies of scale in transportation
• Percolation and best-choice problem for powers of paths
• The stretch-length tradeoff in geometric networks: average case and worst case study

This page was built for publication: Percolating paths through random points

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485649)