Distributed Compression of Graphical Data

02/21/2018
by   Payam Delgosha, et al.
0

In contrast to time series, graphical data is data indexed by the nodes and edges of a graph. Modern applications such as the internet, social networks, genomics and proteomics generate graphical data, often at large scale. The large scale argues for the need to compress such data for storage and subsequent processing. Since this data might have several components available in different locations, it is also important to study distributed compression of graphical data. In this paper, we derive a rate region for this problem which is a counterpart of the Slepian-Wolf Theorem. We characterize the rate region when the statistical description of the distributed graphical data is one of two types - a marked sparse Erdos-Renyi ensemble or a marked configuration model. Our results are in terms of a generalization of the notion of entropy introduced by Bordenave and Caputo in the study of local weak limits of sparse graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/18/2021

A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs

Graphical data arises naturally in several modern applications, includin...
research
01/13/2023

A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs

Many modern applications involve accessing and processing graphical data...
research
09/21/2019

Universal Lossless Compression of Graphical Data

Graphical data is comprised of a graph with marks on its edges and verti...
research
09/17/2021

Graphical models for nonstationary time series

We propose NonStGGM, a general nonparametric graphical modeling framewor...
research
09/24/2021

Distributed Estimation of Sparse Inverse Covariances

Learning the relationships between various entities from time-series dat...
research
08/02/2019

A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs

In this document, we introduce a notion of entropy for stochastic proces...
research
11/15/2021

AutoGMap: Learning to Map Large-scale Sparse Graphs on Memristive Crossbars

The sparse representation of graphs has shown its great potential for ac...

Please sign up or login with your details

Forgot password? Click here to reset