Shortest path distance in Manhattan Poisson line Cox process
From MaRDI portal
Publication:2659333
DOI10.1007/s10955-020-02657-2zbMath1466.60017arXiv1811.11332OpenAlexW3093729238MaRDI QIDQ2659333
Harpreet S. Dhillon, Vishnu Vardhan Chetlur, Carl P. Dettmann
Publication date: 26 March 2021
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1811.11332
shortest pathstochastic geometrypath distanceManhattan Poisson line Cox processManhattan Poisson line process
Geometric probability and stochastic geometry (60D05) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simulation of typical Cox-Voronoi cells with a special regard to implementation tests
- Connected spatial networks over random points and a route-length statistic
- Random line tessellations of the plane: Statistical properties of many-sided cells
- Statistical properties of planar Voronoi tessellations
- The various aggregates of random polygons determined by random lines in a plane
- Hammersley's interacting particle process and longest increasing subsequences
- Percolation in the vacant set of Poisson cylinders
- Distribution of cell area in bounded Poisson Voronoi tessellations with application to secure local connectivity
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks
- Planar line processes for void and density statistics in thin stochastic fibre networks
- Scaling limits for shortest path lengths along the edges of stationary tessellations
- Stochastic Geometry for Wireless Networks
- RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE, II
- RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
- Random Distribution of Lines in a Plane
This page was built for publication: Shortest path distance in Manhattan Poisson line Cox process
