Clustering in random line graphs

DOI10.1016/J.CPC.2009.09.010zbMATH Open1202.05129arXiv0904.0659OpenAlexW1973121905WikidataQ112173486 ScholiaQ112173486MaRDI QIDQ615012FDOQ615012

Anna Mańka-Krasoń, Krzysztof Kułakowski, Advera Mwijage

Publication date: 5 January 2011

Published in: Computer Physics Communications (Search for Journal in Brave)

Abstract: We investigate the degree distribution $P(k)$ and the clustering coefficient $C$ of the line graphs constructed on the Erd"os-R'enyi 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"os-R'enyi 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.

Full work available at URL: https://arxiv.org/abs/0904.0659

Recommendations

• Degree distribution and assortativity in line graphs of complex networks
• The clustering coefficient of a scale-free random graph
• Degree and clustering coefficient in sparse random intersection graphs
• Global Clustering Coefficient in Scale-Free Networks
• How Clustering Affects Epidemics in Random Networks

zbMATH Keywords

clustering coefficientline graphsdegree distributionrandom networks

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Random graphs (graph-theoretic aspects) (05C80) Vertex degrees (05C07) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• Title not available (Why is that?)
• Metric structure of random networks
• Percolation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Scale-Free Networks
• Title not available (Why is that?)
• CLUSTERIZATION, FRUSTRATION AND COLLECTIVITY IN RANDOM NETWORKS
• Structure in complex networks

Cited In (7)

• Clustering in preferential attachment random graphs with edge-step
• The use of linked line segments for cluster representation and data reduction
• Finding the root graph through minimum edge deletion
• Variability analysis of complex networks measures based on stochastic distances
• ILIGRA: an efficient inverse line graph algorithm
• On the edges’ PageRank and line graphs
• Towards the Heider balance with a cellular automaton

This page was built for publication: Clustering in random line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q615012)