cograph (version 2.7.2)

community_fast_greedy: Fast Greedy Community Detection

Description

Hierarchical agglomeration using greedy modularity optimization. Produces a dendrogram of community merges.

Usage

community_fast_greedy(
  x,
  weights = NULL,
  merges = TRUE,
  modularity = TRUE,
  membership = TRUE,
  ...
)
com_fg(
  x,
  weights = NULL,
  merges = TRUE,
  modularity = TRUE,
  membership = TRUE,
  ...
)

Value

A cograph_communities object. The full igraph communities result, including the merge dendrogram when merges = TRUE, is kept in the "igraph_result" attribute.

A cograph_communities object. See detect_communities.

Arguments

x

Network input

weights

Edge weights. NULL uses network weights, NA for unweighted.

merges

Logical; return merge matrix? Default TRUE.

modularity

Logical; return modularity scores? Default TRUE.

membership

Logical; return membership vector? Default TRUE.

...

Passed to to_igraph, whose only other argument is directed; anything else raises an "unused argument" error.

References

Clauset, A., Newman, M.E.J., & Moore, C. (2004). Finding community structure in very large networks. Physical Review E, 70, 066111.

Examples

g <- igraph::make_graph("Zachary")
comm <- community_fast_greedy(g)
membership(comm)