> > The 'polbooks' dataset has 105 nodes. An SBM with one block (B=1) has a DL > > of about 1550 bits. The DL is minimized (DL_min=1300) for B=5. When each > > node is in its own block (D=105), DL is maximized (DL_max=1950). Can't I > > make states of different graphs comparable by taking DL_min/DL_max? It > > seems like a straightforward application of normalized entropy > > (https://en.wikipedia.org/wiki/Entropy_(information_theory)#Efficiency_(normalized_entropy)) > > to me.
> It's difficult to comment, because I don't know what the objective of the > comparison is. > > If you compute the ratio of the minimum DL with the DL for B=1, this would > give you the compression ratio when compared to a baseline random graph model. > > If you compare this ratio between two networks of two different sizes, this > gives you an idea of how more random one is versus the other, when compared > to a fully random graph with the same density, but no deeper insight. My objective is to compare the extent to which given networks are in the ordered regime. In this sense, DL_min/DL_B=1 works because it measures the distance to disorder. Thx for the input Haiko _______________________________________________ graph-tool mailing list -- graph-tool@skewed.de To unsubscribe send an email to graph-tool-le...@skewed.de
