Related papers: Explicit bounds for the approximation error in Ben…

Motivated, roughly, by comparing the mean and median of an IID sum of bounded lattice random variables, we develop explicit and effective bounds on the errors involved in the one-term Edgeworth expansion for such sums.

Using the sum invariance property of Benford random variables, we prove that an $n$-digit Benford variable converges to a Benford variable as $n$ approaches infinity.

We establish a coboundary condition for a sequence of ergodic sums (i.e.~Birkhoff partial sums) to be almost surely uniformly distributed mod $1$. Applications are given when the sequence is generated by a Gibbs-Markov map. In particular,…

Using techniques from Poisson approximation, we prove explicit error bounds on the number of permutations that avoid any pattern. Most generally, we bound the total variation distance between the joint distribution of pattern occurrences…

Two new information-theoretic methods are introduced for establishing Poisson approximation inequalities. First, using only elementary information-theoretic techniques it is shown that, when $S_n=\sum_{i=1}^nX_i$ is the sum of the (possibly…

We resolve a long-standing open question, about the existence of a constant-factor approximation algorithm for the average-case \textsc{Decision Tree} problem with uniform probability distribution over the hypotheses. We answer the question…

Let $\log^Cn\le d\le n/2$ for a sufficiently large constant $C>0$ and let $A_n$ denote the adjacency matrix of a uniform random $d$-regular directed graph on $n$ vertices. We prove that as $n$ tends to infinity, the empirical spectral…

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

Laws of large numbers, starting from certain nonequilibrium measures, have been shown for the integrated current across a bond, and a tagged particle in one-dimensional symmetric nearest-neighbor simple exclusion [Ann. Inst. Henri Poincare…

We introduce a new self-interacting random walk on the integers in a dynamic random environment and show that it converges to a pure diffusion in the scaling limit. We also find a lower bound on the diffusion coefficient in some special…

We provide new upper and lower bounds on the minimum possible ratio of the spectral and Frobenius norms of a (partially) symmetric tensor. In the particular case of general tensors our result recovers a known upper bound. For symmetric…

Let $f(z)=\sum_{n=1}^\infty \lambda_f(n)e^{2\pi i n z}\in S_{k}^{new}(\Gamma_0(N))$ be a normalized Hecke eigenform of even weight $k\geq2$ on $\Gamma_0(N)$ without complex multiplication. Let $\mathbb{P}$ denote the set of all primes. We…

We consider the sum of power weighted nearest neighbor distances in a sample of size n from a multivariate density f of possibly unbounded support. We give various criteria guaranteeing that this sum satisfies a law of large numbers for…

We study the error of the number of points of the lattice $\mathbb{Z}^{d}$ that fall into a dilated and translated hypercube centred around $0$ and whose axis are parallel to the axis of coordinates. We show that if $t$, the factor of…

We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…

We study random walk with unbounded jumps in random environment. The environment is stationary and ergodic, uniformly elliptic and decays polynomially with speed $Dj^{-(3+\varepsilon_0)}$ for some small $\varepsilon_0>0$ and proper $D>0.$…

Error bounds and complexity bounds in numerical analysis and information-based complexity are often proved for functions that are defined on very simple domains, such as a cube, a torus, or a sphere. We study optimal error bounds for the…

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

We prove an exponential decay concentration inequality to bound the tail probability of the difference between the log-likelihood of discrete random variables on a finite alphabet and the negative entropy. The concentration bound we derive…

Coherent lower previsions are general probabilistic models allowing incompletely specified probability distributions. However, for complete description of a coherent lower prevision -- even on finite underlying sample spaces -- an infinite…