Matern Cluster Process with Holes at the Cluster Centers

Inspired by recent applications of point processes to biological nanonetworks, this paper presents a novel variant of a Matérn cluster process (MCP) in which the points located within a certain distance from the cluster centers are removed. We term this new process the MCP with holes at the cluster center (MCP-H, in short). Focusing on the three-dimensional (3D) space, we first characterize the conditional distribution of the distance between an arbitrary point of a given cluster to the origin, conditioned on the location of that cluster, for both MCP and MCP-H. These distributions are shown to admit remarkably simple closed forms in the 3D space, which is not even possible in the simpler two-dimensional (2D) case. Using these distributions, the contact distance distribution and the probability generating functional (PGFL) are characterized for both MCP and MCP-H.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/30/2020

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

In this letter, we derive the CDF (cumulative distribution function) of ...
research
08/30/2022

Fundamentals of Clustered Molecular Nanonetworks

We present a comprehensive approach to the modeling, performance analysi...
research
12/10/2015

Norm-Free Radon-Nikodym Approach to Machine Learning

For Machine Learning (ML) classification problem, where a vector of x--o...
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/23/2020

Quantizing Multiple Sources to a Common Cluster Center: An Asymptotic Analysis

We consider quantizing an Ld-dimensional sample, which is obtained by co...
research
10/19/2016

Clustering by connection center evolution

The determination of cluster centers generally depends on the scale that...
research
07/31/2018

K-medoids Clustering of Data Sequences with Composite Distributions

This paper studies clustering of data sequences using the k-medoids algo...

Please sign up or login with your details

Forgot password? Click here to reset