随机线图的可配性
Assortativity in random line graphs
摘要:
研究了Erdos-Renyi网络、指数增长网络和无标度网络的度-度相关性。我们证明,这些相关性是最大的指数网络。我们也计算这些相关性的线图,从所考虑的网络形成。理论和数值结果表明,所有线图都是选型的,即度与度之间的相关性为正。
英文摘要:
We investigate the degree-degree correlations in the Erdos-Renyi networks, the growing exponential networks and the scale-free networks. We demonstrate that these correlations are the largest for the exponential networks. We calculate also these correlations in the line graphs, formed from the considered networks. Theoretical and numerical results indicate that all the line graphs are assortative, i.e. the degree-degree correlation is positive.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。