Deciphering the global organization of clustering in real complex networks

Abstract

We uncover the global organization of clustering in real complex networks. As it happens with other fundamental properties of networks such as the degree distribution, we find that real networks are neither completely random nor ordered with respect to clustering, although they tend to be closer to maximally random architectures. We reach this conclusion by comparing the global structure of clustering in real networks with that in maximally random and in maximally ordered clustered graphs. The former are produced with an exponential random graph model that maintains correlations among adjacent edges at the minimum needed to conform with the expected clustering spectrum; the later with a random model that arranges triangles in cliques inducing highly ordered structures. To compare the global organization of clustering in real and model networks, we compute $m$-core landscapes, where the $m$-core is defined, akin to the $k$-core, as the maximal subgraph with edges participating at least in $m$ triangles. This property defines a set of nested subgraphs that, contrarily to $k$-cores, is able to distinguish between hierarchical and modular architectures. To visualize the $m$-core decomposition we developed the LaNet-vi 3.0 tool.

References in corpus (10)

• Hyperbolic Geometry of Complex Networks
• Random graphs with clustering
• Navigability of Complex Networks
• Sustaining the Internet with Hyperbolic Mapping
• Self-similarity of complex networks and hidden metric spaces
• Random graphs containing arbitrary distributions of subgraphs
• Percolation and Epidemic Thresholds in Clustered Networks
• Clustering in complex networks. I. General formalism
• Clustering in complex networks. II. Percolation properties
• Bond percolation on a class of clustered random networks

Cited by in corpus (28)

• Quantifying randomness in real networks
• Higher-order clustering in networks
• Emergent Complex Network Geometry
• The hidden geometry of weighted complex networks
• Clustering implies geometry in networks
• Link prediction with hyperbolic geometry
• Network cloning unfolds the effect of clustering on dynamical processes
• Percolation on random networks with arbitrary k-core structure
• Meta-validation of bipartite network projections
• Clustering Spectrum of scale-free networks
• Coupled dynamics of node and link states in complex networks: A model for language competition
• Percolation and the effective structure of complex networks
• Beyond clustering: Mean-field dynamics on networks with arbitrary subgraph composition
• Functional structure in production networks
• Weighted hypersoft configuration model
• The role of adjacency matrix degeneration in maximum entropy weighted network models
• Statistical mechanics of random geometric graphs: Geometry-induced first order phase transition
• Scale-free network clustering in hyperbolic and other random graphs
• Random Graphs with Prescribed $K$-Core Sequences: A New Null Model for Network Analysis
• Growing homophilic networks are natural navigable small worlds
• Emergence of coexisting percolating clusters in networks
• Coexistence of phases and the observability of random graphs
• Protein residue networks from a local search perspective
• Strongly clustered random graphs via triadic closure: An exactly solvable model
• Fast Hierarchy Construction for Dense Subgraphs
• Language dynamics within adaptive networks: An agent-based approach of nodes and links coevolution
• Performance Rescaling of Complex Networks
• Commodity-specific triads in the Dutch inter-industry production network