A tutorial on MDL hypothesis testing for graph analysis

10/31/2018
by   Peter Bloem, et al.
0

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.

READ FULL TEXT

page 2

page 3

page 4

page 5

page 6

page 7

page 8

research
05/20/2021

Minimax Robust Detection: Classic Results and Recent Advances

This paper provides an overview of results and concepts in minimax robus...
research
08/30/2020

Comment on Glenn Shafer's "Testing by betting"

This note is my comment on Glenn Shafer's discussion paper "Testing by b...
research
05/17/2017

Two-Sample Tests for Large Random Graphs Using Network Statistics

We consider a two-sample hypothesis testing problem, where the distribut...
research
04/06/2023

Improved Hardness of Approximating k-Clique under ETH

In this paper, we prove that assuming the exponential time hypothesis (E...
research
09/17/2023

ChainForge: A Visual Toolkit for Prompt Engineering and LLM Hypothesis Testing

Evaluating outputs of large language models (LLMs) is challenging, requi...
research
09/18/2018

Finding cliques using few probes

Consider algorithms with unbounded computation time that probe the entri...
research
09/22/2020

Efficiently Finding a Maximal Clique Summary via Effective Sampling

Maximal clique enumeration (MCE) is a fundamental problem in graph theor...

Please sign up or login with your details

Forgot password? Click here to reset