Louvain Modularity

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

The Louvain Method for community detection is a method to extract communities from large networks created by Blondel et al.[1] from the University of Louvain (affiliation of authors has given the method its name). The method is a greedy optimization method that appears to run in time .

Modularity Optimization[edit]

The inspiration for this method of community detection is the optimization of Modularity as the algorithm progresses. Modularity is a scale value between -1 and 1 that measures the density of edges inside communities to edges outside communities. Optimizing this value theoretically results in the best possible grouping of the nodes of a given network, however going through all possible iterations of the nodes into groups is impractical so heuristic algorithms are used. In the Louvain Method of community detection, first small communities are found by optimizing modularity locally on all nodes, then each small community is grouped into one node and the first step is repeated. The method is similar to the earlier method by Clauset, Newman and Moore[2] that connects communities whose amalgamation produces the largest increase in modularity.

Algorithm[edit]

The value to be optimized is modularity, defined as a value between -1 and 1 that measures the density of links inside communities compared to links between communities.[3] For a weighted graph, modularity is defined as:

where

  • represents the edge weight between nodes and ;
  • and are the sum of the weights of the edges attached to nodes and , respectively;
  • is the sum of all of the edge weights in the graph;
  • and are the communities of the nodes; and
  • is a simple delta function.

In order to maximize this value efficiently, the Louvain Method has two phases that are repeated iteratively.

First, each node in the network is assigned to its own community. Then for each node , the change in modularity is calculated for removing from its own community and moving it into the community of each neighbor of . This value is easily calculated by two steps: (1) removing from its original community, and (2) inserting to the community of . The two equations are quite similar, and the equation for step (2) is: [3]

Where is sum of all the weights of the links inside the community is moving into, is the sum of all the weights of the links to nodes in the community is moving into, is the weighted degree of , is the sum of the weights of the links between and other nodes in the community that is moving into, and is the sum of the weights of all links in the network. Then, once this value is calculated for all communities is connected to, is placed into the community that resulted in the greatest modularity increase. If no increase is possible, remains in its original community. This process is applied repeatedly and sequentially to all nodes until no modularity increase can occur. Once this local maximum of modularity is hit, the first phase has ended.

In the second phase of the algorithm, it groups all of the nodes in the same community and builds a new network where nodes are the communities from the previous phase. Any links between nodes of the same community are now represented by self loops on the new community node and links from multiple nodes in the same community to a node in a different community are represented by weighted edges between communities. Once the new network is created, the second phase has ended and the first phase can be re-applied to the new network.

Previous Uses[edit]

  • Twitter social Network (2.4 Million nodes, 38 million links) by Josep Pujol, Vijay Erramilli, and Pablo Rodriguez:[4] The authors explore the problem of partitioning Online Social Networks onto different machines.
  • Mobile phone Network (4 Million nodes, 100 Million links) by Derek Greene, Donal Doyle, and Padraig Cunningham:[5] Community-tracking strategies for identifying dynamic communities of different dynamic social networks.
  • Detecting species in network-based dynamical model.[6]

Comparison to Other Methods[edit]

When comparing modularity optimization methods, the two measures of importance are the speed and the resulting modularity value. A higher speed is better as it shows a method is more efficient than others and a higher modularity value is desirable as it points to having better defined communities. The compared methods are, the algorithm of Clauset, Newman, and Moore,[7] Pons and Latapy,[8] and Watika and Tsurumi.[9]

Modularity Optimization Comparison[10]
Karate Arxiv Internet Web nd.edu Phone Web uk-2005 Web WebBase 2001
Nodes/links 34/77 9k/24k 70k/351k 325k/1M 2.6M/6.3M 39M/783M 118M/1B
Clauset, Newman, and Moore .38/0s .772/3.6s .692/799s .927/5034s -/- -/- -/-
Pons and Latapy .42/0s .757/3.3s .729/575s .895/6666s -/- -/- -/-
Watike and Tsurmi .42/0s .761/0.7s .667/62s .898/248s .56/464s -/- -/-
Louvain Method .42/0s .813/0s .781/1s .935/3s .769/134s .979/738s .984/152mn

-/- in the table refers to a method that took over 24hrs to run. This table (from [1][11]) shows that the Louvain method outperforms many similar modularity optimization methods in both the modularity and the time categories.

See also[edit]

References[edit]

  1. ^ a b Blondel, Vincent D; Guillaume, Jean-Loup; Lambiotte, Renaud; Lefebvre, Etienne (9 October 2008). "Fast unfolding of communities in large networks". Journal of Statistical Mechanics: Theory and Experiment. 2008 (10): P10008. arXiv:0803.0476Freely accessible. Bibcode:2008JSMTE..10..008B. doi:10.1088/1742-5468/2008/10/P10008. 
  2. ^ Clauset, Aaron; Newman, M. E. J.; Moore, Cristopher (2004-12-06). "Finding community structure in very large networks". Physical Review E. 70 (6). arXiv:cond-mat/0408187Freely accessible. Bibcode:2004PhRvE..70f6111C. doi:10.1103/PhysRevE.70.066111. ISSN 1539-3755. 
  3. ^ a b Fast unfolding of communities in large networks, Vincent D Blondel, Jean-Loup Guillaume, Renaud Lambiotte, Etienne Lefebvre, Journal of Statistical Mechanics: Theory and Experiment 2008 (10), P10008 (12pp) doi: 10.1088/1742-5468/2008/10/P10008. ArXiv: https://arxiv.org/abs/0803.0476
  4. ^ https://arxiv.org/pdf/0905.4918v1.pdf
  5. ^ "Archived copy" (PDF). Archived from the original (PDF) on 2013-05-12. Retrieved 2014-11-20. 
  6. ^ Markovitch, Omer; Krasnogor, Natalio. "Predicting species emergence in simulated complex pre-biotic networks". PLoS ONE. 13 (2): e0192871. doi:10.1371/journal.pone.0192871. 
  7. ^ http://journals.aps.org/pre/abstract/10.1103/PhysRevE.70.066111
  8. ^ http://jgaa.info/accepted/2006/PonsLatapy2006.10.2.pdf
  9. ^ https://arxiv.org/abs/cs/0702048
  10. ^ https://arxiv.org/pdf/0803.0476v2.pdf
  11. ^ Multilevel local optimization of modularity, T. Aynaud, V.D. Blondel, J.-L. Guillaume, R. Lambiotte - in Graph Partitioning, 315-345, Publisher John Wiley & Sons, 2011.