arXiv · 0908.3180
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.
Explore related subjects
Keep this discovery
Anna Manka-Krason, Krzysztof Kulakowski. 2009-08-21. Assortativity in random line graphs. https://arxiv.org/abs/0908.3180
Cite the original work for its findings. Save a collection to share your selection of sources.