相关论文: Approximating the limiting Quicksort distribution

In this paper we deal with stochastic optimization problems where the data distributions change in response to the decision variables. Traditionally, the study of optimization problems with decision-dependent distributions has assumed…

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

We derive new explicit bounds for the total variation distance between two convolution products of $n$ probability distributions, one of which having identical convolution factors. Approximations by finite signed measures of arbitrary order…

We call $i$ a fixed point of a given sequence if the value of that sequence at the $i$-th position coincides with $i$. Here, we enumerate fixed points in the class of restricted growth sequences. The counting process is conducted by…

Optimal quantization for mixed distributions has emerged as a compelling area of study. In this work, we have focused on a mixed distribution formed from two uniform distributions with partially overlapping supports. For this class of…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Bounds of the accuracy of the normal approximation to the distribution of a sum of independent random variables are improved under relaxed moment conditions, in particular, under the absence of moments of orders higher than the second.…

We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…

Let $K$ and $K_0$ be convex bodies in $\mathbb{R}^d$, such that $K$ contains the origin, and define the process $(K_n, p_n)$, $n \geq 0$, as follows: let $p_{n+1}$ be a uniform random point in $K_n$, and set $K_{n+1} = K_n \cap (p_{n+1} +…

If we know that some kind of sequence always converges, we can ask how quickly and how uniformly it converges. Many convergent sequences converge non-uniformly and, relatedly, have no computable rate of convergence. However proof-theoretic…

We consider a general class of regression models with normally distributed covariates, and the associated nonconvex problem of fitting these models from data. We develop a general recipe for analyzing the convergence of iterative algorithms…

An equation is obtained for the Stieltjes transform of the normalized distribution of singular values of non-symmetric band random matrices in the limit when the band width and rank of the matrix simultaneously tend to infinity. Conditions…

We show that for a strongly convergent sequence of geometrically finite Kleinian groups with geometrically finite limit, the Cannon-Thurston maps of limit sets converge uniformly. If however the algebraic and geometric limits differ, as in…

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…

In this paper, we propose a distributed algorithm for the minimum dominating set problem. For some especial networks, we prove theoretically that the achieved answer by our proposed algorithm is a constant approximation factor of the exact…

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

We study the statistical properties of the entropic optimal (self) transport problem for smooth probability measures. We provide an accurate description of the limit distribution for entropic (self-)potentials and plans as the…

A sorting network is a geodesic path from $12 \cdots n$ to $n \cdots 21$ in the Cayley graph of $S_n$ generated by adjacent transpositions. For a uniformly random sorting network, we establish the existence of a local limit of the process…

We consider the problem of sorting $n$ items, given the outcomes of $m$ pre-existing comparisons. We present a simple and natural deterministic algorithm that runs in $O(m + \log T)$ time and does $O(\log T)$ comparisons, where $T$ is the…

We propose a new powerful family of tests of univariate normality. These tests are based on an initial value problem in the space of characteristic functions originating from the fixed point property of the normal distribution in the zero…