back to main page

Chapter 9. Online Resources

Modularity-based Algorithms

Online Resource 9.1

There are several widely used community finding algorithms that maximize modularity.

Optimized Greedy Algorithm

The use of data structures for sparse matrices can decrease the greedy algorithm's computational complexity to 0(Nlog2N) [35]. See fast modularity for the code.

Louvain Algorithm

The modularity optimization algorithm achieves a computational complexity of 0(L) [2]. Hence it allows us to identify commu- nities in networks with millions of nodes, as illustrated in Figure 9.1. The algorithm is de- scribed in ADVANCED TOPICS 9.C. See find communities for the code.

CFinder

Online Resource 9.2

The CFinder software, allowing us to identify overlapping communities, can be downloaded from CFinder.

Map Equation for Infomap

Online Resource 9.3

For a dynamic visualization of the mechanism behind the map equation, see mapequation.