随机凸包的期望直径、宽度和复杂度
On the expected diameter, width, and complexity of a stochastic convex-hull
摘要:
我们研究了几个计算问题的随机凸包(SCH)。给定由$\mathbb{R}^d$中的每个具有存在概率的$n$点组成的随机数据集,SCH指的是数据集的实现的凸包,即,包括每个点及其存在概率的随机样本。我们有兴趣在计算某些预期的统计SCH,包括直径,宽度和组合的复杂性。对于直径,我们建立了第一个确定性的1.633近似算法的时间复杂度多项式在$n$和$d$。对于宽度,提供了两种近似算法:在$O(n^{d+1} \log n)$时间内运行的确定性$O(1)$近似和完全多项式时间随机近似方案(FPRAS)。对于组合复杂度,我们提出了一个精确的$O(n^d)$时间算法。我们的解决方案利用了欧几里得空间中的许多几何见解,其中一些可能是独立的兴趣。
英文摘要:
We investigate several computational problems related to the stochastic convex hull (SCH). Given a stochastic dataset consisting of $n$ points in $\mathbb{R}^d$ each of which has an existence probability, a SCH refers to the convex hull of a realization of the dataset, i.e., a random sample including each point with its existence probability. We are interested in computing certain expected statistics of a SCH, including diameter, width, and combinatorial complexity. For diameter, we establish the first deterministic 1.633-approximation algorithm with a time complexity polynomial in both $n$ and $d$. For width, two approximation algorithms are provided: a deterministic $O(1)$-approximation running in $O(n^{d+1} \log n)$ time, and a fully polynomial-time randomized approximation scheme (FPRAS). For combinatorial complexity, we propose an exact $O(n^d)$-time algorithm. Our solutions exploit many geometric insights in Euclidean space, some of which might be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。