中文
相关论文

相关论文: Bound for the maximal probability in the Littlewoo…

200 篇论文

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

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

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

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

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 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 $\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

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

For a random variable $X$ define $Q(X) = \sup_{x \in \mathbb{R}} \mathbb{P}(X=x)$. Let $X_1, \dots, X_n$ be independent integer random variables. Suppose $Q(X_i) \le \alpha_i \in (0,1]$ for each $i \in \{1, \dots, n\}$. Ju\v{s}kevi\v{c}ius…

概率论 · 数学 2026-03-12 Valentas Kurauskas

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

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 $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

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

Estimates are constructed for the deviation of the concentration functions of sums of independent random variables with finite variances from the folded normal distribution function without any assumptions concerning the existence of the…

概率论 · 数学 2016-08-11 V. Yu. Korolev , A. V. Dorofeeva

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 two basic conjectures on the distribution of the smallest singular value of random n times n matrices with independent entries. Under minimal moment assumptions, we show that the smallest singular value is of order n^{-1/2}, which…

概率论 · 数学 2016-12-23 Mark Rudelson , Roman Vershynin

A sharp, distribution free, non-asymptotic result is proved for the concentration of a random function around the mean function, when the randomization is generated by a finite sequence of independent data and the random functions satisfy…

概率论 · 数学 2023-12-25 Thomas Anton , Sutanuka Roy , Rabee Tourky

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

The distribution function of the sum of i.i.d. random variables of the special form is considered. Such sum describes messages posterior probabilities for random coding in binary symmetric channel. Close non-asymptotic lower and upper…

信息论 · 计算机科学 2025-01-17 M. V. Burnashev

Consider a degree-$d$ polynomial $f(\xi_1,\dots,\xi_n)$ of independent Rademacher random variables $\xi_1,\dots,\xi_n$. To what extent can $f(\xi_1,\dots,\xi_n)$ concentrate on a single point? This is the so-called polynomial…

组合数学 · 数学 2025-05-30 Zhihan Jin , Matthew Kwan , Lisa Sauermann , Yiting Wang
‹ 上一页 1 2 3 10 下一页 ›