相关论文: Discrete Spacings

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…

We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…

Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…

We study the distribution of the minimum spacing between eigenvalues of a random n by n unitary matrix. The minimum spacing scales as $n^{-4/3}$, not $n^{-2}$ as would be the case for n independent points on the unit circle, illustrating…

Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…

Let n points be taken at random on a circle of unit circumference and clockwise ordered. Uniform spacings are defined as the clockwise arc-lengths between the successive points from this sample. We are interested in the asymptotic behavior…

A sorting network is a shortest path from $12\dots n$ to $n\dots 21$ in the Cayley graph of the symmetric group $\mathfrak S_n$ spanned by adjacent transpositions. The paper computes the edge local limit of the uniformly random sorting…

Dispersion is a fundamental concept in statistics, yet standard approaches - especially via stochastic orders - face limitations in the discrete setting. In particular, the classical dispersive order, well-established for continuous…

Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…

The discrete distribution of the length of longest increasing subsequences in random permutations of $n$ integers is deeply related to random matrix theory. In a seminal work, Baik, Deift and Johansson provided an asymptotics in terms of…

We consider a noninteracting disordered system designed to model particle diffusion, relaxation in glasses, and impurity bands of semiconductors. Disorder originates in the random spatial distribution of sites. We find strong numerical…

The bounds for absolute moments of order statistics are established. Let $X_1,\dots ,X_n$ be independent identically distributed real-valued random variables and let $X_{1:n}\le \dots \le X_{n:n}$ be the corresponding order statistics. The…

Suppose $k$ centers are fit to $m$ points by heuristically minimizing the $k$-means cost; what is the corresponding fit over the source distribution? This question is resolved here for distributions with $p\geq 4$ bounded moments; in…

Consider a random permutation of $kn$ objects that permutes $n$ disjoint blocks of size $k$ and then permutes elements within each block. Normalizing its cycle lengths by $kn$ gives a random partition of unity, and we derive the limit law…

We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…

We study two types of probability measures on the set of integer partitions of $n$ with at most $m$ parts. The first one chooses the random partition with a chance related to its largest part only. We then obtain the limiting distributions…

We prove a general theorem to bound the total variation distance between the distribution of an integer valued random variable of interest and an appropriate discretized normal distribution. We apply the theorem to 2-runs in a sequence of…

For an unknown continuous distribution on a real line, we consider the approximate estimation by the discretization. There are two methods for the discretization. First method is to divide the real line into several intervals before taking…

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…