中文
相关论文

相关论文: Non-abelian Littlewood-Offord inequalities

200 篇论文

We prove anti-concentration results for polynomials of independent random variables with arbitrary degree. Our results extend the classical Littlewood-Offord result for linear polynomials, and improve several earlier estimates. We discuss…

概率论 · 数学 2015-08-11 Raghu Meka , Oanh Nguyen , Van Vu

We show that random walks on semisimple algebraic groups do not concentrate on proper algebraic subvarieties with uniform exponential rate of anti-concentration. This is achieved by proving a uniform spectral gap for quasi-regular…

群论 · 数学 2025-12-18 Oren Becker , Emmanuel Breuillard

We provide a characterization for anti-concentration of inhomogeneous random walks in non-abelian groups. In application we extend the classical bounds by Erdos-Littlewood-Offord and Sarkozy-Szemeredi to non-abelian settings.

组合数学 · 数学 2017-01-04 Hoi H. Nguyen

Let $\eta_i, i=1,..., n$ be iid Bernoulli random variables. Given a multiset $\bv$ of $n$ numbers $v_1, ..., v_n$, the \emph{concentration probability} $\P_1(\bv)$ of $\bv$ is defined as $\P_1(\bv) := \sup_{x} \P(v_1 \eta_1+ ... v_n…

组合数学 · 数学 2009-10-20 Terence Tao , Van Vu

The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions. Some multivariate generalizations of results of Arak (1980) are…

概率论 · 数学 2016-05-03 Yulia S. Eliseeva , Andrei Yu. Zaitsev

We prove several different anti-concentration inequalities for functions of independent Bernoulli-distributed random variables. First, motivated by a conjecture of Alon, Hefetz, Krivelevich and Tyomkyn, we prove some "Poisson-type"…

组合数学 · 数学 2023-06-22 Jacob Fox , Matthew Kwan , Lisa Sauermann

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n} X_k a_k$ with respect to the arithmetic structure of…

概率论 · 数学 2022-08-04 Yulia S. Eliseeva , Friedrich Götze , Andrei Yu. Zaitsev

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}a_k X_k$ with respect to the arithmetic structure of coefficients…

概率论 · 数学 2021-12-03 Yulia S. Eliseeva , Friedrich Götze , Andrei Yu. Zaitsev

Let $\mathbf{v}_i$ be vectors in $\mathbb{R}^d$ and $\{\varepsilon_i\}$ be independent Rademacher random variables. Then the Littlewood-Offord problem entails finding the best upper bound for $\sup_{\mathbf{x} \in \mathbb{R}^d}…

组合数学 · 数学 2020-09-03 Kyle Luh , David Xiang

The classical Erd\H{o}s-Littlewood-Offord problem concerns the random variable $X = a_1 \xi_1 + \dots + a_n \xi_n$, where $a_i \in \mathbb{R} \setminus \{0\}$ are fixed and $\xi_i \sim \text{Ber}(1/2)$ are independent. The…

组合数学 · 数学 2020-01-03 Mihir Singhal

Let $X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of…

概率论 · 数学 2023-04-06 Friedrich Götze , Andrei Yu. Zaitsev

We present an extension of the famous Littlewood-Offord problem when Bernoulli distributions are replaced with discrete log-concave distributions. A variant of the Littlewood-Offord problem for arithmetic progressions, as well as an…

概率论 · 数学 2026-02-19 Arnaud Marsiglietti , James Melbourne

The Littlewood-Offord problem is a classical question in probability theory and discrete mathematics, proposed, firstly by Littlewood and Offord in the 1940s. Given a set $A$ of integer, this problem asks for an upper bound on the…

组合数学 · 数学 2023-08-09 Simone Costa

This paper provides a connection between the concentration of a random variable and the distribution of the roots of its probability generating function. Let $X$ be a random variable taking values in $\{0,\ldots,n\}$ with $\mathbb{P}(X =…

概率论 · 数学 2022-10-10 Marcus Michelen , Julian Sahasrabudhe

Motivated by the inverse Littlewood-Offord problem for linear forms, we study the concentration of quadratic forms. We show that if this form concentrates on a small ball with high probability, then the coefficients can be approximated by a…

组合数学 · 数学 2011-05-31 Hoi H. Nguyen

Consider a random sum $\eta_1 v_1 + ... + \eta_n v_n$, where $\eta_1,...,\eta_n$ are i.i.d. random signs and $v_1,...,v_n$ are integers. The Littlewood-Offord problem asks to maximize concentration probabilities such as $\P(\eta_1 v_1 + ...…

概率论 · 数学 2007-05-23 Terence Tao , Van Vu

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. In this paper we study the behavior of concentration functions of weighted sums $\sum_{k=1}^{n}X_ka_k $ with respect to the arithmetic structure of coefficients…

概率论 · 数学 2018-05-22 Friedrich Götze , Andrei Yu. Zaitsev

We prove sharp anti-concentration results for log-concave random variables on the real line in both the discrete and continuous setting. Our approach is elementary and uses majorization techniques to recover and extend some recent and not…

概率论 · 数学 2025-05-12 Tulio Gaxiola , James Melbourne , Vincent Pigno , Emma Pollard

Let eta_i be iid Bernoulli random variables, taking values -1,1 with probability 1/2. Given a multiset V of n integers v_1,..., v_n, we define the concentration probability as rho(V) := sup_{x} Pr(v_1 eta_1+...+ v_n eta_n=x). A classical…

组合数学 · 数学 2011-01-18 Hoi Nguyen , Van Vu

The paper deals with studying a connection of the Littlewood--Offord problem with estimating the concentration functions of some symmetric infinitely divisible distributions.

概率论 · 数学 2022-11-15 Friedrich Götze , Andrei Yu. Zaitsev
‹ 上一页 1 2 3 10 下一页 ›