Graph Compression with Side Information at the Decoder

In this paper, we study the problem of graph compression with side information at the decoder. The focus is on the situation when an unlabelled graph (which is also referred to as a structure) is to be compressed or is available as side information. For correlated Erd\H{o}s-R\'enyi weighted random graphs, we give a precise characterization of the smallest rate at which a labelled graph or its structure can be compressed with aid of a correlated labelled graph or its structure at the decoder. We approach this problem by using the entropy-spectrum framework and establish some convergence results for conditional distributions involving structures, which play a key role in the construction of an optimal encoding and decoding scheme. Our proof essentially uses the fact that, in the considered correlated Erd\H{o}s-R\'enyi model, the structure retains most of the information about the labelled graph. Furthermore, we consider the case of unweighted graphs and present how the optimal decoding can be done using the notion of graph alignment.Comment: 21 pages, 2 figures, submitted to the IEEE Journal on Selected Areas in Information Theor