mosaicmpi.network.Network.community_search

Network.community_search(algorithm='greedy_modularity', resolution: float | None = 2.0, k: int | None = None, edge_weight: str | None = None)

Identifies communities from the program graph.

Parameters:

• algorithm (str, optional) – Valid algorithms include: “greedy_modularity”, “leiden”, “asyn_lpa”, “girvan_newman”. Defaults to “greedy_modularity”

• resolution (float, optional) – Resolution parameter is related to the relative size and number of communities. (resolution must not be set for asyn_lpa and girvan_newman algorithms), defaults to 2.0

• k (int, optional) – Number of clusters (applies to the girvan_newman algorithm only), defaults to None

• edge_weight (str, optional) – Add edge weights, using either the correlation (corr), and quantile-transformed correlation, which can be calculated prior to or after filtering (prefilter_quantile and postfilter_quantile, respectively). Defaults to None