Type Size Code for Compressing Erd\"os-R\'enyi Graphs

TL;DR

This paper introduces a novel Type Size coding scheme for efficiently compressing unlabeled Erd"os-Rényi graphs by classifying graphs based on their number of edges and analyzing the coding rate.

Contribution

It proposes a new variant of the Type Size code tailored for Erd"os-Rényi graphs, providing a detailed analysis of its $\

Findings

Derives the $\

Provides the $\

Abstract

We consider universal source coding of unlabeled graphs which are commonly referred to as graphical structures. We adopt an Erd\"{o}s-R\'enyi model to generate the random graphical structures. We propose a variant of the previously introduced Type Size code, where type classes are characterized based on the number of edges of the graphical structures. The proposed scheme sorts the graphical structures based on the size of their type classes and assigns binary sequences to them in this order. The $\epsilon$-coding rate of the Type Size code (up to the third-order term) for compressing graphical structures is derived.