Clustering in random line graphs

Abstract

We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erdös-Rényi networks, the exponential and the scale-free growing networks. We show that the character of the degree distribution in these graphs remains Poissonian, exponential and power law, respectively, i.e. the same as in the original networks. When the mean degree $<k>$ increases, the obtained clustering coefficient $C$ tends to 0.50 for the transformed Erdös-Rényi networks, to 0.53 for the transformed exponential networks and to 0.61 for the transformed scale-free networks. These results are close to theoretical values, obtained with the model assumption that the degree-degree correlations in the initial networks are negligible.

9 pages, 4 figures

References in corpus (7)

• Critical phenomena in complex networks
• Line Graphs, Link Partitions and Overlapping Communities
• Random graphs with clustering
• Two complementary representations of a scale-free network
• Infinitely Robust Order and Local Order-Parameter Tulips in Apollonian Networks with Quenched Disorder
• Clusterization, frustration and collectivity in random networks
• Magnetism of frustrated regular networks

Cited by in corpus (10)

• Line Graphs of Weighted Networks for Overlapping Communities
• Towards the Heider balance with a cellular automaton
• Coupled dynamics of node and link states in complex networks: A model for language competition
• Line graphs as social networks
• Fragmentation transition in a coevolving network with link-state dynamics
• Dynamics of link states in complex networks: The case of a majority rule
• Variability Analysis of Complex Networks Measures based on Stochastic Distances
• Assortativity in random line graphs
• Reverse Line Graph Construction: The Matrix Relabeling Algorithm MARINLINGA Versus Roussopoulos's Algorithm
• Language dynamics within adaptive networks: An agent-based approach of nodes and links coevolution