Hello, I'm testing the new Planted Partition model in graph-tool on my data, indeed I'm finding interesting results. I have some questions/observations, though. - PPBlockState returns a relatively large number of partitions on large networks, which is fine and expected. When I use NSBM, instead, I make use of the hierarchy not only because I can "abstract" partitions up to a certain level, but also because the hierarchy has a meaning in my case. Is there (or will it be there) a hierarchical formulation of the PPBlockState? - I tried multiple initialisations of PPBlockState over my graph, I also tried to increase the iterations of the initial MCMC sweep and I'd say I get very consistent results. Is this expected? I mean, is it known if the PPBlockState converges to a stable solution faster and in a consistent way? - Does the time required to converge scales with the number of edges as it does for SBM? - As far as I understand, if the assortativity is the dominant pattern the difference between PP and NSBM is negligible. I don't know how to quantify "negligible" as the differences in entropies are at least in the order of 1e2 in the cases I tested (seems pretty large to me); I would be happy to switch to PP, also given the shorter runtime so far, but I'm a bit concerned about these differences.
Best d _______________________________________________ graph-tool mailing list [email protected] https://lists.skewed.de/mailman/listinfo/graph-tool
