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

随机简单三角剖分和随机简单四边形剖分的尺度极限

The scaling limit of random simple triangulations and random simple quadrangulations

Louigi Addario Berry, Marie Albenque

摘要:

设$M_n$是球面$S^2$的一个简单三角剖分,从所有具有n个顶点的三角剖分中随机均匀地画出。赋予$M_n$在其顶点上的均匀概率测度。在用$(3/(4n))^{1/4}$对$V(M_n)$上的图距离进行重新标度后,得到的随机测度度量空间在Gromov-Hausdorff-Prokhorov意义下按分布收敛于布朗映射.在证明上述事实时,我们引入了$M_n$顶点的标号函数。在这种标记下,到一个区别点的距离基本上由顶点标记给出,误差由地图中相关闭合环的卷绕数给出。我们建立简单的四边形类似的结果。

英文摘要:

Let $M_n$ be a simple triangulation of the sphere $S^2$, drawn uniformly at random from all such triangulations with n vertices. Endow $M_n$ with the uniform probability measure on its vertices. After rescaling graph distance on $V(M_n)$ by $(3/(4n))^{1/4}$, the resulting random measured metric space converges in distribution, in the Gromov-Hausdorff-Prokhorov sense, to the Brownian map. In proving the preceding fact, we introduce a labelling function for the vertices of $M_n$. Under this labelling, distances to a distinguished point are essentially given by vertex labels, with an error given by the winding number of an associated closed loop in the map. We establish similar results for simple quadrangulations.

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

↑