Related papers: Random Distance Distribution for Spherical Objects…
The formalism of particle number on a spatial domain for mean field wave functions with pairing is revisited to account for the case where finite dimensional basis are used. The formulas differ from the ones previously used in the…
We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…
This paper concerns a method of testing equality of distribution of random convex compact sets and the way how to use the test to distinguish between two realisations of general random sets. The family of metrics on the space of…
The densest local packings of N identical nonoverlapping spheres within a radius Rmin(N) of a fixed central sphere of the same size are obtained using a nonlinear programming method operating in conjunction with a stochastic search of…
Consider an unlimited homogeneous medium disturbed by points generated via Poisson process. The neighborhood of a point plays an important role in spatial statistics problems. Here, we obtain analytically the distance statistics to $k$th…
The multiple scattering model of a quantum particle in a random Lorentz gas consisting of fixed point scatterers is considered in arbitrary dimension. An efficient method is developed to numerically compute the map of the density of…
We consider $N$ circles of equal radii, $r$, having their centers randomly placed within a square domain $\mathcal{D}$ of size $L \times L$ with periodic boundary conditions ($\mathcal{D} \in \mathbb{R}^2$). When two or more circles…
We study a random partial covering model on the $(d-1)$-dimensional unit sphere, where $N$ spherical caps are placed independently and uniformly at random, each covering a surface fraction of $1/N$. This model provides a continuous…
The densest amorphous packing of rigid particles is known as random close packing. It has long been appreciated that higher densities are achieved by using collections of particles with a variety of sizes. The variety of sizes is often…
A formalism is presented to obtain closed evolution equations for asymptotic probability distribution functions of turbulence magnitudes. The formalism is derived for a generic evolution equation, so that the final result can be easily…
A strong law of large numbers for $d$-dimensional random projections of the $n$-dimensional cube is derived. It shows that with respect to the Hausdorff distance a properly normalized random projection of $[-1,1]^n$ onto $\mathbb{R}^d$…
Saturated random packing of particles built of two identical, relatively shifted spheres in two and three dimensional flat and homogeneous space was studied numerically using random sequential adsorption algorithm. The shift between centers…
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 investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…
Many real phenomena may be modelled as random closed sets in $\mathbb{R}^d$, of different Hausdorff dimensions. In many real applications, such as fiber processes and $n$-facets of random tessellations of dimension $n\leq d$ in spaces of…
Bures distance holds a special place among various distance measures due to its several distinguished features and finds applications in diverse problems in quantum information theory. It is related to fidelity and, among other things, it…
The geometry of unit $N$-dimensional $\ell_{p}$ balls has been intensively investigated in the past decades. A particular topic of interest has been the study of the asymptotics of their projections. Apart from their intrinsic interest,…
The most efficient way to pack equally sized spheres isotropically in 3D is known as the random close packed state, which provides a starting point for many approximations in physics and engineering. However, the particle size distribution…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
We introduce a sharpness functional for probabilistic models that quantifies sharpness as an intrinsic property of the probability distribution. The measure is derived based on a rank-based concentration principle that tracks upward…