Related papers: Distance Distributions in Regular Polygons

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…

Given an m-dimensional compact submanifold $\mathbf{M}$ of Euclidean space $\mathbf{R}^s$, the concept of mean location of a distribution, related to mean or expected vector, is generalized to more general $\mathbf{R}^s$-valued functionals…

Two points are randomly selected inside a three-dimensional euclidian cube. The value l of their separation lies somewhere between zero and the length of a diagonal of the cube. The probability density P(l) of the separation is obtained…

The paper provides a description of the large deviation behavior for the Euclidean norm of projections of $\ell_p^n$-balls to high-dimensional random subspaces. More precisely, for each integer $n\geq 1$, let $k_n\in\{1,\ldots,n-1\}$,…

Suppose that there is a family of $n$ random points $X_v$ for $v \in V$, independently and uniformly distributed in the square $\left[-\sqrt{n}/2,\sqrt{n}/2\right]^2$ of area $n$. We do not see these points, but learn about them in one of…

We evaluate numerically the velocity field distributions produced by a bounded, two-dimensional fluid model consisting of a collection of parallel ideal line vortices. We sample at many spatial points inside a rigid circular boundary. We…

Using a suite of self-similar cosmological simulations, we measure the probability distribution functions (PDFs) of real-space density, redshift-space density, and their geometric mean. We find that the real-space density PDF is…

We study the asymptotic behaviour of the maximum interpoint distance of random points in a planar bounded set with an unique major axis and a boundary behaving like an ellipse at the endpoints. Our main result covers the case of uniformly…

Probability density functions (PDF) of statistical distributions of cluster sizes N, where N is the number of particles in the cluster, often seem to have less freedom than expected from considering the number of degrees of freedom at the…

Given any polyhedron from which we select two random points uniformly and independently, we show that all the moments of the distance between those points can be always written in terms of elementary functions. As an illustration, the mean…

We consider a sequence of identically independently distributed random samples from an absolutely continuous probability measure in one dimension with unbounded density. We establish a new rate of convergence of the $\infty-$Wasserstein…

In this paper, we consider fixed edgelength $n$-step random walks in $\mathbb{R}^d$. We give an explicit construction for the closest closed equilateral random walk to almost any open equilateral random walk based on the geometric median,…

Given an elliptic curve $E$ and a point $P$ in $E(\mathbb{R})$, we investigate the distribution of the points $nP$ as $n$ varies over the integers, giving bounds on the $x$ and $y$ coordinates of $nP$ and determining the natural density of…

For a convex body $K\subset\mathbb{R}^d$ the mean distance $\Delta(K)=\mathbb{E}|X_1-X_2|$ is the expected Euclidean distance of two independent and uniformly distributed random points $X_1,X_2\in K$. Optimal lower and upper bounds for…

A probability distribution function is presented which provides a realistic description of the detection of scattered photons. The resulting probabilities can be described analytically by means of a superposition of several special…

We give a highly efficient "semi-agnostic" algorithm for learning univariate probability distributions that are well approximated by piecewise polynomial density functions. Let $p$ be an arbitrary distribution over an interval $I$ which is…

We investigate $(2+1)$-dimensional discretized directed polymers in Gaussian random media. By numerically calculating the probability distribution function of overlap between two independent and identical systems on a common random…

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…

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

We consider the problem of computing L1-distances between every pair ofcprobability densities from a given family. We point out that the technique of Cauchy random projections (Indyk'06) in this context turns into stochastic integrals with…