Talk:Louvain method

This article is within the scope of WikiProject Computer science, a collaborative effort to improve the coverage of Computer science related articles on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.Computer scienceWikipedia:WikiProject Computer scienceTemplate:WikiProject Computer scienceComputer science

Low

This article has been rated as Low-importance on the project's importance scale.

Things you can help WikiProject Computer science with:

Here are some tasks awaiting attention:

Article requests :
- Requested articles/Applied arts and sciences/Computer science, computing, and Internet
Cleanup :
- Computer science articles needing attention
- Computer science articles needing expert attention
Copyedit :
- Computing
Expand :
- Computer science
Infobox :
- Computer science articles without infoboxes
Maintain :
- Timeline of computing 2020–present
Photo :
- Find pictures for the biographies of computer scientists (see List of computer scientists)
- Computing articles needing images
Stubs :
- Computer science stubs
Unreferenced :
- WikiProject Computer science/Unreferenced BLPs
Project-related :
- Tag all relevant articles in Category:Computer science and sub-categories with {{WikiProject Computer science}}

Mathematics

	Mathematics portal This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
???	This article has not yet received a rating on the project's priority scale.

Computing: Networking Low‑importance

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
Low	This article has been rated as Low-importance on the project's importance scale.
	This article is supported by Networking task force.

Wrong page name!

This page is not about the measure of a network property but about a method or algorithm for finding it. The very first sentence of this article and also the abstract of the Blondel paper say so, too. It is misleading to call this page "Louvain modularity", as if it is different from network modularity they optimized (Newman M E J, 2004 Phys. Rev. E 70 056131), and which is also described on https://en.wikipedia.org/wiki/Modularity_(networks)

I strongly suggest renaming this page, I suppose "Louvain algorithm" comes closest to what the original paper describes. Maybe get in touch with the original authors?— Preceding unsigned comment added by Plijnzaad (talk • contribs) 09:00, 6 October 2020 (UTC)[reply]

Renamed by Superbatfish, —Paleo Neonate – 20:45, 16 March 2021 (UTC)[reply]

External links modified

Hello fellow Wikipedians,

I have just modified one external link on Louvain Modularity. Please take a moment to review my edit. If you have any questions, or need the bot to ignore the links, or the page altogether, please visit this simple FaQ for additional information. I made the following changes:

Added archive https://web.archive.org/web/20130512153616/http://www.csi.ucd.ie/files/ucd-csi-2011-06.pdf to https://www.csi.ucd.ie/files/ucd-csi-2011-06.pdf

When you have finished reviewing my changes, you may follow the instructions on the template below to fix any issues with the URLs.

This message was posted before February 2018. After February 2018, "External links modified" talk page sections are no longer generated or monitored by InternetArchiveBot. No special action is required regarding these talk page notices, other than regular verification using the archive tool instructions below. Editors have permission to delete these "External links modified" talk page sections if they want to de-clutter talk pages, but see the RfC before doing mass systematic removals. This message is updated dynamically through the template {{source check}} (last update: 5 June 2024).

If you have discovered URLs which were erroneously considered dead by the bot, you can report them with this tool.
If you found an error with any archives or the URLs themselves, you can fix them with this tool.

Cheers.—InternetArchiveBot (Report bug) 08:04, 7 January 2018 (UTC)[reply]

Error in either english or french version

The english version of the wikipedia article states: "m is the sum of all of the edge weights in the graph"

The french version however, states that 2m is the sum of all edge weights in the graph.

Which one is correct? Teegeevee (talk) 11:13, 3 August 2022 (UTC)[reply]

The original Louvain paper cites [1]https://arxiv.org/abs/cond-mat/0407503 for the definition of Q. There is clearly writes near Eq.8: m ... is the number of edges in the graph. Omer. https://en.wikipedia.org/wiki/User:Omermar 11:23, 3 August 2022 (UTC) — Preceding unsigned comment added by Omermar (talk • contribs) [reply]