Exploring the assortativity-clustering space of a network's degree sequence

Abstract

Nowadays there is a multitude of measures designed to capture different aspects of network structure. To be able to say if the structure of certain network is expected or not, one needs a reference model (null model). One frequently used null model is the ensemble of graphs with the same set of degrees as the original network. In this paper we argue that this ensemble can be more than just a null model -- it also carries information about the original network and factors that affect its evolution. By mapping out this ensemble in the space of some low-level network structure -- in our case those measured by the assortativity and clustering coefficients -- one can for example study how close to the valid region of the parameter space the observed networks are. Such analysis suggests which quantities are actively optimized during the evolution of the network. We use four very different biological networks to exemplify our method. Among other things, we find that high clustering might be a force in the evolution of protein interaction networks. We also find that all four networks are conspicuously robust to both random errors and targeted attacks.

References in corpus (15)

• Emergence of scaling in random networks
• Statistical mechanics of complex networks
• The structure and function of complex networks
• Error and attack tolerance of complex networks
• Assortative mixing in networks
• Classes of behavior of small-world networks
• Specificity and stability in topology of protein networks
• Attack vulnerability of complex networks
• Why social networks are different from other types of networks
• Cascade control and defense in complex networks
• Pattern Detection in Complex Networks: Correlation Profile of the Internet
• Currency and commodity metabolites: Their identification and relation to the modularity of metabolic networks
• Complex networks theory for analyzing metabolic networks
• Role-similarity based functional prediction in networked systems: Application to the yeast proteome
• Degree Landscapes in Scale-Free Networks

Cited by in corpus (20)

• The entropic origin of disassortativity in complex networks
• Threshold model of cascades in temporal networks
• Evolving Clustered Random Networks
• Disassortative mixing in online social networks
• Clustering Drives Assortativity and Community Structure in Ensembles of Networks
• Reciprocity of Networks with Degree Correlations and Arbitrary Degree Sequences
• Topological Structure of Urban Street Networks from the Perspective of Degree Correlations
• Degree Relations of Triangles in Real-world Networks and Models
• Sampling motif-constrained ensembles of networks
• Network nestedness as generalized core-periphery structures
• The effects of degree correlations on network topologies and robustness
• The diplomat's dilemma: Maximal power for minimal effort in social networks
• Revising the simple measures of assortativity in complex networks
• Impact of perception models on friendship paradox and opinion formation
• The Bass diffusion model: agent-based implementation on arbitrary networks
• Emergence of collective memories
• Selective pressure on metabolic network structures as measured from the random blind-watchmaker network
• Generating random networks that consist of a single connected component with a given degree distribution
• Inter-organisational patent opposition network: How companies form adversarial relationships
• Interplay between Network Topology and Dynamics in Neural Systems