| Display title | Louvain modularity |
| Default sort key | Louvain modularity |
| Page length (in bytes) | 11,933 |
| Namespace ID | 0 |
| Page ID | 236979 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image |  |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Scavis |
| Date of page creation | 16:50, 25 October 2021 |
| Latest editor | imported>Scavis |
| Date of latest edit | 16:50, 25 October 2021 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | The Louvain method for community detection is a method to extract communities from large networks created by Blondel et al. 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 $ O(n\cdot log^{2... |
