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

包含任意子图分布的随机图

Random graphs containing arbitrary distributions of subgraphs

Brian Karrer, M. E. J. Newman

摘要:

传统的网络随机图模型生成的网络是局部树状的,这意味着所有局部邻域都采用树的形式。在这方面,这样的模型是非常不现实的,大多数真实的网络具有强烈的非树型邻域,包含短循环,集团或其他双连通子图。在本文中,我们提出并分析了一类新的随机图模型,它包含了一般的子图,允许非树型的邻域,同时仍然可以解决许多基本的网络属性。除其他事项外,我们给解决方案的巨大的组件的大小,出现的巨型组件的相变的位置,和渗流性质的网站和债券渗流模型所产生的网络。

英文摘要:

Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly non-tree-like neighborhoods that contain short loops, cliques, or other biconnected subgraphs. In this paper we propose and analyze a new class of random graph models that incorporates general subgraphs, allowing for non-tree-like neighborhoods while still remaining solvable for many fundamental network properties. Among other things we give solutions for the size of the giant component, the position of the phase transition at which the giant component appears, and percolation properties for both site and bond percolation on networks generated by the model.

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

↑