# A tutorial on MDL hypothesis testing for graph analysis

arXiv: https://arxiv.org/abs/1810.13163 · HTML: https://mlsanity.com/paper/1810.13163/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 31 Oct 2018.

## Built on by (most cited first, 1 of 1)

- [Finding Motifs in Knowledge Graphs using Compression](https://mlsanity.com/paper/2104.08163/) (2021)

## Abstract (arXiv)

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.