Hello again, Thanks for your important answer. This is indeed a very good example. Maybe I should clarify from the beginning that I am interested, in my current study, in single realizations of the network. Being the links of my system based on causalities, the importance here is in the flow across the links. And, as in the case of networks for information flows, the time-scale separation works perfect as separator in communities. So, *I will be interested in the same partition happening in any random graph with the same degree sequence*. In this sense, colors well represent the set of nodes densely connected in which I am interested in. Sorry for all this thread, maybe for you everything was trivial from the beginning but for me it has been a very didactic and now intuitive point regarding how community detection depends on the particularities of the problem of interest.
Thanks and Best Regards, Yérali. -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/Problem-with-the-partition-into-communities-tp4027132p4027156.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
