Skip to main content
Article thumbnail
Location of Repository

Effects of degree correlations on the loop structure of scale free networks

By Ginestra Bianconi and Matteo Marsili

Abstract

In this paper we study the impact of degree correlations in the subgraph statistics of scalefree networks. In particular we consider loops, simple cases of network subgraphs which encode the redundancy of the paths passing through every two nodes of the network. We provide an understanding of the scaling of the clustering coefficient in modular networks in terms of the maximal eigenvector of the average adjacency matrix of the ensemble. Furthermore we show that correlations affect in a relevant way the average number of Hamiltonian paths in a three-core of real world networks. We prove our results in the two-vertex correlated hidden variable ensemble and we check the results with exact counting of small loops in real graphs

Topics: HB, QA
Publisher: Warwick Business School, Financial Econometrics Research Centre
Year: 2006
OAI identifier: oai:wrap.warwick.ac.uk:1752

Suggested articles


To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.