louvain: Louvain algorithm

In yishaishimoni/phenoClust: Find clusters by network modularity

Description

Implementation of the Louvain method for local maximization of modularity.

Usage

  louvain(G, C=1:ncol(G), maxreps = 100, verbose = TRUE)

Arguments

G	a symmetric N-by-N numeric matrix representing the weights of edges between the N nodes
maxreps	a numeric value indicating the maximal number of iteration in the Louvain algorithm (default=100)
verbose	a boolean vaue indicating whether to print progress messages (default=TRUE)
C	an optional vector of length N with the initial numeric cluster assignments (default is for each sample to belong to its own singleton cluster)

Value

a list containing the a vector of length N (clusters) with cluster assignments that maximizes modularity, and the new modularity (newQ)

yishaishimoni/phenoClust documentation built on May 4, 2019, 5:28 p.m.