26 citations · 35 across the 10 of their papers we have counts for
5 papers · 1 filter
A Universal Low Complexity Compression Algorithm for Sparse Marked Graphs
Payam Delgosha, Venkat Anantharam
Many modern applications involve accessing and processing graphical data, i.e. data that is naturally indexed by graphs. Examples come from internet graphs, social networks, genomi…
A Universal Lossless Compression Method applicable to Sparse Graphs and Heavy-Tailed Sparse Graphs
Payam Delgosha, Venkat Anantharam
Graphical data arises naturally in several modern applications, including but not limited to internet graphs, social networks, genomics and proteomics. The typically large size of…
A Notion of Entropy for Stochastic Processes on Marked Rooted Graphs
Payam Delgosha, Venkat Anantharam
In this document, we introduce a notion of entropy for stochastic processes on marked rooted graphs. For this, we employ the framework of local weak limit theory for sparse marked…
Distributed Compression of Graphical Data
Payam Delgosha, Venkat Anantharam
In contrast to time series, graphical data is data indexed by the vertices and edges of a graph. Modern applications such as the internet, social networks, genomics and proteomics…
Information Theoretic cutting of a cake
Payam Delgosha, Amin Gohari
Cutting a cake is a metaphor for the problem of dividing a resource (cake) among several agents. The problem becomes non-trivial when the agents have different valuations for diffe…