kth Distance Distributions of n-Dimensional Matérn Cluster Process

07/30/2020
by   Kaushlendra Pandey, et al.
0

In this letter, we derive the CDF (cumulative distribution function) of kth contact distance (CD) and nearest neighbor distance (NND) of the n-dimensional (n-D) Matérn cluster process (MCP). We present a new approach based on the probability generating function (PGF) of the random variable (RV) denoting the number of points in a ball of arbitrary radius to derive its probability mass function (PMF). The proposed method is general and can be used for any point process with known probability generating functional (PGFL). We also validate our analysis via numerical simulations and provide insights using the presented analysis. We also discuss two applications, namely: macro-diversity in cellular networks and caching in D2D networks, to study the impact of clustering on the performance.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2019

On the Contact and Nearest-Neighbor Distance Distributions for the n-Dimensional Matern Cluster Process

This letter provides exact characterization of the contact and nearest-n...
research
10/12/2022

Matern Cluster Process with Holes at the Cluster Centers

Inspired by recent applications of point processes to biological nanonet...
research
05/15/2020

Nearest Neighbor and Contact Distance Distribution for Binomial Point Process on Spherical Surfaces

This letter characterizes the statistics of the contact distance and the...
research
06/19/2018

Deterministic O(1)-Approximation Algorithms to 1-Center Clustering with Outliers

The 1-center clustering with outliers problem asks about identifying a p...
research
12/05/2018

Unified Analysis of HetNets using Poisson Cluster Process under Max-Power Association

Owing to its flexibility in modeling real-world spatial configurations o...
research
04/20/2015

Nonparametric Nearest Neighbor Random Process Clustering

We consider the problem of clustering noisy finite-length observations o...
research
08/24/2020

On the k Nearest-Neighbor Path Distance from the Typical Intersection in the Manhattan Poisson Line Cox Process

In this paper, we consider a Cox point process driven by the Manhattan P...

Please sign up or login with your details

Forgot password? Click here to reset