相关论文: Discrete Spacings
Given a set $P$ of $n$ points in $\mathbf{R}^d$, and a positive integer $k \leq n$, the $k$-dispersion problem is that of selecting $k$ of the given points so that the minimum inter-point distance among them is maximized (under Euclidean…
We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…
Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform…
Designing efficient, effective, and consistent metric clustering algorithms is a significant challenge attracting growing attention. Traditional approaches focus on the stability of cluster centers; unfortunately, this neglects the…
Given a subset of size $k$ of a very large universe a randomized way to find this subset could consist of deleting half of the universe and then searching the remaining part. With a probability of $2^{-k}$ one will succeed. By probability…
We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…
We investigate the order of the $r$-th, $1\le r < +\infty$, central moment of the length of the longest common subsequence of two independent random words of size $n$ whose letters are identically distributed and independently drawn from a…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
We study translation-invariant determinantal random point fields on the real line. We prove, under quite general conditions, that the smallest nearest spacings between the particles in a large interval have Poisson statistics as the length…
It is shown that space-time may possess the differentiability properties of manifolds as well as the ultraviolet finiteness properties of lattices. Namely, if a field's amplitudes are given on any sufficiently dense set of discrete points…
In this paper, we present methods of obtaining single moments of order statistics arising from posibly dependent and non-identically distributed discrete random variables. We derive exact and approximate formulas convenient for numerical…
We introduce methods to bound the mean of a discrete distribution (or finite population) based on sample data, for random variables with a known set of possible values. In particular, the methods can be applied to categorical data with…
We study random points on the real line generated by the eigenvalues in unitary invariant random matrix ensembles or by more general repulsive particle systems. As the number of points tends to infinity, we prove convergence of the…
The problem of clustering a set of points moving on the line consists of the following: given positive integers n and k, the initial position and the velocity of n points, find an optimal k-clustering of the points. We consider two…
Discretization of the uniform norm of functions from a given finite dimensional subspace of continuous functions is studied. Previous known results show that for any $N$-dimensional subspace of the space of continuous functions it is…
The {\alpha}-Kakutani substitution rule splits the unit interval into two subintervals of lengths alpha and 1 - {\alpha}, for a fixed {\alpha} in (0,1). A simple inflation-substitution procedure produces tilings of the real line and their…
Given a minimum measurable length underlying spacetime, the latter may be effectively regarded as discrete, at scales of order the Planck length. A systematic discretization of continuum physics may be effected most efficiently through the…
The (conditional or unconditional) distribution of the continuous scan statistic in a one-dimensional Poisson process may be approximated by that of a discrete analogue via time discretization (to be referred to as the discrete…
Consider two unit balls in a $d$-dimensional flat torus with edge length $r$, for $d\geq 2$. The balls do not move by themselves but they are pushed by a Brownian motion. The balls never intersect---they reflect if they touch. It is proved…
We consider an infinite-dimensional stochastic clustering model on $\mathbb{R}$. In discrete time, each point of a unit-intensity simple point process moves halfway toward either of its left or right neighbors, chosen uniformly at random.…