Abstract
We analyze the performance of regular decomposition, a method for compression of large and dense graphs. This method is inspired by Szemerédi’s regularity lemma (SRL), a generic structural result of large and dense graphs. In our method, stochastic block model (SBM) is used as a model in maximum likelihood fitting to find a regular structure similar to the one predicted by SRL. Another ingredient of our method is Rissanen’s minimum description length principle (MDL). We consider scaling of algorithms to extremely large size of graphs by sampling a small subgraph. We continue our previous work on the subject by proving some experimentally found claims. Our theoretical setting does not assume that the graph is generated from a SBM. The task is to find a SBM that is optimal for modeling the given graph in the sense of MDL. This assumption matches with real-life situations when no random generative model is appropriate. Our aim is to show that regular decomposition is a viable and robust method for large graphs emerging, say, in Big Data area.
Original language | English |
---|---|
Pages (from-to) | 44-60 |
Journal | Data Science and Engineering |
Volume | 4 |
Issue number | 1 |
DOIs | |
Publication status | Published - 7 Mar 2019 |
MoE publication type | A1 Journal article-refereed |
Funding
This work was supported by the Academy of Finland Project 294763 Stomograph and by the ECSEL MegaMaRT2 Project. The research of Marianna Bolla was supported by the BME-Artificial Intelligence FIKP grant of EMMI (BME FIKP-MI/SC).
Keywords
- Community detection
- Consistency
- Martingales
- Sampling