Related papers: Angles of the Gaussian simplex

Let X be a smooth projective surface over C and let L be an ample line bundle on X. In this note, we show that, for all sufficiently large d, any number of general double points on X imposes the expected number of conditions on the linear…

We suggest a concept of generalized `angles' in arbitrary real normed vector spaces. We give for each real number a definition of an `angle' by means of the shape of the unit ball. They all yield the well known Euclidean angle in the…

We present several refinements on the fluctuations of sequences of random vectors (with values in the Euclidean space $\mathbb{R}^d$) which converge after normalization to a multidimensional Gaussian distribution. More precisely we refine…

Let X(t) be a Gaussian random field R d $\rightarrow$ R. Using the notion of (d -- 1)-integral geometric measures, we establish a relation between (a) the volume of the level set (b) the number of crossings of the restriction of the random…

We apply a new notion of angle between projections to deduce criteria for uniform convergence results of the alternating projections method under several different settings: averaged projections, cyclic products, quasi-periodic products and…

We study the hexagonal lattice $\mathbb{Z}[\omega]$, where $\omega^6=1$. More specifically, we study the angular distribution of hexagonal lattice points on circles with a fixed radius. We prove that the angles are equidistributed on…

We derive in this article the exact non-asymptotical exponential and power estimates for self-normalized sums of centered independent random variables (r.v.) under natural norming. We will use also the theory of the so-called Grand Lebesgue…

Let $G_n$ be a random geometric graph with vertex set $[n]$ based on $n$ i.i.d.\ random vectors $X_1,\ldots,X_n$ drawn from an unknown density $f$ on $\R^d$. An edge $(i,j)$ is present when $\|X_i -X_j\| \le r_n$, for a given threshold…

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

We consider tessellations of the Euclidean $(d-1)$-sphere by $(d-2)$-dimensional great subspheres or, equivalently, tessellations of Euclidean $d$-space by hyperplanes through the origin; these we call conical tessellations. For random…

It is known that each symmetric stable distribution in $R^d$ is related to a norm on $R^d$ that makes $R^d$ embeddable in $L_p([0,1])$. In case of a multivariate Cauchy distribution the unit ball in this norm corresponds is the polar set to…

The paper characterizes uniform convergence rate for general classes of wavelet expansions of stationary Gaussian random processes. The convergence in probability is considered.

We establish the rate of convergence of distributions of sums of independent identically distributed random variables to the Gaussian distribution in terms of truncated pseudomoments by implementing the idea of Yu. Studnyev for getting…

This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a $(d-1)$-sphere with radius $r$ in a $d-$dimensional Euclidean space,…

The earth mover's distance (EMD), also known as the 1-Wasserstein metric, measures the minimum amount of work required to transform one probability distribution into another. The EMD can be naturally generalized to measure the "distance"…

The unit ball random geometric graph $G=G^d_p(\lambda,n)$ has as its vertices $n$ points distributed independently and uniformly in the $d$-dimensional unit ball, with two vertices adjacent if and only if their $l_p$-distance is at most…

We prove two universality results for random tensors of arbitrary rank D. We first prove that a random tensor whose entries are N^D independent, identically distributed, complex random variables converges in distribution in the large N…

We prove that any centered $1$-subgaussian random vector in $\mathbb{R}^{n}$ can be written as the sum of a universal number of standard Gaussian vectors. Following the work of the second-named author, this solves M. Talagrand's convexity…

An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…

Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…