English
Related papers

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

200 papers

We describe a probabilistic methodology, based on random walk estimates, to obtain exponential upper bounds for the probability of observing unusually small maximal components in two classical (near-)critical random graph models. More…

Probability · Mathematics 2025-06-11 Umberto De Ambroggio

For integers $k \geq 3$ and $r\geq 2$, we show that for every $\alpha> 0$, there exists $\varepsilon > 0$ such that the union of $k$-uniform hypergraph on $n$ vertices with minimum codegree at least $\alpha n$ and a binomial random…

Combinatorics · Mathematics 2022-11-07 Yulin Chang , Jie Han , Lubos Thoma

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas

In this paper we partially resolve Hall's conjecture about the distribution of random triangles. We consider the probability that three points chosen uniformly at random, in a bounded convex region of the plane, form an acute triangle.…

Probability · Mathematics 2019-06-21 Gabriel Khan

We consider the Ekst\''om-Persson conjecture concerning the value of the Hausdorff dimension of random covering sets formed by balls with radii $(k^{-\alpha})_{k=1}^\infty$ and centres chosen independently at random according to an…

Probability · Mathematics 2025-06-13 Esa Järvenpää , Markus Myllyoja , Stéphane Seuret

A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…

Information Theory · Computer Science 2021-11-29 Sebastian Espinosa , Jorge F. Silva , Pablo Piantanida

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

In this paper we provide a new geometric characterization of the Hirschfeld-Gebelein-R\'{e}nyi maximal correlation of a pair of random $(X,Y)$, as well as of the chordal slope of the nontrivial boundary of the hypercontractivity ribbon of…

Information Theory · Computer Science 2013-04-24 Venkat Anantharam , Amin Gohari , Sudeep Kamath , Chandra Nair

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

Probability · Mathematics 2023-07-13 Brett Leroux

Given positive integers $n$ and $m$, let $p_n(m)$ be the probability that a uniform random permutation of $[n]$ has order exactly $m$. We show that, as $n \to \infty$, the maximum of $p_n(m)$ over all $m$ is asymptotic to $1/n$, the…

Combinatorics · Mathematics 2025-10-14 Adrian Beker

We study n by n symmetric random matrices H, possibly discrete, with iid above-diagonal entries. We show that H is singular with probability at most exp(-n^c), and the spectral norm of the inverse of H is O(sqrt{n}). Furthermore, the…

Probability · Mathematics 2014-03-05 Roman Vershynin

We study the small ball probability of an order-$\ell$ simple random tensor $X=X^{(1)}\otimes\cdots\otimes X^{(\ell)}$ where $X^{(i)}, 1\leq i\leq\ell$ are independent random vectors in $\mathbb{R}^n$ that are log-concave or have…

Probability · Mathematics 2024-04-01 Xuehan Hu , Grigoris Paouris

In this paper, we study the conjunction of possibility measures when they are interpreted as coherent upper probabilities, that is, as upper bounds for some set of probability measures. We identify conditions under which the minimum of two…

Probability · Mathematics 2018-07-12 Enrique Miranda , Matthias C. M. Troffaes , Sebastien Destercke

Let $E$ be a bounded open subset of $\mathbb{R}^n$. We study the following questions: For i.i.d. samples $X_1, \dots, X_N$ drawn uniformly from $E$, what is the probability that $\cup_i \mathbf{B}(X_i, \delta)$, the union of $\delta$-balls…

Probability · Mathematics 2023-07-06 Enrique Alvarado , Bala Krishnamoorthy , Kevin R. Vixie

Assume that $2n$ balls are thrown independently and uniformly at random into $n$ bins. We consider the unlikely event $E$ that every bin receives at least one ball, showing that $\Pr[E] = \Theta(b^n)$ where $b \approx 0.836$. Note that, due…

Probability · Mathematics 2024-03-04 Stefan Walzer

Consider $S$, a set of $n$ points chosen uniformly at random and independently from the unit hypercube of dimension $t>2$. Order $S$ by using the Cartesian product of the $t$ standard orders of $[0,1]$. We determine a constant $\bar x(t)<e$…

Combinatorics · Mathematics 2025-07-15 Boris Pittel

For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $\delta(P)$ is defined as \[\delta(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \…

Combinatorics · Mathematics 2021-11-30 Swee Hong Chan , Igor Pak , Greta Panova

Consider throwing $n$ balls at random into $m$ urns, each ball landing in urn $i$ with probability $p_i$. Let $S$ be the resulting number of singletons, i.e., urns containing just one ball. We give an error bound for the Kolmogorov distance…

Probability · Mathematics 2009-01-23 Mathew D. Penrose

The usual stochastic order and the likelihood ratio order between probability distributions on the real line are reviewed in full generality. In addition, for the distribution of a random pair $(X,Y)$, it is shown that the conditional…

Statistics Theory · Mathematics 2023-03-08 Lutz Duembgen , Alexandre Moesching

We prove optimal concentration of measure for lifted functions on high dimensional expanders (HDX). Let $X$ be a $k$-dimensional HDX. We show for any $i\leq k$ and $f:X(i)\to [0,1]$: \[\Pr_{s\in X(k)}\left[\left|\underset{{t\subseteq…

Computational Complexity · Computer Science 2024-07-16 Yotam Dikstein , Max Hopkins