相关论文: Tight Lower Bounds on the Contact Distance Distrib…

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 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…

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…

While the Euclidean distance characteristics of the Poisson line Cox process (PLCP) have been investigated in the literature, the analytical characterization of the path distances is still an open problem. In this paper, we solve this…

We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this…

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…

This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third…

We introduce a conditional pair distribution function (CPDF) which characterizes the probability density of finding an object (e.g., a particle in a fluid) to certain distance of other, with each of these two having a nearest neighbor to a…

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…

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

An information-theoretic development is given for the problem of compound Poisson approximation, which parallels earlier treatments for Gaussian and Poisson approximation. Let $P_{S_n}$ be the distribution of a sum $S_n=\Sumn Y_i$ of…

New lower bounds on the total variation distance between the distribution of a sum of independent Bernoulli random variables and the Poisson random variable (with the same mean) are derived via the Chen-Stein method. The new bounds rely on…

In this paper we establish lower bounds on information divergence of a distribution on the integers from a Poisson distribution. These lower bounds are tight and in the cases where a rate of convergence in the Law of Thin Numbers can be…

In this paper, we investigate the cumulative distribution functions (CDFs) of the maximum and minimum of multivariate Poisson distributions with three dependence structures, namely, the common shock, comonotonic shock and…

One approach for constructing copula functions is by multiplication. Given that products of cumulative distribution functions (CDFs) are also CDFs, an adjustment to this multiplication will result in a copula model, as discussed by…

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…

We consider the supercritical finite-range random connection model where the points $x,y$ of a homogeneous planar Poisson process are connected with probability $f(|y-x|)$ for a given $f$. Performing percolation on the resulting graph, we…

We consider a weighted sum of a series of independent Poisson random variables and show that it results in a new compound Poisson distribution which includes the Poisson distribution and Poisson distribution of order k. An explicit…

A recently developed approach, conditional probability density functional theory (CP-DFT), yields direct access to the exchange-correlation hole of a system, an important correlation function that is not available from any standard DFT…

We show exponential lower bounds on resolution proof length for pigeonhole principle (PHP) formulas and perfect matching formulas over highly unbalanced, sparse expander graphs, thus answering the challenge to establish strong lower bounds…