English
Related papers

Related papers: A Note on the Probability of Rectangles for Correl…

200 papers

We study integer programming instances over polytopes P(A,b)={x:Ax<=b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows are i.i.d. from a spherically symmetric distribution. The…

Data Structures and Algorithms · Computer Science 2013-08-27 Karthekeyan Chandrasekaran , Santosh Vempala

Extending results of Linial (1984) and Aigner (1985), we prove a uniform lower bound on the balance constant of a poset $P$ of width $2$. This constant is defined as $\delta(P) = \max_{(x, y)\in P^2}\min\{\mathbb{P}(x\prec y),…

Combinatorics · Mathematics 2021-06-21 Ashwin Sah

A fundamental tool in network information theory is the covering lemma, which lower bounds the probability that there exists a pair of random variables, among a give number of independently generated candidates, falling within a given set.…

Information Theory · Computer Science 2019-04-18 Jingbo Liu , Mohammad H. Yassaee , Sergio Verdú

We investigate barycenters of probability measures on Gromov hyperbolic spaces, toward development of convex optimization in this class of metric spaces. We establish a contraction property (the Wasserstein distance between probability…

Metric Geometry · Mathematics 2024-06-18 Shin-ichi Ohta

We show that a uniform quadrangulation, its largest 2-connected block, and its largest simple block jointly converge to the same Brownian map in distribution for the Gromov-Hausdorff-Prokhorov topology. We start by deriving a local limit…

Probability · Mathematics 2016-04-29 Louigi Addario-Berry , Yuting Wen

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

Let $X_1, \ldots, X_n$ be independent random points drawn from an absolutely continuous probability measure with density $f$ in $\mathbb{R}^d$. Under mild conditions on $f$, we derive a Poisson limit theorem for the number of large…

Probability · Mathematics 2018-11-20 László Györfi , Norbert Henze , Harro Walk

The well-known "Janson's inequality" gives Poisson-like upper bounds for the lower tail probability \Pr(X \le (1-\eps)\E X) when X is the sum of dependent indicator random variables of a special form. We show that, for large deviations,…

Probability · Mathematics 2017-12-12 Svante Janson , Lutz Warnke

A celebrated conjecture of Tuza states that in any finite graph the minimum size of a cover of triangles by edges is at most twice the maximum size of a set of edge-disjoint triangles. For an $r$-uniform hypergraph ($r$-graph) $G$, let…

Combinatorics · Mathematics 2024-05-15 Abdul Basit , David Galvin

Let $X$ be the constrained random walk on $\mathbb{Z}_+^d$ $d >2$, having increments $e_1$, $-e_i+e_{i+1}$ $i=1,2,3,...,d-1$ and $-e_d$ with probabilities $\lambda$, $\mu_1$, $\mu_2$,...,$\mu_d$, where $\{e_1,e_2,..,e_d\}$ are the standard…

Probability · Mathematics 2026-01-28 Ali Devin Sezer

It is known that any open necklace with beads of $t$ types in which the number of beads of each type is divisible by $k$, can be partitioned by at most $(k-1)t$ cuts into intervals that can be distributed into $k$ collections, each…

Combinatorics · Mathematics 2021-12-30 Noga Alon , Dor Elboim , János Pach , Gábor Tardos

Consider a discrete-time martingale $\{X_t\}$ taking values in a Hilbert space $\mathcal H$. We show that if for some $L \geq 1$, the bounds $\mathbb{E} \left[\|X_{t+1}-X_t\|_{\mathcal H}^2 \mid X_t\right]=1$ and $\|X_{t+1}-X_t\|_{\mathcal…

Probability · Mathematics 2015-09-10 James R. Lee , Yuval Peres , Charles K. Smart

We consider the $r$-neighbor bootstrap percolation process on the graph with vertex set $V=\{0,1\}^n$ and edges connecting the pairs at Hamming distance $1,2,\dots,k$, where $k\ge 2$. We find asymptotics of the critical probability of…

Combinatorics · Mathematics 2026-03-26 Fengxing Zhu

We show how to compute any symmetric Boolean function on $n$ variables over any field (as well as the integers) with a probabilistic polynomial of degree $O(\sqrt{n \log(1/\epsilon)})$ and error at most $\epsilon$. The degree dependence on…

Data Structures and Algorithms · Computer Science 2016-11-18 Josh Alman , Ryan Williams

Position $n$ points uniformly at random in the unit square $S$, and consider the Voronoi tessellation of $S$ corresponding to the set $\eta$ of points. Toss a fair coin for each cell in the tessellation to determine whether to colour the…

Probability · Mathematics 2021-09-03 Daniel Ahlberg , Daniel de la Riva , Simon Griffiths

This work investigates binary hypothesis testing between $H_0\sim P_0$ and $H_1\sim P_1$ in the finite-sample regime under asymmetric error constraints. By employing the ``reverse" R\'enyi divergence, we derive novel non-asymptotic bounds…

Information Theory · Computer Science 2026-01-21 Roberto Bruno , Adrien Vandenbroucque , Amedeo Roberto Esposito

A well-known conjecture in analytic number theory states that for every pair of sets $X,Y\subset\mathbb{Z}/p\mathbb{Z}$, each of size at least $\log ^C p$ (for some constant $C$) we have that the number of pairs $(x,y)\in X\times Y$ such…

Combinatorics · Mathematics 2015-12-18 Rudi Mrazović

We ask to what extent an isolated quantum system can eventually "contract" to be contained within a given Hilbert subspace. We do this by starting with an initial random state, considering the probability that all the particles will be…

General Relativity and Quantum Cosmology · Physics 2020-05-14 Joshua M. Deutsch , Dominik Šafránek , Anthony Aguirre

We study hypothesis testing under communication constraints, where each sample is quantized before being revealed to a statistician. Without communication constraints, it is well known that the sample complexity of simple binary hypothesis…

Statistics Theory · Mathematics 2023-12-19 Ankit Pensia , Varun Jog , Po-Ling Loh

Let $S=\sum_{i=1}^{+\infty}\lambda_{i}Z_{i}$ where the $Z_{i}$'s are i.d.d. positive with $\mathbb{E}\| Z\| ^{3}<+\infty$ and $(\lambda_{i})_{i\in\mathbb{N}}$ a positive nonincreasing sequence such that $\sum\lambda_{i}<+\infty$. We study…

Probability · Mathematics 2013-02-20 André Mas