arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0712.0415physics.soc-phcond-mat.dis-nnphysics.comp-ph
收藏

随机路径与最长路径:复杂网络中未被注意的基序

Random and Longest Paths: Unnoticed Motifs of Complex Networks

Luciano da Fontoura Costa

摘要:

路径是复杂网络中重要的结构元素,因为它们是有限的(不像行走),与有效节点覆盖(最小生成树)有关,并且可以被理解为对偶星连通性。本文引入了随机路的概念,并将其应用于复杂网络结构特性的研究,作为估计最长路的手段,随机路是通过随机选择网络中的一个节点,进行随机的自回避行走(这里称为路径行走)直到其终止而得到的。结果表明,不同的复杂网络模型(即Erdos-Renyi,Barabasi-Albert,Watts-Strogatz,地理模型,以及两个最近推出的基于路径的网络类型)的随机路径的分布是显着不同的,BA结构产生最短的随机游动,而最长的路径产生的WS网络。随机路径也被探索作为估计最长路径的手段(即,获得若干随机路径并且采取最长路径)。给出了几种网络模型的最长路收敛性及其性质。几个结果的报告和讨论,包括显着不同的长度的最长路径获得不同的网络模型。

英文摘要:

Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article introduces the concept of random path applies it for the investigation of structural properties of complex networks and as the means to estimate the longest path. Random paths are obtained by selecting one of the network nodes at random and performing a random self-avoiding walk (here called path-walk) until its termination. It is shown that the distribution of random paths are markedly different for diverse complex network models (i.e. Erdos-Renyi, Barabasi-Albert, Watts-Strogatz, a geographical model, as well as two recently introduced path-based network types), with the BA structures yielding the shortest random walks, while the longest paths are produced by WS networks. Random paths are also explored as the means to estimate the longest paths (i.e. several random paths are obtained and the longest taken). The convergence to the longest path and its properties ire characterized with respect to several networks models. Several results are reported and discussed, including the markedly distinct lengths of the longest paths obtained for the different network models.

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

↑