Related papers: A Note on the Probability of Rectangles for Correl…
We show that states on tensor products of matrix algebras whose ranks are relatively small are {\em almost surely} entangled, but that states of maximum rank are not. More precisely, let $M=M_m(\mathbb C)$ and $N=M_n(\mathbb C)$ be full…
We study a hypothesis testing problem in which data is compressed distributively and sent to a detector that seeks to decide between two possible distributions for the data. The aim is to characterize all achievable encoding rates and…
We show that for any $1\leq p\leq\infty$, the family of random vectors uniformly distributed on hyperplane projections of the unit ball of $\ell_p^n$ verify the variance conjecture $$ \textrm{Var}\,|X|^2\leq C\max_{\xi\in…
Let $\{X_t\}_{t\geq 0 }$ be a $d$-dimensional supercritical super-Brownian motion started from the origin with branching mechanism $\psi$. Denote by $R_t:=\inf\{r>0:X_s(\{x\in \mathbb{R}^d:|x|\geq r\})=0,~\forall~0\leq s\leq t\}$ the radius…
Let $A$ be a limsup random fractal with indices $\gamma_1, ~\gamma_2 ~$and $\delta$ on $[0,1]^d$. We determine the hitting probability $\mathbb{P}(A\cap G)$ for any analytic set $G$ with the condition $(\star)$$\colon$ $\dim_{\rm…
The paper deals with minimax optimal statistical tests for two composite hypotheses, where each hypothesis is defined by a non-parametric uncertainty set of feasible distributions. It is shown that for every pair of uncertainty sets of the…
We discuss a general method to construct correlated binomial distributions by imposing several consistent relations on the joint probability function. We obtain self-consistency relations for the conditional correlations and conditional…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…
High-probability analysis of stochastic first-order optimization methods under mild assumptions on the noise has been gaining a lot of attention in recent years. Typically, gradient clipping is one of the key algorithmic ingredients to…
Stochastic simulations are used to characterize the knotting distributions of random ring polymers confined in spheres of various radii. The approach is based on the use of multiple Markov chains and reweighting techniques, combined with…
This paper starts by considering the minimization of the Renyi divergence subject to a constraint on the total variation distance. Based on the solution of this optimization problem, the exact locus of the points $\bigl( D(Q\|P_1),…
We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming…
This article presents an algebraic topology perspective on the problem of finding a complete coverage probability of a one dimensional domain $X$ by a random covering, and develops techniques applicable to the problem beyond the one…
The Hamming torus of dimension $d$ is the graph with vertices $\{1,\dots,n\}^d$ and an edge between any two vertices that differ in a single coordinate. Bootstrap percolation with threshold $\theta$ starts with a random set of open…
We consider a variation of balls-into-bins which randomly allocates $m$ balls into $n$ bins. Following Godfrey's model (SODA, 2008), we assume that each ball $t$, $1\le t\le m$, comes with a hypergraph…
Consider a square random matrix with independent and identically distributed entries of mean zero and unit variance. We show that as the dimension tends to infinity, the spectral radius is equivalent to the square root of the dimension in…
For a graph $G=(V,E)$, let $bc(G)$ denote the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that for every graph $G$, $bc(G) \leq n…
The aim of this paper is to provide new perspectives on relative finite element accuracy which is usually based on the asymptotic speed of convergence comparison when the mesh size $h$ goes to zero. Starting from a geometrical reading of…
Let $X_1,..., X_n$ be independent, uniformly random points from $[0,1]^2$. We prove that if we add edges between these points one by one by order of increasing edge length then, with probability tending to 1 as the number of points $n$…
Suppose that $Z$ is a random closed subset of the hyperbolic plane $\H^2$, whose law is invariant under isometries of $\H^2$. We prove that if the probability that $Z$ contains a fixed ball of radius 1 is larger than some universal constant…