arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.6967cond-mat.stat-mechphysics.comp-ph
收藏

平面欧氏相对邻域图上的渗流阈值

Percolation thresholds on planar Euclidean relative neighborhood graphs

O. Melchert

摘要:

在所提出的文章中,统计性质的拓扑结构和相对邻域图(RNG)的平面点集的标准渗流,考虑到欧几里德度量,进行审查。RNG属于"邻近图“族,即它们的边集编码关于给定边的终端节点的近邻的邻近信息。因此,例如,在构造用于保证所有底层节点的连通性的无线自组织网络的骨干的上下文中讨论。在这里,通过数值模拟,我们确定RNG的渐近程度和直径,我们估计他们的债券和网站的渗流阈值,这是以前被证明是非平凡的。我们比较的结果,定期2D图的程度是接近的RNG。最后,我们推导出常见的渗流临界指数从RNG数据验证相关的普适类是标准的二维渗流。

英文摘要:

In the presented article, statistical properties regarding the topology and standard percolation on relative neighborhood graphs (RNGs) for planar sets of points, considering the Euclidean metric, are put under scrutiny. RNGs belong to the family of ``proximity graphs'', i.e. their edge-set encodes proximity information regarding the close neighbors for the terminal nodes of a given edge. Therefore they are, e.g., discussed in the context of the construction of backbones for wireless ad-hoc networks that guarantee connectedness of all underlying nodes. Here, by means of numerical simulations, we determine the asymptotic degree and diameter of RNGs and we estimate their bond and site percolation thresholds, which were previously conjectured to be nontrivial. We compare the results to regular 2D graphs for which the degree is close to that of the RNG. Finally, we deduce the common percolation critical exponents from the RNG data to verify that the associated universality class is that of standard 2D percolation.

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

↑