Related papers: Sylvester's question and the Random Acceleration P…

Suppose that an infinite lattice gas of constant density $n_0$, whose dynamics are described by the symmetric simple exclusion process, is brought in contact with a spherical absorber of radius $R$. Employing the macroscopic fluctuation…

We consider the problem of testing small set expansion for general graphs. A graph $G$ is a $(k,\phi)$-expander if every subset of volume at most $k$ has conductance at least $\phi$. Small set expansion has recently received significant…

Consider a 2-dimensional soft random geometric graph $G(\lambda,s,\phi)$, obtained by placing a Poisson($\lambda s^2$) number of vertices uniformly at random in a square of side $s$, with edges placed between each pair $x,y$ of vertices…

We consider a one-dimensional random walk $S_n$ having i.i.d. increments with zero mean and finite variance. We continue our study of asymptotic expansions for local probabilities $\mathbf P(S_n=x,\tau_0>n)$, which has been started in…

Let $T$ be the triangle in the plane with vertices $(0,0)$, $(0,1)$ and $(0,1)$. The convex hull of $(0,1)$, $(1,0)$ and $n$ independent random points uniformly distributed in $T$ is the random convex chain $T_n$. A three-term recursion for…

We study approximations of smooth convex bodies by random ball-polytopes. We examine the following probability model: let $K\subset{\bf R}^d$ be a convex body such that $K$ slides freely in a ball of radius $R>0$ and has $C^2$ smooth…

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…

We study the partition function from random matrix theory using a well known connection to orthogonal polynomials, and a recently developed Riemann-Hilbert approach to the computation of detailed asymptotics for these orthogonal…

Let ($\Sigma$, g) be a closed connected surface equipped with a riemannian metric. Let ($\lambda$ n) n$\in$N and ($\psi$ n) n$\in$N be the increasing sequence of eigenvalues and the sequence of corresponding L 2-normalized eigenfunctions of…

Let x(s), s in R^d be a Gaussian self-similar random process of index H. We consider the problem of log-asymptotics for the probability p(T) that x(s), x(0)=0 does not exceed a fixed level in a star-shaped expanding domain TxG as T>>1. We…

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

The $N$-step random walk, elongated in the vicinity of a disc (in 2D) or a sphere (in 3D) of radius $R$, demonstrates a non-algebraic stretched exponential decay $P_N\sim \exp\left(-{\rm const}\, N^{1/3}\right)$ for the first return…

If four people with Gaussian-distributed heights stand at Gaussian positions on the plane, the probability that there are exactly two people whose height is above the average of the four is exactly the same as the probability that they…

We study a random bisection problem where an initial interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P_n(x) that at the n-th stage,…

We consider $n$ eigenvalues of complex and symplectic induced spherical ensembles, which can be realised as two-dimensional determinantal and Pfaffian Coulomb gases on the Riemann sphere under the insertion of point charges. For both cases,…

In this paper, we provide an $O(n \mathrm{polylog} n)$ bound on the expected complexity of the randomly weighted Voronoi diagram of a set of $n$ sites in the plane, where the sites can be either points, interior-disjoint convex sets, or…

Acceleration of algorithms is becoming a crucial problem, if larger data sets are to be processed. Evaluation of algorithms is mostly done by using computational geometry approach and evaluation of computational complexity. However in…

Given a compactly supported probability measure on a Riemannian manifold, we study the asymptotic speed at which it can be approximated (in Wasserstein distance of any exponent p) by finitely supported measure. This question has been…

We introduce the polytope of pointed pseudo-triangulations of a point set in the plane, defined as the polytope of infinitesimal expansive motions of the points subject to certain constraints on the increase of their distances. Its…

Suppose that there is a family of $n$ random points $X_v$ for $v \in V$, independently and uniformly distributed in the square $\left[-\sqrt{n}/2,\sqrt{n}/2\right]^2$ of area $n$. We do not see these points, but learn about them in one of…