A tutorial on MDL hypothesis testing for graph analysis

TL;DR

This tutorial explains how to apply the MDL principle to complex graph analysis, illustrating the method with clique size estimation and discussing interpretation pitfalls.

Contribution

It provides a comprehensive tutorial on using MDL for graph hypothesis testing, including practical examples and interpretation guidance.

Findings

MDL can effectively analyze graph structures like clique sizes

The tutorial highlights common pitfalls in MDL-based graph analysis

Guidance on interpreting MDL results in complex graphs

Abstract

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.