hub_dominance(graph: <Mock id='140619399398544'>, communities: object, **kwargs) → object¶
The hub dominance of a community is defined as the ratio of the degree of its most connected node w.r.t. the theoretically maximal degree within the community.
- graph – a networkx/igraph object
- communities – NodeClustering object
- summary – boolean. If True it is returned an aggregated score for the partition is returned, otherwise individual-community ones. Default True.
If summary==True a FitnessResult object, otherwise a list of floats.
>>> from cdlib.algorithms import louvain >>> from cdlib import evaluation >>> g = nx.karate_club_graph() >>> communities = louvain(g) >>> scd = evaluation.hub_dominance(g,communities)