Related papers: Youden's Demon is Sylvester's Problem

Pick $n$ independent and uniform random points $U_1,\ldots,U_n$ in a compact convex set $K$ of $\mathbb{R}^d$ with volume 1, and let $P^{(d)}_K(n)$ be the probability that these points are in convex position. The Sylvester conjecture in…

In this paper, we introduce a generalization of the Wasserstein barycenter, to a case where the initial probability measures live on different subspaces of R^d. We study the existence and uniqueness of this barycenter, we show how it is…

Upper and lower bounds are derived for the Gaussian mean width of the intersection of a convex hull of $M$ points with an Euclidean ball of a given radius. The upper bound holds for any collection of extreme point bounded in Euclidean norm.…

We study the total mass of high points in a random model for the Riemann-Zeta function. We consider the same model as in [8], [2], and build on the convergence to 'Gaussian' multiplicative chaos proved in [14]. We show that the total mass…

The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of $n$ independent standard normally distributed points in $\mathbb R^d$. We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point…

We study the approximability of general convex sets in $\mathbb{R}^n$ by intersections of halfspaces, where the approximation quality is measured with respect to the standard Gaussian distribution $N(0,I_n)$ and the complexity of an…

Let n points be chosen randomly and independently in the unit disk. "Sylvester's question" concerns the probability p_n that they are the vertices of a convex n-sided polygon. Here we establish the link with another problem. We show that…

We prove a pointwise version of the multi-dimensional central limit theorem for convex bodies. Namely, let X be an isotropic random vector in R^n with a log-concave density. For a typical subspace E in R^n of dimension n^c, consider the…

Let $X$ be a vertex subset of a graph $G$. Then $u, v\in V(G)$ are $X$-positionable if $V(P)\cap X \subseteq \{u,v\}$ holds for any shortest $u,v$-path $P$. If each two vertices from $X$ are $X$-positionable, then $X$ is a general position…

Many star bodies have convex subsets with approximately the same Gaussian measure (of the complement). Inspired by this phenomenon, and in connection with the randomized Dvoretzky theorem for Lorentz spaces, we derive bounds on the…

Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…

This paper is concerned with the study of a circular random distribution called geodesic Normal distribution recently proposed for general manifolds. This distribution, parameterized by two real numbers associated to some specific location…

We consider the branching random walk on the real line where the underlying motion is of a simple random walk and branching is at least binary and at most decaying exponentially in law. It is well known that the normalized empirical measure…

The Gromov-Wasserstein distances were proposed a few years ago to compare distributions which do not lie in the same space. In particular, they offer an interesting alternative to the Wasserstein distances for comparing probability measures…

The Gaussian Correlation Conjecture states that for any two symmetric, convex sets in n-dimensional space and for any centered, Gaussian measure on that space, the measure of the intersection is greater than or equal to the product of the…

The prediction of the final state probabilities of a general cuboid randomly thrown onto a surface is a problem that naturally arises in the minds of men and women familiar with regular cubic dice and the basic concepts of probability.…

We revisit the problem of Gaussian mean testing in a distributed, communication constrained setting, where each of $n$ users independently observes samples from an unknown $d$-dimensional spherical Gaussian distribution…

Given a set of points in the plane, the \textsc{General Position Subset Selection} problem is that of finding a maximum-size subset of points in general position, i.e., with no three points collinear. The problem is known to be ${\rm…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

A version of the classical Buffon problem in the plane naturally extends to the setting of any Riemannian surface with constant Gaussian curvature. The Buffon probability determines a Buffon deficit. The relationship between Gaussian…