English
Related papers

Related papers: The Littlewood-Offord Problem for Markov Chains

200 papers

Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…

Probability · Mathematics 2023-01-09 Christian Houdré , Ümit Işlak

In this paper, we consider the problem of minimizing a linear functional subject to uncertain linear and bilinear matrix inequalities, which depend in a possibly nonlinear way on a vector of uncertain parameters. Motivated by recent results…

Optimization and Control · Mathematics 2015-05-29 Mohammadreza Chamanbaz , Fabrizio Dabbene , Roberto Tempo , Venkatakrishnan Venkataramanan , Qing-Guo Wang

We consider a square random matrix made by i.i.d. rows with any distribution and prove that, for any given dimension, the probability for the least singular value to be in [0; $\epsilon$) is at least of order $\epsilon$. This allows us to…

Probability · Mathematics 2020-04-16 Matteo Gregoratti , Davide Maran

A complete answer to the question about subspaces generated by $\{\pm 1\}$-vectors, which arose in the work of I.Kanter and H.Sompolinsky on associative memories, is given. More precisely, let vectors $v_1, \ldots , v_p,$ $p\leq n-1,$ be…

Combinatorics · Mathematics 2024-05-09 Anwar A. Irmatov

This paper considers a problem that relates to the theories of covering arrays, permutation patterns, Vapnik-Chervonenkis (VC) classes, and probability thresholds. Specifically, we want to find the number of subsets of [n]:={1,2,....,n} we…

Combinatorics · Mathematics 2013-05-08 Anant P. Godbole , Samantha Pinella , Yan Zhuang

We consider a basic problem in the general data streaming model, namely, to estimate a vector $f \in \Z^n$ that is arbitrarily updated (i.e., incremented or decremented) coordinate-wise. The estimate $\hat{f} \in \Z^n$ must satisfy…

Computational Complexity · Computer Science 2008-04-07 Sumit Ganguly

Given two vectors in Euclidean space, how unlikely is it that a random vector has a larger inner product with the shorter vector than with the longer one? When the random vector has independent, identically distributed components, we…

Probability · Mathematics 2018-05-23 Manjunath Krishnapur , Sourav Sarkar

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

Chebyshev's inequality provides an upper bound on the tail probability of a random variable based on its mean and variance. While tight, the inequality has been criticized for only being attained by pathological distributions that abuse the…

Optimization and Control · Mathematics 2020-10-16 Ernst Roos , Ruud Brekelmans , Wouter van Eekelen , Dick den Hertog , Johan van Leeuwaarden

Let $P(d)$ be the probability that a random 0/1-matrix of size $d \times d$ is singular, and let $E(d)$ be the expected number of 0/1-vectors in the linear subspace spanned by d-1 random independent 0/1-vectors. (So $E(d)$ is the expected…

Combinatorics · Mathematics 2008-12-17 Thomas Voigt , Günter M. Ziegler

A multi-armed bandit with finitely many arms is studied when each arm is a homogeneous Markov process on an underlying finite state space. The transition law of one of the arms, referred to as the odd arm, is different from the common…

Information Theory · Computer Science 2019-12-06 P. N. Karthik , Rajesh Sundaresan

We prove that the probability that a sum of independent random variables in $\mathbb{R}^d$ with bounded densities lies in a ball is maximized by taking uniform distributions on balls. This in turn generalizes a result by Rogozin on the…

Probability · Mathematics 2015-04-03 T. Juškevičius , J. D. Lee

Many mathematical, man-made and natural systems exhibit a leading-digit bias, where a first digit (base 10) of 1 occurs not 11\% of the time, as one would expect if all digits were equally likely, but rather 30\%. This phenomenon is known…

We propose a novel approach to concentration for non-independent random variables. The main idea is to ``pretend'' that the random variables are independent and pay a multiplicative price measuring how far they are from actually being…

Information Theory · Computer Science 2023-10-31 Amedeo Roberto Esposito , Marco Mondelli

We show that there are sets of $n$ points in the plane with $n$ arbitrarily large that contain more than $n^{1.014}$ pairs of points separated by a distance exactly $1$. This improves on very recent work of a team at OpenAI, who proved the…

Combinatorics · Mathematics 2026-05-21 Will Sawin

It is shown that at least 50% of the probability mass of a sum of independent Rademacher random variables is within one standard deviation from its mean. This lower bound is sharp, it is much better than for instance the bound that can be…

Probability · Mathematics 2011-12-22 Martien C. A. van Zuijlen

We investigate the eigenvalues of the buckling problem of arbitrary order on compact domains in Euclidean spaces and spheres. We obtain universal bounds for the $k$th eigenvalue in terms of the lower eigenvalues independently of the…

Differential Geometry · Mathematics 2009-10-13 Jürgen Jost , Xianqing Li-Jost , Qiaoling Wang , Changyu Xia

We consider an even probability distribution on the $d$-dimensional Euclidean space with the property that it assigns measure zero to any hyperplane through the origin. Given $N$ independent random vectors with this distribution, under the…

Probability · Mathematics 2020-12-24 Daniel Hug , Rolf Schneider

Although there is an extensive literature on the maxima of Gaussian processes, there are relatively few non-asymptotic bounds on their lower-tail probabilities. The aim of this paper is to develop such a bound, while also allowing for many…

Probability · Mathematics 2021-12-02 Miles E. Lopes , Junwen Yao

We study the problem of computing the tightest upper and lower bounds on the probability that the sum of $n$ dependent Bernoulli random variables exceeds an integer $k$. Under knowledge of all pairs of bivariate distributions denoted by a…

Optimization and Control · Mathematics 2019-10-16 Divya Padmanabhan , Karthik Natarajan
‹ Prev 1 8 9 10 Next ›