DynComm R Package -- Dynamic Community Detection for Evolving Networks

Abstract

Nowadays, the analysis of dynamics in networks represents a great deal in the Social Network Analysis research area. To support students, teachers, developers, and researchers in this work we introduce a novel R package, namely DynComm. It is designed to be a multi-language package, that can be used for community detection and analysis on dynamic networks. The package introduces interfaces to facilitate further developments and the addition of new and future developed algorithms to deal with community detection in evolving networks. This new package has the goal of abstracting the programmatic interface of the algorithms, whether they are written in R or other languages, and expose them as functions in R.

References in corpus (7)

• Fast unfolding of communities in large networks
• Near linear time algorithm to detect community structures in large-scale networks
• Benchmark graphs for testing community detection algorithms
• Towards real-time community detection in large networks
• A linear streaming algorithm for community detection in very large networks
• Streaming, Memory Limited Algorithms for Community Detection
• Density-based Community Detection/Optimization