Related papers: An upper bound on the minimal dispersion

We provide an asymptotic analysis of linear transport problems in the diffusion limit under minimal regularity assumptions on the domain, the coefficients, and the data. The weak form of the limit equation is derived and the convergence of…

In this work we investigate the behavior of the minimal rate needed in order to guarantee a given probability that the distortion exceeds a prescribed threshold, at some fixed finite quantization block length. We show that the excess coding…

Let S(1) be the segment [-1,1], and define the segments S(n) recursively in the following manner: let S(n+1) be the intersection of S(n) and a(n+1) + S(1), where the point a(n+1) is chosen randomly on the segment S(n) with uniform…

Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…

For a nontrivial measurable set on the real line, there are always exceptional points, where the lower and upper densities of the set are neither zero nor one. We quantify this statement, following work by V. Kolyada, and obtain the…

For every unit vector $\sigma\in\Sigma_{d-1}$ and every $r\ge0$, let % % \begin{displaymath} P_{\sigma,r}=[-1,1]^d\cap\{t\in\Rr^d:t\cdot\sigma\le r\} \end{displaymath} % % denote the intersection of the cube $[-1,1]^d$ with a half-space…

The problem of finding the largest empty axis-parallel box amidst a point configuration is a classical problem in computational geometry. It is known that the volume of the largest empty box is of asymptotic order $1/n$ for $n\to\infty$ and…

We consider random interlacements on Z^d, with d bigger or equal to 3, when their vacant set is in a strongly percolative regime. We derive an asymptotic upper bound on the probability that the random interlacements disconnect a box of…

We prove a conjecture of Aanjaneya, Bishnu, and Pal that the minimum number of diffuse reflections sufficient to illuminate the interior of any simple polygon with $n$ walls from any interior point light source is $\lfloor n/2 \rfloor - 1$.…

Fix $p\in[1,\infty)$, $K\in(0,\infty)$ and a probability measure $\mu$. We prove that for every $n\in\mathbb{N}$, $\varepsilon\in(0,1)$ and $x_1,\ldots,x_n\in L_p(\mu)$ with $\big\| \max_{i\in\{1,\ldots,n\}} |x_i| \big\|_{L_p(\mu)} \leq K$,…

The convex hull peeling of a point set is obtained by taking the convex hull of the set and repeating iteratively the operation on the interior points until no point remains. The boundary of each hull is called a layer. We study the number…

Let M_n denote the number of sites in the largest cluster in critical site percolation on the triangular lattice inside a box side length n. We give lower and upper bounds on the probability that M_n / E(M_n) > x of the form exp(- C…

We consider first passage percolation on sparse random graphs with prescribed degree distributions and general independent and identically distributed edge weights assumed to have a density. Assuming that the degree distribution satisfies a…

A subset of the Hamming cube over $n$-letter alphabet is said to be $d$-maximal if its diameter is $d$, and adding any point increases the diameter. Our main result shows that each $d$-maximal set is either of size at most $(n+o(n))^d$ or…

Let $P$ be a set of $n$ points in $\mathbb{R}^d$, in general position. We remove all of them one by one, in each step erasing one vertex of the convex hull of the current remaining set. Let $g_d(P)$ denote the number of different removal…

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

We give a new and elementary proof that the number of elastic collisions of a finite number of balls in the Euclidean space is finite. We show that if there are $n$ balls of equal masses and radii 1, and at the time of a collision between…

This work considers a Poisson noise channel with an amplitude constraint. It is well-known that the capacity-achieving input distribution for this channel is discrete with finitely many points. We sharpen this result by introducing upper…

We prove that for any $2<p<\infty$ and for every $n$-dimensional subspace $X$ of $L_p$, represented on $\mathbb R^n$, whose unit ball $B_X$ is in Lewis' position one has the following two-level Gaussian concentration inequality: \[ \mathbb…

We consider simple random walk on a discrete cylinder with base a large d-dimensional torus of side-length N, when d is two or more. We develop a stochastic domination control on the local picture left by the random walk in boxes of…