Organization Of Complex Networks Without Multiple Connections

PHYSICAL REVIEW LETTERS(2005)

引用 29|浏览10
暂无评分
摘要
We find a new structural feature of equilibrium complex random networks without multiple and self-connections. We show that if the number of connections is sufficiently high, these networks contain a core of highly interconnected vertices. The number of vertices in this core varies in the range between constxN(1/2) and constxN(2/3), where N is the number of vertices in a network. At the birth point of the core, we obtain the size-dependent cutoff of the distribution of the number of connections and find that its position differs from earlier estimates.
更多
查看译文
关键词
partition function,degree distribution,adjacency matrix,statistical independence,poisson distribution,statistical mechanics,critical point,complex network,critical value,graph theory,random graph
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要