Assortativity in random line graphs

Abstract

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.

10 pages, 6 figures

References in corpus (5)

• Line Graphs, Link Partitions and Overlapping Communities
• Random graphs with clustering
• Two complementary representations of a scale-free network
• Clustering under the line graph transformation: Application to reaction network
• Structural and spectral properties of a family of deterministic recursive trees: Rigorous solutions