This document provides a tutorial description of the use of the MDL principle in complex graph analysis. We give a brief summary of the preliminary subjects, and describe the basic principle, using the example of analysing the size of the largest clique in a graph. We also provide a discussion of how to interpret the results of such an analysis, making note of several common pitfalls.
Cite
@article{arxiv.1810.13163,
title = {A tutorial on MDL hypothesis testing for graph analysis},
author = {Peter Bloem and Steven de Rooij},
journal= {arXiv preprint arXiv:1810.13163},
year = {2018}
}
Comments
arXiv admin note: text overlap with arXiv:1701.02026