arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1805.08669math.PR
收藏

随机几何图的最优Cheeger割和二分

Optimal Cheeger cuts and bisections of random geometric graphs

Tobias Müller, Mathew D. Penrose

摘要:

令$d \geq 2$。图的Cheeger常数是指相对体积不超过1/2的顶点集的所有子集的最小表体积比。这里有几种定义曲面和体积的方法:最简单的方法是计算边界边(对于曲面)和顶点(对于体积)。我们证明,对于几何具有Lipschitz边界和距离参数衰减较慢的$d$维域中$n$随机点上的(可能加权)图(作为$n$的函数)比连通性阈值、Cheeger常数(在表面和体积的几种可能的定义下),也称为电导,适当地重新缩放,对于大的$n$,收敛于域的类似Cheeger型常数。此前,García Trillos { \em et al.}对于$d \geq 3$已经证明了这一点,但是对于$d=2$,需要对距离参数附加一个额外的条件。

英文摘要:

Let $d \geq 2$. The Cheeger constant of a graph is the minimum surface-to-volume ratio of all subsets of the vertex set with relative volume at most 1/2. There are several ways to define surface and volume here: the simplest method is to count boundary edges (for the surface) and vertices (for the volume). We show that for a geometric (possibly weighted) graph on $n$ random points in a $d$-dimensional domain with Lipschitz boundary and with distance parameter decaying more slowly (as a function of $n$) than the connectivity threshold, the Cheeger constant (under several possible definitions of surface and volume), also known as conductance, suitably rescaled, converges for large $n$ to an analogous Cheeger-type constant of the domain. Previously, García Trillos {\em et al.} had shown this for $d \geq 3$ but had required an extra condition on the distance parameter when $d=2$.

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

↑