Related papers: Angles of the Gaussian simplex

Let $U_1,U_2,\ldots$ be random points sampled uniformly and independently from the $d$-dimensional upper half-sphere. We show that, as $n\to\infty$, the $f$-vector of the $(d+1)$-dimensional convex cone $C_n$ generated by $U_1,\ldots,U_n$…

We review and study some of the properties of smooth Gaussian random fields defined on a homogeneous space, under the assumption that the probability distribution is invariant under the isometry group of the space. We first give an…

We examine implications of angles having their own dimension, in the same sense as do lengths, masses, {\it etc.} The conventional practice in scientific applications involving trigonometric or exponential functions of angles is to assume…

A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…

In this note, we present a probabilistic proof of the well-known finite geometric series. The proof follows by taking the moments of the sum and the difference of two independent exponentially distributed random variables.

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…

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 sub-Gaussian stable distribution is a heavy-tailed elliptically contoured law which has interesting applications in signal processing and financial mathematics. This work addresses the problem of feasible estimation of distributions. We…

We present fixed domain asymptotic results that establish consistent estimates of the variance and scale parameters for a Gaussian random field with a geometric anisotropic Mat\'ern autocovariance in dimension $d>4$. When $d<4$ this is…

In this report, the explicit probability density functions of the random Euclidean distances associated with regular hexagons are given, when the two endpoints of a link are randomly distributed in the same hexagon, and two adjacent…

Let $U_1,\ldots,U_n$ be independent random vectors uniformly distributed on the unit sphere $\mathbb S^{d-1}\subseteq\mathbb R^d$, where $n\ge d$, and consider the random polyhedral cone \[ \mathcal W_{n,d}:=\mathop{\mathrm{pos}}…

We find in measurements of microwave transmission through quasi-1D dielectric samples for both diffusive and localized waves that the field normalized by the square root of the spatially averaged flux in a given sample configuration is a…

We obtain formulae for the expected number and height distribution of critical points of smooth isotropic Gaussian random fields parameterized on Euclidean space or spheres of arbitrary dimension. The results hold in general in the sense…

We consider the random geometric graph on $n$ vertices drawn uniformly from a $d$--dimensional sphere. We focus on the sparse regime, when the expected degree is constant independent of $d$ and $n$. We show that, when $d$ is larger than $n$…

Approximating complex probability distributions, such as Bayesian posterior distributions, is of central interest in many applications. We study the expressivity of geometric Gaussian approximations. These consist of approximations by…

We establish Gaussian limits for general measures induced by binomial and Poisson point processes in d-dimensional space. The limiting Gaussian field has a covariance functional which depends on the density of the point process. The general…

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…

We prove that the Random-Edge simplex algorithm requires an expected number of at most 13n/sqrt(d) pivot steps on any simple d-polytope with n vertices. This is the first nontrivial upper bound for general polytopes. We also describe a…

Geodesic slice sampling, introduced in Durmus et al., 2024, is a slice sampling based Markov chain Monte Carlo method for approximate sampling from distributions on Riemannian manifolds. We prove that it is uniformly ergodic for…

A degree-regular triangulation is one in which each vertex has identical degree. Our main result is that any such triangulation of a (possibly non-compact) surface $S$ is geometric, that is, it is combinatorially equivalent to a geodesic…