Related papers: Nearest Neighbour Distance Distribution in Hard-Co…
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…
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…
This letter characterizes the statistics of the contact distance and the nearest neighbor (NN) distance for binomial point processes (BPP) spatially-distributed on spherical surfaces. We consider a setup of $n$ concentric spheres, with each…
Inspired by recent applications of point processes to biological nanonetworks, this paper presents a novel variant of a Mat\'ern cluster process (MCP) in which the points located within a certain distance from the cluster centers are…
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…
Nearest-neighbor search, which returns the nearest neighbor of a query point in a set of points, is an important and widely studied problem in many fields, and it has wide range of applications. In many of them, such as sensor databases,…
The Mat\'ern hard-core processes are classical examples for point process models obtained from (marked) Poisson point processes. Points of the original Poisson process are deleted according to a dependent thinning rule, resulting in a…
Meshless methods approximate operators in a specific node as a weighted sum of values in its neighbours. Higher order approximations of derivatives provide more accurate solutions with better convergence characteristics, but they come at…
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…
Core decomposition is a classic technique for discovering densely connected regions in a graph with large range of applications. Formally, a $k$-core is a maximal subgraph where each vertex has at least $k$ neighbors. A natural extension of…
K-Nearest Neighbours (k-NN) is a popular classification and regression algorithm, yet one of its main limitations is the difficulty in choosing the number of neighbours. We present a Bayesian algorithm to compute the posterior probability…
Several researchers proposed using non-Euclidean metrics on point sets in Euclidean space for clustering noisy data. Almost always, a distance function is desired that recognizes the closeness of the points in the same cluster, even if the…
Mat\'ern's hard-core processes are valuable point process models in spatial statistics. In order to extend their field of application, Mat\'ern's original models are generalized here, both as point processes and particle processes. The…
In this paper, we derive an explicit upper bound for the Wasserstein distance between a functional of point processes and a Gaussian distribution. Using Stein's method in conjunction with Malliavin's calculus and the Poisson embedding…
We study different ways of determining the mean distance $ < r_n >$ between a reference point and its $n$-th neighbour among random points distributed with uniform density in a $D$-dimensional Euclidean space. First we present a heuristic…
Consider that the coordinates of $N$ points are randomly generated along the edges of a $d$-dimensional hypercube (random point problem). The probability that an arbitrary point is the $m$th nearest neighbor to its own $n$th nearest…
Computing approximate nearest neighbors in high dimensional spaces is a central problem in large-scale data mining with a wide range of applications in machine learning and data science. A popular and effective technique in computing…
Consider a setting with multiple units (e.g., individuals, cohorts, geographic locations) and outcomes (e.g., treatments, times, items), where the goal is to learn a multivariate distribution for each unit-outcome entry, such as the…
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…