Universal Lossless Compression of Graphical Data
Payam Delgosha, Venkat Anantharam

TL;DR
This paper introduces a universal lossless compression scheme for graphical data, applicable across various domains, and proves its optimality using a framework based on local weak convergence and entropy generalization.
Contribution
It develops a universal compression algorithm for marked graphs using the local weak convergence framework and generalizes entropy concepts for such graphs.
Findings
The proposed scheme is proven to be universally optimal.
It can perform local data queries directly on compressed data.
The method applies to diverse graphical data sources.
Abstract
Graphical data is comprised of a graph with marks on its edges and vertices. The mark indicates the value of some attribute associated to the respective edge or vertex. Examples of such data arise in social networks, molecular and systems biology, and web graphs, as well as in several other application areas. Our goal is to design schemes that can efficiently compress such graphical data without making assumptions about its stochastic properties. Namely, we wish to develop a universal compression algorithm for graphical data sources. To formalize this goal, we employ the framework of local weak convergence, also called the objective method, which provides a technique to think of a marked graph as a kind of stationary stochastic processes, stationary with respect to movement between vertices of the graph. In recent work, we have generalized a notion of entropy for unmarked graphs in this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
