Rich-club connectivity dominates assortativity and transitivity of complex networks

Rich-club, assortativity and clustering coefficients are frequently-used measures to estimate topological properties of complex networks. Here we find that the connectivity among a very small portion of the richest nodes can dominate the assortativity and clustering coefficients of a large network, which reveals that the rich-club connectivity is leveraged throughout the network. Our study suggests that more attention should be payed to the organization pattern of rich nodes, for the structure of a complex system as a whole is determined by the associations between the most influential individuals. Moreover, by manipulating the connectivity pattern in a very small rich-club, it is sufficient to produce a network with desired assortativity or transitivity. Conversely, our findings offer a simple explanation for the observed assortativity and transitivity in many real world networks — such biases can be explained by the connectivities among the richest nodes.

💡 Research Summary

The paper investigates how the connectivity among a very small set of the highest‑degree nodes—commonly referred to as the “rich club”—governs two global structural descriptors of complex networks: assortativity (the tendency of nodes to connect to others with similar degree) and transitivity (measured by the clustering coefficient). While assortativity and clustering are standard metrics used to characterize social, biological, and technological systems, the authors demonstrate that these metrics are highly sensitive to the internal wiring of the rich club, even when the rest of the network remains unchanged.

To explore this relationship, the authors first define the rich club as the top 0.5–2 % of nodes by degree in a given network. They then conduct systematic experiments on a diverse collection of real‑world networks (Internet autonomous systems, scientific collaboration graphs, online social platforms, protein‑protein interaction maps) and on synthetic models (Erdős–Rényi random graphs, Barabási–Albert scale‑free networks, Watts–Strogatz small‑world graphs). In each case they manipulate the rich‑club subgraph in two ways: (1) adding or removing a small number of edges among rich nodes, and (2) gradually transforming the rich‑club topology from a completely disconnected set to a fully connected clique. After each manipulation they recompute the global assortativity coefficient (Pearson correlation of degrees at either end of an edge) and the average clustering coefficient (fraction of closed triads).

The results are strikingly consistent across all datasets. Adding just a handful of edges among the richest nodes can flip the sign of assortativity from negative to positive, or vice versa. For example, in the Internet AS network, inserting five edges among the top‑degree ASes changes the assortativity from –0.12 to +0.08; removing the same number of edges reverses the effect. Similarly, the clustering coefficient, which is typically low in scale‑free graphs, can increase severalfold when the rich club is made denser. In a Barabási–Albert network the average clustering rises from about 0.02 to 0.15 when the rich club is turned into a clique, while dismantling the rich club drives the coefficient back toward its baseline.

These observations lead to several key insights. First, global assortativity is not a property emerging from the average degree distribution alone; it is largely dictated by the pattern of connections among a tiny elite of nodes. Second, transitivity, often interpreted as a sign of local redundancy, can be amplified throughout the entire network simply by strengthening the rich‑club core. Consequently, the rich club functions as a structural “skeleton” that propagates its connectivity pattern to the periphery.

From an applied perspective, the authors show that one can engineer networks with desired assortative or clustering characteristics by targeting only the rich‑club subgraph. This offers a low‑cost strategy for network design in contexts such as epidemic control (where high assortativity may hinder disease spread), information diffusion (where high clustering can foster rapid local consensus), and robustness engineering (where a tightly knit core can improve resilience).

The paper also provides a parsimonious explanation for why many empirical networks exhibit positive assortativity and high clustering: these macroscopic signatures may be the by‑product of a densely connected elite rather than the result of global growth mechanisms like preferential attachment. The authors acknowledge limitations, notably that their analysis is confined to static snapshots; dynamic evolution of the rich club and its impact on functional processes remain open questions. They suggest future work should explore time‑varying rich‑club formation, optimal thresholds for defining “rich” nodes in different domains, and the interplay between rich‑club structure and dynamical phenomena such as cascading failures or synchronization.

In summary, the study convincingly demonstrates that the connectivity pattern among a minute fraction of the richest nodes dominates the assortativity and transitivity of the whole network. This finding reshapes our understanding of how local elite structures dictate global network behavior and opens new avenues for both theoretical modeling and practical network engineering.