Related papers: Random Polyhedral Cones I: Distributional Results …

A probabilistic representation for a class of weighted $p$-radial distributions, based on mixtures of a weighted cone probability measure and a weighted uniform distribution on the Euclidean $\ell_p^n$-ball, is derived. Large deviation…

For positive integers $n,d$, let $\lambda(n,d)$ be the minimal number of vertices of a triangulation of $n$-sphere which admits a degree $d$ simplicial map to the boundary of $(n+1)$-simplex. We show that…

A new formalism is presented for analytically obtaining the probability density function, \( P_{n}(s) \), for the distance between two random points in an \( n \)-dimensional sphere of radius \( R \). Our formalism allows \( P_{n}(s) \) to…

We study the problem of maximizing the minimal value over the sphere $S^{d-1}\subset \mathbb R^d$ of the potential generated by a configuration of $d+1$ points on $S^{d-1}$ (the maximal discrete polarization problem). The points interact…

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 study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

Let $x_1,\ldots ,x_N$ be independent random points distributed according to an isotropic log-concave measure $\mu $ on ${\mathbb R}^n$, and consider the random polytope $$K_N:={\rm conv}\{ \pm x_1,\ldots ,\pm x_N\}.$$ We provide sharp…

Within the framework of the probability representation of quantum mechanics, we study a superposition of generic Gaussian states associated to symmetries of a regular polygon of n sides; in other words, the cyclic groups (containing the…

Consider two balls with radius $r>0$ whose centers are at a distance $2$, positioned symmetrically with respect to the origin in ${\mathbb{R}}^d$. Suppose that the initial velocities are independent standard normal vectors. When $r\to0$,…

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

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$…

Let $P(d)$ be the probability that a random 0/1-matrix of size $d \times d$ is singular, and let $E(d)$ be the expected number of 0/1-vectors in the linear subspace spanned by d-1 random independent 0/1-vectors. (So $E(d)$ is the expected…

This paper is motivated by the following observation. Take a 3 x 3 random (Haar distributed) orthogonal matrix $\Gamma$, and use it to "rotate" the north pole, $x_0$ say, on the unit sphere in $R^3$. This then gives a point $u=\Gamma x_0$…

An old conjecture states that among all simplices inscribed in the unit sphere the regular one has the maximal mean width. An equivalent formulation is that for any centered Gaussian vector $(\xi_1,\dots,\xi_n)$ satisfying $\mathbb…

We consider the set of points chosen randomly, independently and uniformly in the $d$-dimensional spherical layer. A set of points is called $1$-convex if all its points are vertices of the convex hull of this set. In \cite{3} an estimate…

We consider random matrices whose shape is the dilation $N\lambda$ of a self-conjugate Young diagram $\lambda$. In the large-$N$ limit, the empirical distribution of the squared singular values converges almost surely to a probability…

Consider a random $d$-dimensional simplex whose vertices are $d+1$ random points sampled independently and uniformly from the unit sphere in $\mathbb R^d$. We show that the expected sum of solid angles at the vertices of this random simplex…

Let $\mathcal A$ be the adjacency matrix of a random $d$-regular graph on $N$ vertices, and we denote its eigenvalues by $\lambda_1\geq \lambda_2\cdots \geq \lambda_{N}$. For $N^{2/3}\ll d\leq N/2$, we prove optimal rigidity estimates of…

We prove a general theorem providing smoothed analysis estimates for conic condition numbers of problems of numerical analysis. Our probability estimates depend only on geometric invariants of the corresponding sets of ill-posed inputs.…

In this article, we consider `$N$'spherical caps of area $4\pi p$ were uniformly distributed over the surface of a unit sphere. We study the random intersection graph $G_N$ constructed by these caps. We prove that for $p =…