ragraph.analysis.heuristics._markov_gamma#
Heuristic that combines Hierarchical Markov Clustering (HMC) with Gamma bus detection.
Module Contents#
Functions#
Cluster a given graph hierarchically with buses on a local level or globally. |
Attributes#
- ragraph.analysis.heuristics._markov_gamma.markov_gamma_params#
- ragraph.analysis.heuristics._markov_gamma.markov_gamma_analysis#
- ragraph.analysis.heuristics._markov_gamma.markov_gamma_clustering(graph: ragraph.graph.Graph, root: Optional[Union[str, ragraph.graph.Node]] = None, leafs: Optional[Union[List[ragraph.graph.Node], List[str]]] = None, inherit: bool = True, loops: bool = False, edge_weights: Optional[List[str]] = None, alpha: int = markov_gamma_params['alpha'].default, beta: float = markov_gamma_params['beta'].default, mu: float = markov_gamma_params['mu'].default, gamma: float = markov_gamma_params['gamma'].default, local_buses: bool = markov_gamma_params['local_buses'].default, max_iter: int = markov_gamma_params['max_iter'].default, symmetrize: bool = markov_gamma_params['symmetrize'].default, inplace: bool = True, names: bool = False, safe: bool = True, **kwargs) Union[List[ragraph.graph.Node], Tuple[ragraph.graph.Graph, List[ragraph.graph.Node]]]#
Cluster a given graph hierarchically with buses on a local level or globally.