inferCommunitiesGreedily: Community detection, greedy algorithm

Description Usage Arguments Value Author(s)

Description

A naive implementation of community detection in a fully-connected weighted graph based on Newman ME, Girvan M. Finding and evaluating community structure in networks. Physical review E. 2004 Feb 26;69(2):026113.

Usage

1
2
inferCommunitiesGreedily(similarities, save.file = NULL,
  full_trajectory = F, simplify = T, loop_limit = Inf)

Arguments

similarities

a data frame with columns a, b, similarity representing the similarities between nodes. We assume undirected graph and b < a.

Value

a data frame with two columns, n - node id (taken from a, b of input) and cluster - unique cluster ID.

Author(s)

Yuriy Sverchkov


sverchkov/CommunityInference documentation built on May 7, 2019, 7:42 a.m.