Related papers: Nearest Neighbor and Contact Distance Distribution…
We characterize the statistics of nearest-neighbor and contact distance distributions for Thomas cluster process (TCP), which is a special case of Poisson cluster process. In particular, we derive the cumulative distribution function (CDF)…
In this letter, we derive the cumulative density function (CDF) of the nearest neighbor and contact distance distributions of the Matern cluster process (MCP) in R2. These results will be useful in the performance analysis of many…
In this paper we present an analytic framework for formulating the statistical distribution of the nearest neighbour distance in hard-core point processes. We apply this framework to Mat\'{e}rn hard-core point process (MHC) to derive the…
The use of summary statistics beyond the two-point correlation function to analyze the non-Gaussian clustering on small scales is an active field of research in cosmology. In this paper, we explore a set of new summary statistics -- the…
The $k$-Nearest Neighbour Cumulative Distribution Functions are measures of clustering for discrete datasets that are fast and efficient to compute. They are significantly more informative than the 2-point correlation function. Their…
In this letter, we derive the CDF (cumulative distribution function) of $k$th contact distance (CD) and nearest neighbor distance (NND) of the $n$-dimensional ($n$-D) Mat\'ern cluster process (MCP). We present a new approach based on the…
This letter derives closed-form expressions for the probability density function of the distance between two nodes located in heterogeneous concentric geometries, namely a disk or sphere and a surrounding annulus or spherical shell. Two…
Distances to the $k$-nearest-neighbor ($k$NN) data points from volume-filling query points are a sensitive probe of spatial clustering. Here we present the first application of $k$NN summary statistics to observational clustering…
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…
How to distribute a set of points uniformly on a spherical surface is a very old problem that still lacks a definite answer. In this work, we introduce a physical measure of uniformity based on the distribution of distances between points,…
We study point processes on $\mathbb S^d$, the $d$-dimensional unit sphere $\mathbb S^d$, considering both the isotropic and the anisotropic case, and focusing mostly on the spherical case $d=2$. The first part studies reduced Palm…
Cross-correlations between datasets are used in many different contexts in cosmological analyses. Recently, $k$-Nearest Neighbor Cumulative Distribution Functions ($k{\rm NN}$-${\rm CDF}$) were shown to be sensitive probes of cosmological…
The goal of this paper is to quantitatively describe some statistical properties of higher-dimensional determinantal point processes with a primary focus on the nearest-neighbor distribution functions. Toward this end, we express these…
The nearest-neighbor rule is a well-known classification technique that, given a training set P of labeled points, classifies any unlabeled query point with the label of its closest point in P. The nearest-neighbor condensation problem aims…
In this paper, we consider a Cox point process driven by the Manhattan Poisson line process. We calculate the exact cumulative distribution function (CDF) of the path distance (L1 norm) between a randomly selected intersection and the…
In this letter, we derive new lower bounds on the cumulative distribution function (CDF) of the contact distance in the Poisson Hole Process (PHP) for two cases: (i) reference point is selected uniformly at random from $\mathbb{R}^2$…
The exact computation of the nearest-neighbor spacing distribution P(s) is performed for a rectangular billiard with point-like scatterer inside for periodic and Dirichlet boundary conditions and it is demonstrated that for large s this…
Cooperation in cellular networks is a promising scheme to improve system performance. Existing works consider that a user dynamically chooses the stations that cooperate for his/her service, but such assumption often has practical…
We introduce the binomial line process (BLP), a novel spatial stochastic model for the characterization of streets in the statistical evaluation of wireless and vehicular networks. Existing stochastic geometry models for streets, e.g.,…
The closest pair problem (CPP) is one of the well studied and fundamental problems in computing. Given a set of points in a metric space, the problem is to identify the pair of closest points. Another closely related problem is the fixed…