中文
相关论文

相关论文: Grassmann angles and absorption probabilities of G…

200 篇论文

For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…

概率论 · 数学 2020-07-16 Thomas Godland , Zakhar Kabluchko , Dmitry Zaporozhets

Consider a $d$-dimensional simplex whose vertices are random points chosen independently according to the standard Gaussian distribution on $\mathbb R^d$. We prove that the expected angle sum of this random simplex equals the angle sum of…

概率论 · 数学 2019-03-06 Zakhar Kabluchko , Dmitry Zaporozhets

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…

概率论 · 数学 2019-12-30 Zakhar Kabluchko , Dmitry Zaporozhets

We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…

概率论 · 数学 2020-12-25 Julien Randon-Furling , Dmitry Zaporozhets

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

In this paper we present several results on the expected complexity of a convex hull of $n$ points chosen uniformly and independently from a convex shape. (i) We show that the expected number of vertices of the convex hull of $n$ points,…

计算几何 · 计算机科学 2011-11-24 Sariel Har-Peled

We analyze the probability that a random m-dimensional linear subspace of R^n both intersects a regular closed convex cone C\subseteq R^n and lies within distance \alpha of an m-dimensional subspace not intersecting C (except at the…

最优化与控制 · 数学 2013-07-11 Dennis Amelunxen , Peter Bürgisser

Pick $d+1$ points uniformly at random on the unit sphere in $\mathbb R^d$. What is the expected value of the angle sum of the simplex spanned by these points? Choose $n$ points uniformly at random in the $d$-dimensional ball. What is the…

概率论 · 数学 2020-03-04 Zakhar Kabluchko

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

概率论 · 数学 2023-01-11 Satoshi Hayakawa , Terry Lyons , Harald Oberhauser

It is known that the complex Grassmannian of $k$-dimensional subspaces can be identified with the set of projection matrices of rank $k$. It is also classically known that the convex hull of this set is the set of Hermitian matrices with…

组合数学 · 数学 2024-03-19 Kazumasa Narita

Consider a sequence of partial sums $S_i= \xi_1+\dots+\xi_i$, $1\leq i\leq n$, starting at $S_0=0$, whose increments $\xi_1,\dots,\xi_n$ are random vectors in $\mathbb R^d$, $d\leq n$. We are interested in the properties of the convex hull…

概率论 · 数学 2017-08-23 Zakhar Kabluchko , Vladislav Vysotsky , Dmitry Zaporozhets

This paper studies the convex hull of $d$-dimensional samples i.i.d. generated from spherically symmetric distributions. Specifically, we derive a complete integration formula for the expected facet number of the convex hull. This formula…

概率论 · 数学 2024-02-16 Feng Zhao , Xinyi Tong , Shao-Lun Huang

Given independent normally distributed points A,B,C,D in Euclidean 3-space, let Q denote the plane determined by A,B,C and D^ denote the orthogonal projection of D onto Q. The probability that the tetrahedron ABCD is acute remains…

概率论 · 数学 2022-03-22 Steven Finch

Choose $n$ random, independent points in $\R^d$ according to the standard normal distribution. Their convex hull $K_n$ is the {\sl Gaussian random polytope}. We prove that the volume and the number of faces of $K_n$ satisfy the central…

组合数学 · 数学 2007-05-23 I. Barany , V. H. Vu

Consider a random simplex $[X_1,\ldots,X_n]$ defined as the convex hull of independent identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^{n-1}$ with the following beta density: $$ f_{n-1,\beta} (x) \propto…

概率论 · 数学 2020-07-14 Zakhar Kabluchko

The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…

概率论 · 数学 2022-01-11 M. Reitzner , C. Schuett , E. M. Werner

Let $X_i = {X_i(t), t \in T}$ be i.i.d. copies of a centered Gaussian process $X = {X(t), t \in T}$ with values in $\mathbb{R}^d$ defined on a separable metric space $T.$ It is supposed that $X$ is bounded. We consider the asymptotic…

概率论 · 数学 2015-03-17 Yu. Davydov

Flag measures are descriptors of convex bodies $K$ in $d$-dimensional Euclidean space generalizing the classical area measures. They have been used to provide general integral formulas for mixed volumes (see Hug, Rataj and Weil (2017)).…

度量几何 · 数学 2017-06-26 Wolfgang Weil

We study the number of facets of the convex hull of n independent standard Gaussian points in d-dimensional Euclidean space. In particular, we are interested in the expected number of facets when the dimension is allowed to grow with the…

概率论 · 数学 2024-01-11 Karoly J Boroczky , Gabor Lugosi , Matthias Reitzner

We initiate the study of average intersection theory in real Grassmannians. We define the expected degree $\textrm{edeg} G(k,n)$ of the real Grassmannian $G(k,n)$ as the average number of real $k$-planes meeting nontrivially $k(n-k)$ random…

代数几何 · 数学 2018-01-22 Peter Bürgisser , Antonio Lerario
‹ 上一页 1 2 3 10 下一页 ›