Perturbing General Uncorrelated Networks

Abstract

This paper is a direct continuation of an earlier work, where we studied Erdös-Rényi random graphs perturbed by an interaction Hamiltonian favouring the formation of short cycles. Here, we generalize these results. We keep the same interaction Hamiltonian but let it act on general graphs with uncorrelated nodes and an arbitrary given degree distribution. It is shown that the results obtained for Erdös-Rényi graphs are generic, at the qualitative level. However, scale-free graphs are an exception to this general rule and exhibit a singular behaviour, studied thoroughly in this paper, both analytically and numerically.

7 pages, 7 eps figures, 2-column revtex format, references added

References in corpus (2)

• Average path length in uncorrelated random networks with hidden variables
• Network Transitivity and Matrix Models

Cited by in corpus (21)

• Critical phenomena in complex networks
• Generation of uncorrelated random scale-free networks
• The statistical mechanics of networks
• Clustering in complex networks. I. General formalism
• Tuning clustering in random networks with arbitrary degree distributions
• Transport on Complex Networks: Flow, Jamming and Optimization
• Local structure of directed networks
• Solution for the properties of a clustered network
• Kinetic Theory of Random Graphs: from Paths to Cycles
• Homogeneous complex networks
• Phase transitions in social networks
• Analytical results for bond percolation and k-core sizes on clustered networks
• Low-temperature behaviour of social and economic networks
• Condensation and topological phase transitions in a dynamical network model with rewiring of the links
• Replica methods for loopy sparse random graphs
• Condensation of degrees emerging through a first-order phase transition in classical random graphs
• Unevenness of Loop Location in Complex Networks
• Analytic solution of the two-star model with correlated degrees
• Simple evolving random graphs
• Phase transitions in atypical systems induced by a condensation transition on graphs
• Individual versus Social Benefit on the Heterogeneous Networks