Generalized Rich-Club Ordering in Networks

March 19, 2018 Β· Declared Dead Β· πŸ› J. Complex Networks

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Matteo Cinelli arXiv ID 1803.07000 Category physics.soc-ph Cross-listed cs.SI Citations 19 Venue J. Complex Networks Last Checked 3 months ago
Abstract
Rich-club ordering refers to the tendency of nodes with a high degree to be more interconnected than expected. In this paper we consider the concept of rich-club ordering when generalized to structural measures that differ from the node degree and to non-structural measures (i.e. to node metadata). The differences in considering rich-club ordering (RCO) with respect to both structural and non-structural measures is then discussed in terms of employed coefficients and of appropriate null models (link rewiring vs metadata reshuffling). Once a framework for the evaluation of generalized rich-club ordering (GRCO) is defined, we investigate such a phenomenon in real networks provided with node metadata. By considering different notions of node richness, we compare structural and non-structural rich-club ordering, observing how external information about the network nodes is able to validate the presence of rich-clubs in networked systems.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” physics.soc-ph

R.I.P. πŸ‘» Ghosted

Scale-free networks are rare

Anna D. Broido, Aaron Clauset

physics.soc-ph πŸ› Nat. Commun. πŸ“š 988 cites 8 years ago

Died the same way β€” πŸ‘» Ghosted