Type Size Code for Compressing Erdös-Rényi Graphs

08/27/2020 ∙ by Nematollah Iri, et al. ∙ 0

We consider universal source coding of unlabeled graphs which are commonly referred to as graphical structures. We adopt an Erdös-Rényi 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 ϵ-coding rate of the Type Size code (up to the third-order term) for compressing graphical structures is derived.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.