recursiveigraph: Modules identification by recursive community detection

Description Usage Arguments Value Author(s) References

View source: R/util.R

Description

Modules detection using igraph's community detection algorithms, when the resulted module is larger than expected, it is further devided by the same program

Usage

1
2
recursiveigraph(g, savefile, method = c("fastgreedy", "louvain"),
  maxsize = 200, minsize = 30)

Arguments

g

igraph object, the network to be partitioned

savefile

plain text, used to store module, each line as a module

method

specify the community detection algorithm

maxsize

maximal module size

minsize

minimal module size

Value

None

Author(s)

Dong Li, dxl466@cs.bham.ac.uk

References

Blondel, Vincent D., et al. "Fast unfolding of communities in large networks." Journal of statistical mechanics: theory and experiment 2008.10 (2008): P10008.


MODA documentation built on Nov. 8, 2020, 6:39 p.m.