New question #147488 on Gephi: https://answers.launchpad.net/gephi/+question/147488
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? -- You received this question notification because you are a member of Gephi Team, which is an answer contact for Gephi. _______________________________________________ Mailing list: https://launchpad.net/~gephi.team Post to : [email protected] Unsubscribe : https://launchpad.net/~gephi.team More help : https://help.launchpad.net/ListHelp
