Home Wiki Blog Forum GEXF.net

Gephi forums

Community support

The randomness of the Modularity

Computing metrics, community detection and data handling

The randomness of the Modularity

Postby ticoalu » 21 Nov 2013 20:41

Other software and algorithm utilize random number "seed" generator acquire random number each time algorithma initialize in order to ensure (or rather simulate) randomness.

Does Gephi utilize random number generator when initializing the modularity algorithm? Since both Blondel community detection algorithm and the random walk time parameter (resolution) rely on greedy heuristic, I would like to know if Gephi will provide good randomness for each run when attempting to set up some kind of experiment.

Thanks in advance!
ticoalu
 
Posts: 13
Joined: 18 Jul 2013 18:46

Re: The randomness of the Modularity

Postby seinecle » 26 Nov 2013 14:47

Thanks for your comment.

Please register this issue in the issue tracker:
https://github.com/gephi/gephi/issues?state=open

Best,

Clement
http://www.clementlevallois.net
Gephi tutorials and personalized trainings: http://www.clementlevallois.net/training.html
Join the Gephi Facebook group for help and support: https://www.facebook.com/groups/gephi/
User avatar
seinecle
Gephi Community Support
 
Posts: 541
Joined: 08 Feb 2010 17:55
Location: Lyon, France


Return to Statistics, Clustering & Data Lab

Who is online

Users browsing this forum: No registered users and 1 guest

sports medicine portsmouth nh where to buy metronidazole