arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.07481math.PRmath.MG
收藏

随机点集最大空单形个数的矩

Moments of the maximal number of empty simplices of a random point set

Daniel Temesvari

摘要:

对于来自$\mathbb{R}^M$的$n$点的有限集合$X$,$X$的$M$-元素子集$\{x_1,\dots,x_M\}$的度被定义为可以使用附加点$z\in X$从该$M$-元素子集构造的$M$-单形的数量,使得$X$的其他点不位于该$M$-单形的内部.此外,由$\textrm{deg} (X)$表示的$X$的度是其任何$M$元素子集的最大度。本文的目的是证明,如果集合$X$的元素是一致地且独立于凸体$W \subset \mathbb{R}^M$选择的,则对于某个常数$c>0$,$X$的阶矩满足$\mathbb{E}\left[\textrm{deg} (X)^k\right] \geq c n^k / \log n$。此外,它将表明,这些时刻收敛到无穷大的概率为集合$X$的点的数量走向无穷大。

英文摘要:

For a finite set $X$ of $n$ points from $\mathbb{R}^M$, the degree of an $M$-element subset $\{x_1,\dots,x_M\}$ of $X$ is defined as the number of $M$-simplices that can be constructed from this $M$-element subset using an additional point $z\in X$, such that no further point of $X$ lies in the interior of this $M$-simplex. Furthermore, the degree of $X$, denoted by $\textrm{deg} (X)$, is the maximal degree of any of its $M$-element subsets. The purpose of this paper is to show that the moments of the degree of $X$ satisfy $\mathbb{E}\left[\textrm{deg} (X)^k\right] \geq c n^k / \log n$, for some constant $c>0$, if the elements of the set $X$ are chosen uniformly and independently from a convex body $W \subset \mathbb{R}^M$. Additionally, it will be shown that these moments converge in probability to infinity as the number of points of the set $X$ goes to infinity.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑