The rich club module

Rich Club class.

class hcga.features.rich_club.RichClub(graph=None)

Rich Club class.

Features based on the Rich Club of a graph.

For each degree k, the rich-club coefficient is the ratio of the number of actual to the number of potential edges for nodes with degree greater than k:

Rich club calculations using networkx:

Rich club

References

1

Julian J. McAuley, Luciano da Fontoura Costa, and Tibério S. Caetano, “The rich-club phenomenon across complex network hierarchies”, Applied Physics Letters Vol 91 Issue 8, August 2007. https://arxiv.org/abs/physics/0701290

2

R. Milo, N. Kashtan, S. Itzkovitz, M. E. J. Newman, U. Alon, “Uniform generation of random graphs with arbitrary degree sequences”, 2006. https://arxiv.org/abs/cond-mat/0312028

Initialise a feature class.

Parameters

graph (Graph) – graph for initialisation, converted to given encoding

compute_features()

Main feature extraction function.

This function should be used by each specific feature class to add new features.

hcga.features.rich_club.eval_rich_club(graph)

hcga.features.rich_club.rich_club_k_1(graph)

hcga.features.rich_club.rich_club_k_max(graph)

hcga.features.rich_club.rich_club_maxminratio(graph)