A tutorial on MDL hypothesis testing for graph analysis
Not on the map. Why?
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.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). First posted on arXiv 31 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1.
1 paper.
- 2021Finding Motifs in Knowledge Graphs using Compressioncited by 0
- 2021Finding Motifs in Knowledge Graphs using Compression16 Apr 2021