Statistics: sub-optimal modularity

Bug #727701 reported by Sébastien Heymann on 2011-03-02
This bug affects 1 person
Affects Status Importance Assigned to Milestone
Fix Released
Thomas Aynaud

Bug Description

I have some doubts about the modularity optimisation algorithm that is currently used.
In the wiki, it is stated to be the Louvain algorithm, but the results provided by Gephi often produce lower quality results than the python or matlab code provided online.
for sure, the results can always vary depending on the initial order of encoding of the entries, but even for small graphs with trivial community structure, the algorithm returns suboptimal results.

Does the method implemented in Gephi differ from the original method?

Related branches

tags: added: modularity statistics
Changed in gephi:
milestone: none → 0.7beta
Changed in gephi:
status: New → Incomplete
Changed in gephi:
status: Incomplete → Confirmed
importance: Undecided → High

Fix on rev 2222

Changed in gephi:
assignee: nobody → Thomas Aynaud (taynaud)
status: Confirmed → Fix Committed

Deployed on Update Center

Changed in gephi:
status: Fix Committed → Fix Released
To post a comment you must log in.
This report contains Public information  Edit
Everyone can see this information.

Other bug subscribers

Related questions