Hi, thank you very much for both answers. This is how science works. My problem with the SBM is that the maximization of internal density is not a desired condition for the separation into blocks. The pattern is very clear in the partition of my figure (without degree correlation), where the nodes of the same colors are connected with the other colors in an equivalent way, but far from being a community. For example, in causality-based networks to know the set of vertex where some flow can be trapped makes sense. The same applies in the case of information flow. I think the network in my figure can be suitably partitioned into communities without being simply noise.
Maybe this is a good example for the affirmation of that there is not (yet) a perfect method to detect communities in all kinds of networks. In this sense, I would rather think in the direction of that a partitioning has not a unique and “right” solution. Best, 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-tp4027132p4027146.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
