Related papers: Discrete Spacings
A flat membrane with given shape is displayed; two points in the membrane are randomly selected; the probability that the separation between the points have a specified value is sought. A simple method to evaluate the probability density is…
The following anticoncentration property is proved. The probability that the $k$-order statistic of an arbitrarily correlated jointly Gaussian random vector $X$ with unit variance components lies within an interval of length $\varepsilon$…
We define interval spacing as the difference in the order statistics of data over a gap of some width. We derive its density, expected value, and variance for uniform, exponential, and logistic variates. We show that interval spacing is…
We consider random geometric graphs on the plane characterized by a non-uniform density of vertices. In particular, we introduce a graph model where $n$ vertices are independently distributed in the unit disc with positions, in polar…
A sorting network is a shortest path from 12...n to n...21 in the Cayley graph of S_n generated by nearest-neighbour swaps. We prove that for a uniform random sorting network, as n->infinity the space-time process of swaps converges to the…
Concentration of measure is a phenomenon in which a random variable that depends in a smooth way on a large number of independent random variables is essentially constant. The random variable will "concentrate" around its median or…
A Delone set in $\mathbb{R}^n$ is a set such that (a) the distance between any two of its points is uniformly bounded below by a strictly positive constant and such that (b) the distance from any point to the remaining points in the set is…
We study the stochastic $p$-Laplace system in a bounded domain. We propose two new space-time discretizations based on the approximation of time-averaged values. We establish linear convergence in space and $1/2$ convergence in time.…
Clustering is a fundamental problem in data analysis. In differentially private clustering, the goal is to identify $k$ cluster centers without disclosing information on individual data points. Despite significant research progress, the…
The local spectral statistics of random matrices forms distinct universality classes, strongly depending on the position in the spectrum. Surprisingly, the spacing between consecutive eigenvalues at the spectral edges has received little…
Kakutani's random interval-splitting process iteratively divides, via a uniformly random splitting point, the largest sub-interval in a partition of the unit interval. The length of the longest sub-interval after $n$ steps, suitably centred…
We study higher order convexity properties of random point sets in the unit square. Given $n$ uniform i.i.d random points, we derive asymptotic estimates for the maximal number of them which are in $k$-monotone position, subject to mild…
Phenomena with a constrained sample space appear frequently in practice. This is the case e.g. with strictly positive data and with compositional data, like percentages and the like. If the natural measure of difference is not the absolute…
The diameter of a graph measures the maximal distance between any pair of vertices. The diameters of many small-world networks, as well as a variety of other random graph models, grow logarithmically in the number of nodes. In contrast, the…
Anomalous diffusion phenomena occur on length scales spanning from intracellular to astrophysical ranges. A specific form of decay at large argument of the probability density function of rescaled displacement (scaling function) is derived…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
Given n observations, we study the consistency of a batch of k new observations, in terms of their distribution function. We propose a non-parametric, non-likelihood test based on Edgeworth expansion of the distribution function. The…
We propose a model of card shuffling where a pack of cards, spread as points on a square table, are repeatedly gathered locally at random spots and then spread towards a random direction. A shuffling of the cards is then obtained by…
The concentration of measure phenomena were discovered as the mathematical background of statistical mechanics at the end of the XIX - beginning of the XX century and were then explored in mathematics of the XX-XXI centuries. At the…
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…