Differential blocks between graphs
Hello all, I was wondering if (and possibly how) graph-tool could be used to identify differential blocks across given graphs. More specifically, if two graph have the same nodes, is it possible to identify the sets of partitions that are blocks in one graph but not the other? Would it suffice to identify partitions in both graphs and then check for the differences? Thanks d
Am 30.06.22 um 13:35 schrieb Davide Cittaro:
Hello all, I was wondering if (and possibly how) graph-tool could be used to identify differential blocks across given graphs. More specifically, if two graph have the same nodes, is it possible to identify the sets of partitions that are blocks in one graph but not the other? Would it suffice to identify partitions in both graphs and then check for the differences?
I'm not sure I completely understand. What do you mean by one block being in one graph, and not in the other? Could you give an example? -- Tiago de Paula Peixoto <tiago@skewed.de>
On 30 Jun 2022, at 22:09, Tiago de Paula Peixoto <tiago@skewed.de> wrote:
I'm not sure I completely understand. What do you mean by one block being in one graph, and not in the other? Could you give an example?
I was thinking this https://arxiv.org/pdf/2006.05176.pdf but with a principled formulation based on SBM. Is that even possible? Just curious… d
Am 30.06.22 um 22:21 schrieb Davide Cittaro:
I was thinking this
https://arxiv.org/pdf/2006.05176.pdf <https://arxiv.org/pdf/2006.05176.pdf>
but with a principled formulation based on SBM. Is that even possible? Just curious…
There is nothing yet in graph-tool about graph classification, unfortunately! Hopefully in the future... Best, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>
participants (2)
-
Davide Cittaro -
Tiago de Paula Peixoto