Rich-Club Ordering and the Dyadic Effect: Two Interrelated Phenomena
arXiv:1705.02201 · doi:10.1016/j.physa.2017.08.122
Abstract
Rich-club ordering and the dyadic effect are two phenomena observed in complex networks that are based on the presence of certain substructures composed of specific nodes. Rich-club ordering represents the tendency of highly connected and important elements to form tight communities with other central elements. The dyadic effect denotes the tendency of nodes that share a common property to be much more interconnected than expected. In this study, we consider the interrelation between these two phenomena, which until now have always been studied separately. We contribute with a new formulation of the rich-club measures in terms of the dyadic effect. Moreover, we introduce certain measures related to the analysis of the dyadic effect, which are useful in confirming the presence and relevance of rich-clubs in complex networks. In addition, certain computational experiences show the usefulness of the introduced quantities with regard to different classes of real networks.
References in corpus (8)
- Reaction-diffusion processes and metapopulation models in heterogeneous networks
- The Rich-Club Phenomenon In The Internet Topology
- The rich-club phenomenon across complex network hierarchies
- On the rich-club effect in dense and weighted networks
- Structural constraints in complex networks
- VIP-club phenomenon: emergence of elites and masterminds in social networks
- Statistical significance of rich-club phenomena in complex networks
- Structural Bounds on the Dyadic Effect
Cited by in corpus (7)
- Generalized Rich-Club Ordering in Networks
- Investigating the configurations in cross-shareholding: a joint copula-entropy approach
- The Drivers of Global News Spreading Patterns
- Stratified communities in complex business networks
- The interconnectedness of the economic content in the speeches of the US Presidents
- Tsallis entropy for cross-shareholding network configurations
- Influence measures in subnetworks using vertex centrality