中文
相关论文

相关论文: Anti-concentration for polynomials of independent …

200 篇论文

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

In 1943, Littlewood and Offord proved the first anti-concentration result for sums of independent random variables. Their result has since then been strengthened and generalized by generations of researchers, with applications in several…

概率论 · 数学 2015-08-07 Pham H. Tiep , Van H. Vu

A classic result by Carbery and Wright states that a polynomial of Gaussian random variables exhibits anti-concentration in the following sense: for any degree $d$ polynomial $f$, one has the estimate $P( |f(x)| \leq \varepsilon \cdot…

概率论 · 数学 2023-01-18 Stephen Tu , Ross Boczar

Consider a quadratic polynomial $f\left(\xi_{1},\dots,\xi_{n}\right)$ of independent Bernoulli random variables. What can be said about the concentration of $f$ on any single value? This generalises the classical Littlewood--Offord problem,…

组合数学 · 数学 2020-08-11 Matthew Kwan , Lisa Sauermann

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

The anti-concentration phenomenon in probability theory has been intensively studied in recent years, with applications across many areas of mathematics. In most existing works, the ambient probability space is a product space generated by…

组合数学 · 数学 2026-03-23 Viet H. Do , Hoi H. Nguyen , Kiet H. Phan , Tuan Tran , Van H. Vu

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

Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erd\H{o}s and R\'{e}nyi. There has…

组合数学 · 数学 2020-11-19 Jacob Fox , Matthew Kwan , Lisa Sauermann

We study random variables of the form $f(X)$, when $f$ is a degree $d$ polynomial, and $X$ is a random vector on $\mathbb{R}^{n}$, motivated towards a deeper understanding of the covariance structure of $X^{\otimes d}$. For applications,…

概率论 · 数学 2022-07-15 Itay Glazer , Dan Mikulincer

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

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

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

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

Consider a quadratic polynomial $Q(\xi_{1},\dots,\xi_{n})$ of independent Rademacher random variables $\xi_{1},\dots,\xi_{n}$. To what extent can $Q(\xi_{1},\dots,\xi_{n})$ concentrate on a single value? This quadratic version of the…

组合数学 · 数学 2023-12-22 Matthew Kwan , Lisa Sauermann

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 vectors in $\mathbb{R}^d$. We consider upper bounds on $\max_x \mathbb{P}(a_1X_1+\cdots+a_nX_n=x)$ under various restrictions on $X_i$ and the weights $a_i$. When…

概率论 · 数学 2020-08-04 Tomas Juškevičius , Valentas Kurauskas

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

We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, and $X \in A$ and $Y \in B$ are…

概率论 · 数学 2019-03-06 Anup Rao , Amir Yehudayoff

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 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
‹ 上一页 1 2 3 10 下一页 ›