相关论文: Discrete Spacings
The measurement of dispersion is one of the most fundamental and ubiquitous statistical concepts, in both applied and theoretical contexts. For dispersion measures, such as the standard deviation, to effectively capture the variability of a…
This paper gives a simple proof of a limit theorem for the lenght of the largest interval straddling a fixed number of i.i.d. points uniformly disributed on a unit interval. The key step in our argument is a classical theorem of Watson…
We study "distance spheres": the set of points lying at constant distance from a fixed arbitrary subset $K$ of $[0,1]^d$. We show that, away from the regions where $K$ is "too dense" and a set of small volume, we can decompose $[0,1]^d$…
String sorting is an important part of tasks such as building index data structures. Unfortunately, current string sorting algorithms do not scale to massively parallel distributed-memory machines since they either have latency (at least)…
We consider diffraction at random point scatterers on general discrete point sets in $\R^\nu$, restricted to a finite volume. We allow for random amplitudes and random dislocations of the scatterers. We investigate the speed of convergence…
We study the problem of discrete distribution estimation in KL divergence and provide concentration bounds for the Laplace estimator. We show that the deviation from mean scales as $\sqrt{k}/n$ when $n \ge k$, improving upon the best prior…
Pinning and depinning of wave fronts are ubiquitous features of spatially discrete systems describing a host of phenomena in physics, biology, etc. A large class of discrete systems is described by overdamped chains of nonlinear oscillators…
The distribution of the spacing, or the difference between consecutive order statistics, is known only for uniform and exponential random variates. We add here logistic and Gumbel variates, and present an estimator for distributions with a…
The distribution function of particles over clusters is proposed for a system of identical intersecting spheres, the centres of which are uniformly distributed in space. Consideration is based on the concept of the rank number of clusters,…
A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a "preferential attachment" rule: the current vertex selects an image i with probability proportional to a given…
We study conserved one-dimensional models of particle diffusion, attachment and detachment from clusters, where the detachment rates decrease with increasing cluster size as gamma(m) ~ m^{-k}, k>0. Heuristic scaling arguments based on…
Consider two independent random strings having same length and taking values uniformly in a common finite alphabet. We study the order of the variance of the length of the longest common subsequences (LCS) of these strings when long blocks,…
In this article we investigate the asymptotic behavior of a new class of multi-dimensional diffusions in random environment. We introduce cut times in the spirit of the work done by Bolthausen, Sznitman and Zeitouni, see [4], in the…
Three aspects of time series are uncertainty (dispersion at a given time scale), scaling (time-scale dependence), and intermittency (inclination to change dynamics). Simple measures of dispersion are the mean absolute deviation and the…
The problem of constrained $k$-center clustering has attracted significant attention in the past decades. In this paper, we study balanced $k$-center cluster where the size of each cluster is constrained by the given lower and upper bounds.…
We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological…
We derive the limiting distribution of the barycenter $b_n$ of an i.i.d. sample of $n$ random points on a planar cone with angular spread larger than $2\pi$. There are three mutually exclusive possibilities: (i) (fully sticky case) after a…
In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
We show that the discretized configuration space of $k$ points in the $n$-simplex is homotopy equivalent to a wedge of spheres of dimension $n-k+1$. This space is homeomorphic to the order complex of the poset of ordered partial partitions…