Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1909.09844

Universal Lossless Compression of Graphical Data

Payam Delgosha·Venkat Anantharam
View original source ↗Read source document ↗Export metadata ↓

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 framework, due to Bordenave and Caputo, to the case of marked graphs. We use this notion to evaluate the efficiency of a compression scheme. The lossless compression scheme we propose in this paper is then proved to be universally optimal in a precise technical sense. It is also capable of performing local data queries in the compressed form.

Explore related subjects

math.PRcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Payam Delgosha, Venkat Anantharam. 2019-09-21. Universal Lossless Compression of Graphical Data. https://arxiv.org/abs/1909.09844

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Resolvent convergence under heterogeneous second-moment profiles and quadratic-form control

Let $X=(x_1,\ldots,x_n)\in\mathbb R^{p\times n}$ have independent real columns with finite second moments, not necessarily centered or identically distributed. For $z\in\mathbb C\setminus[0,\infty)$, we compare \[ G^z=\left(\frac1nXX^\top-zI_p\right)^{-1} \] with a deterministic matrix $\tilde G^z$ defined by the second-moment profile $(Σ_i)_{i\in[n]}$, where $Σ_i=\mathbb E[x_ix_i^\top]$. We prove finite-dimensional $L^q$ bounds for $\text{tr}(A(G^z-\tilde G^z))$ in terms of moments of centered quadratic forms, without assuming independence among the coordinates of a column. Operator-test bounds impose no trace-growth or aspect-ratio restriction and display explicitly the effect of the sizes and repetitions of the second-moment matrices $(Σ_i)_{i\in[n]}$. Under $\sqrt p\sup_{i\in[n]}|Σ_i|_{\text{HS}}=O(n)$, Hilbert--Schmidt-test bounds allow the heterogeneity of the profile to be controlled through approximation by commuting positive-semidefinite matrices. Additive deformations also yield deterministic equivalents for resolvent sandwiches. All bounds are locally uniform away from $[0,\infty)$.

math.PR↗
arXiv2026

Unique continuation properties for the continuous Anderson operator in dimension 2

We consider singular continuous Anderson operators $H=-Δ+ξ$ on the one and two dimensional tori, and prove the strong unique continuation property for their eigenfunctions. The proof uses a ground-state transform to rewrite the eigenvalue equation in divergence form with a Hölder-continuous coefficient, then combines a Carleman estimate in dimension one with a Beltrami equation and Ahlfors Bers factorization in dimension two. This planar approach further shows that the nodal set of an eigenfunction is locally the quasiconformal image of the zero set of a harmonic function, yielding a Courant-type nodal domain theorem. In dimension one, we upgrade unique continuation into a quantitative spectral inequality which, through the Lebeau Robbiano method, gives exact null controllability of the associated parabolic equation from any open subset of the torus.

math.PR↗
arXiv2026

Finite Free Information Inequalities

We develop finite free information theory for real-rooted polynomials, establishing finite free analogues of entropy and Fisher information monotonicity, as well as the Stam and entropy power inequalities. These results resolve conjectures by Shlyakhtenko and Gribinski and recover inequalities in free probability in the large-degree limit. Equivalently, our results may be interpreted as potential-theoretic inequalities for the zeros of real-rooted polynomials under differential operators which preserve real-rootedness. Our proofs leverage a new connection between score vectors and Jacobians of root maps, combined with convexity results for hyperbolic polynomials. We further characterize the equality cases in our inequalities, which arise from Hermite polynomials.

math.PR↗