A tutorial on MDL hypothesis testing for graph analysis

Peter Bloem, Steven de Rooij

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.

Knowledge Graph



Sign up or login to leave a comment