On the Contact and Nearest-Neighbor Distance Distributions for the n-Dimensional Matern Cluster Process
Kaushlendra Pandey, Harpreet S. Dhillon, Abhishek K. Gupta

TL;DR
This paper derives exact formulas and bounds for contact and nearest-neighbor distances in the n-dimensional Matern cluster process, aiding the analysis of wireless networks modeled by this process.
Contribution
It provides the first exact characterizations and bounds for these distributions in n-D MCP, extending previous 2D and 3D results.
Findings
Exact distributions for contact and nearest-neighbor distances in n-D MCP
Novel upper and lower bounds for these distributions
Applicability to wireless network performance analysis
Abstract
This letter provides exact characterization of the contact and nearest-neighbor distance distributions for the n dimensional (n-D) Matern cluster process (MCP). We also provide novel upper and lower bounds to these distributions in order to gain useful insights about their behavior. The two and three dimensional versions of these results are directly applicable to the performance analyses of wireless networks modeled as MCP.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
