English
Related papers

Related papers: A sharp uniform bound for the distribution of sums…

200 papers

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

Let $X_1,X_2,...,X_n$ be a sequence of independent or locally dependent random variables taking values in $\mathbb{Z}_+$. In this paper, we derive sharp bounds, via a new probabilistic method, for the total variation distance between the…

Statistics Theory · Mathematics 2010-10-11 Michael V. Boutsikas , Eutichia Vaggelatou

In this article, we obtain explicit bounds on the uniform distance between the cumulative distribution function of a standardized sum $S_n$ of $n$ independent centered random variables with moments of order four and its first-order…

Probability · Mathematics 2025-07-30 Alexis Derumigny , Lucas Girard , Yannick Guyonvarch

Let $\BS_1,...,\BS_n$ be independent identically distributed random variables each having the standardized Bernoulli distribution with parameter $p\in(0,1)$. Let $m_*(p):=(1+p+2p^2)/(2\sqrt{p-p^2}+4p^2)$ if $0<p\le 1/2$ and $m_*(p):=1$ if…

Probability · Mathematics 2007-12-23 Iosif Pinelis

In this paper, we develop a general machinery for finding explicit uniform probability and moment bounds on sub-additive positive functionals of random processes. Using the developed general technique, we derive uniform bounds on the…

Probability · Mathematics 2012-02-09 Alexander Goldenshluger , Oleg Lepski

Let $(\xi_i)_{i=1,...,n}$ be a sequence of independent and symmetric random variables. We consider the upper bounds on tail probabilities of self-normalized deviations $$ \mathbf{P} \Big( \max_{1\leq k \leq n} \sum_{i=1}^{k} |\xi_i|\big/…

Probability · Mathematics 2017-05-05 Xiequan Fan

Let $X=\{X_j , j\ge 1\}$ be a sequence of independent, square integrable variables taking values in a common lattice $\mathcal L(v_{ 0},D )= \{v_{ k}=v_{ 0}+D k , k\in \Z\}$. Let $S_n=X_1+\ldots +X_n$, $a_n= {\mathbb E\,} S_n$, and…

Probability · Mathematics 2025-12-08 Michel J. G. Weber

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

In this paper we consider the problem of uniformity testing with limited memory. We observe a sequence of independent identically distributed random variables drawn from a distribution $p$ over $[n]$, which is either uniform or is…

Information Theory · Computer Science 2022-06-22 Tomer Berg , Or Ordentlich , Ofer Shayevitz

We use representation theory of the symmetric group S_n to prove Poisson limit theorems for the distribution of fixed points for three types of non-uniform permutations. First, we give results for the commutator of g and x where g and x are…

Combinatorics · Mathematics 2024-06-28 Jason Fulman

Let $X_1,\...,X_n$ be independent with zero means, finite variances $\sigma_1^2,\...,\sigma_n^2$ and finite absolute third moments. Let $F_n$ be the distribution function of $(X_1+\...+X_n)/\sigma$, where $\sigma^2=\sum_{i=1}^n\sigma_i^2$,…

Probability · Mathematics 2010-10-20 Larry Goldstein

Simultaneous perturbation stochastic approximation (SPSA) has proven to be efficient for recursive optimization. SPSA uses a centered difference approximation to the gradient based on two function evaluations regardless of the dimension of…

Methodology · Statistics 2014-05-06 Xumeng Cao

A Poisson Binomial distribution over $n$ variables is the distribution of the sum of $n$ independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution $P$ supported on $\{0,...,n\}$ to which we have…

Data Structures and Algorithms · Computer Science 2014-10-15 Jayadev Acharya , Constantinos Daskalakis

Consider the random quadratic form $T_n=\sum_{1 \leq u < v \leq n} a_{uv} X_u X_v$, where $((a_{uv}))_{1 \leq u, v \leq n}$ is a $\{0, 1\}$-valued symmetric matrix with zeros on the diagonal, and $X_1,$ $X_2, \ldots, X_n$ are i.i.d.…

Probability · Mathematics 2019-12-30 Bhaswar B. Bhattacharya , Somabha Mukherjee , Sumit Mukherjee

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.…

Probability · Mathematics 2015-07-06 V. Yu. Korolev , A. V. Dorofeeva

Under the assumption that the distribution of a nonnegative random variable $X$ admits a bounded coupling with its size biased version, we prove simple and strong concentration bounds. In particular the upper tail probability is shown to…

Probability · Mathematics 2014-07-15 Richard Arratia , Peter Baxendale

Let $ X_1, \ldots, X_n $ be independent random variables taking values in the alphabet $ \{0, 1, \ldots, r\} $, and $ S_n = \sum_{i = 1}^n X_i $. The Shepp--Olkin theorem states that, in the binary case ($ r = 1 $), the Shannon entropy of $…

Information Theory · Computer Science 2022-05-10 Mladen Kovačević

We explore asymptotically optimal bounds for deviations of Bernoulli convolutions from the Poisson limit in terms of the Shannon relative entropy and the Pearson $\chi^2$-distance. The results are based on proper non-uniform estimates for…

Probability · Mathematics 2019-08-13 S. G. Bobkov , G. P. Chistyakov , F. Götze

Let $\varepsilon_1,\ldots,\varepsilon_n$ be independent identically distributed Rademacher random variables, that is $\mathbb{P}\{\varepsilon_i=\pm1\}=1/2$. Let $S_n=a_1\varepsilon_1+\cdots+a_n\varepsilon_n$, where…

Probability · Mathematics 2015-06-02 Vidmantas Kastytis Bentkus , Dainius Dzindzalieta

In this note we present an algorithm to obtain a uniform lower bound on Hausdorff dimension of the stationary measure of an affine iterated function scheme with similarities, the best known example of which is Bernoulli convolution. The…

Dynamical Systems · Mathematics 2022-01-19 Victor Kleptsyn , Mark Pollicott , Polina Vytnova
‹ Prev 1 2 3 10 Next ›