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

阿波罗网络平均路径长度的精确解析解

Exact analytical solution of average path length for Apollonian networks

Zhongzhi Zhang, Lichao Chen, Shuigeng Zhou, Lujun Fang, Jihong Guan, Tao Zou

摘要:

给出了Apollonian网络平均路径长度的精确公式,并利用由自相似结构导出的递推关系,得到了Apollonian网络平均路径长度的精确解$\bar{d}_t$.与众所周知的数值结果$\bar{d}_t \propto (\ln N_t)^{3/4}$ [Phys. Rev. Lett. \textbf{94},018702(2005)],我们的严格解表明,在网络大小的无限极限$N_t$中,平均路径长度以$\bar{d}_t \propto \ln N_t$的形式递增。大量的数值计算与我们的封闭解完全一致。

英文摘要:

The exact formula for the average path length of Apollonian networks is found. With the help of recursion relations derived from the self-similar structure, we obtain the exact solution of average path length, $\bar{d}_t$, for Apollonian networks. In contrast to the well-known numerical result $\bar{d}_t \propto (\ln N_t)^{3/4}$ [Phys. Rev. Lett. \textbf{94}, 018702 (2005)], our rigorous solution shows that the average path length grows logarithmically as $\bar{d}_t \propto \ln N_t$ in the infinite limit of network size $N_t$. The extensive numerical calculations completely agree with our closed-form solution.

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

↑