arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0708.4161cond-mat.stat-mechcond-mat.dis-nn
收藏

任意两点相关随机网络的生成

Generation of arbitrarily two-point correlated random networks

Sebastian Weber, Markus Porto

摘要:

随机网络被广泛地用作研究复杂网络性质的零模型。我们描述了一个有效的和准确的算法来生成任意两点相关的无向随机网络没有自我或多个顶点之间的边缘。为了系统地研究两点相关性的影响,我们进一步开发了一种形式主义来构建一个联合度分布$P(j,k)$,它允许同时固定任意度分布$P(k)$和任意平均最近邻函数$\knn(k)$。并以无标度网络($P(k) \propto k^{-γ}$)和经验复杂网络($P(k)$取自网络)为例,证明了该算法的有效性.最后,我们将我们的算法推广到退火网络,从而允许网络以类似平均场的方式表示。

英文摘要:

Random networks are intensively used as null models to investigate properties of complex networks. We describe an efficient and accurate algorithm to generate arbitrarily two-point correlated undirected random networks without self- or multiple-edges among vertices. With the goal to systematically investigate the influence of two-point correlations, we furthermore develop a formalism to construct a joint degree distribution $P(j,k)$ which allows to fix an arbitrary degree distribution $P(k)$ and an arbitrary average nearest neighbor function $\knn(k)$ simultaneously. Using the presented algorithm, this formalism is demonstrated with scale-free networks ($P(k) \propto k^{-γ}$) and empirical complex networks ($P(k)$ taken from network) as examples. Finally, we generalize our algorithm to annealed networks which allows networks to be represented in a mean-field like manner.

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

↑