MPLCP
swMATH ID:  37888 
Software Authors:  Chetlur, V.V., Dhillon, H.S., Dettmann, C.P. 
Description:  Shortest path distance in Manhattan Poisson line Cox process. While the Euclidean distance characteristics of the Poisson line Cox process (PLCP) have been investigated in the literature, the analytical characterization of the path distances is still an open problem. In this paper, we solve this problem for the stationary Manhattan Poisson line Cox process (MPLCP), which is a variant of the PLCP. Specifically, we derive the exact cumulative distribution function (CDF) for the length of the shortest path to the nearest point of the MPLCP in the sense of path distance measured from two reference points: (i) the typical intersection of the Manhattan Poisson line process (MPLP), and (ii) the typical point of the MPLCP. We also discuss the application of these results in infrastructure planning, wireless communication, and transportation networks. 
Homepage:  https://github.com/stochasticgeometry/ShortestpathdistanceMPLCP 
Source Code:  https://github.com/stochasticgeometry/ShortestpathdistanceMPLCP 
Keywords:  stochastic geometry; Manhattan Poisson line process; Manhattan Poisson line Cox process; path distance; shortest path 
Related Software:  GitHub 
Cited in:  2 Publications 
Standard Articles
1 Publication describing the Software, including 1 Publication in zbMATH  Year 

Shortest path distance in Manhattan Poisson line Cox process. Zbl 1466.60017 Chetlur, Vishnu Vardhan; Dhillon, Harpreet S.; Dettmann, Carl P. 
2020

Cited by 4 Authors
2  Dhillon, Harpreet Singh 
1  Chetlur, Vishnu Vardhan 
1  Dettmann, Carl P. 
1  Parida, Priyabrata 
Cited in 1 Serial
2  Journal of Statistical Physics 
Cited in 3 Fields
2  Probability theory and stochastic processes (60XX) 
1  Statistical mechanics, structure of matter (82XX) 
1  Information and communication theory, circuits (94XX) 