Regular decomposition of large graphs and other structures: scalability and robustness towards missing data [article]

Hannu Reittu, Ilkka Norros, Fülöp Bazsó
2017 arXiv   pre-print
A method for compression of large graphs and matrices to a block structure is further developed. Szemer\'edi's regularity lemma is used as a generic motivation of the significance of stochastic block models. Another ingredient of the method is Rissanen's minimum description length principle (MDL). We continue our previous work on the subject, considering cases of missing data and scaling of algorithms to extremely large size of graphs. In this way it would be possible to find out a large scale
more » ... tructure of a huge graphs of certain type using only a tiny part of graph information and obtaining a compact representation of such graphs useful in computations and visualization.
arXiv:1711.08629v1 fatcat:foj52rbyu5g3jflxk2i6krb5gi