On lossy Compression of Directed Graphs

The method of types presented by Csiszár and Körner is a central tool used to develop and analyze the basic properties and constraints on sequences of data over finite alphabets. A central problem considered using these tools is that of data compression, and specifically lossy data compression. In this work we consider this very problem, however, instead of sequences of data we consider directed graphs. We show that given a more natural distortion measure, fitting the data structure of a directed graph, the method of types cannot be applied. The suggested distortion measure aims to preserves the local structure of a directed graph. We build on the recent work of Barvinok and extend the method of types to the two dimensional setting of directed graphs. We see that the extension is quite natural in many ways. Given this extension we provide a lower and upper bound on the rate-distortion problem of lossy compression given the suggested distortion measure.

[1]  R. Brualdi.  Matrices of zeros and ones with fixed row and column sum vectors , 1980 .

[2]  Micah Adler,et al.  Towards compressing Web graphs , 2001, Proceedings DCC 2001. Data Compression Conference.

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Silvio Lattanzi,et al.  On compressing social networks , 2009, KDD.

[5]  Allan Sly,et al.  Random graphs with a given degree sequence , 2010, 1005.1136.

[6]  A. Barvinok.  On the number of matrices and a random matrix with prescribed row and column sums and 0–1 entries☆ , 2008, 0806.1480.

[7]  D. Gale.  A theorem on flows in networks , 1957 .

[8]  Ronit Bustin,et al.  On lossy compression of binary matrices , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[9]  Marcello Pelillo,et al.  A matrix factorization approach to graph compression with partial information , 2015, Int. J. Mach. Learn. Cybern..

[10]  Tatsuya Akutsu,et al.  Comparing biological networks via graph compression , 2010, BMC Systems Biology.

[11]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[12]  Imre Csiszár,et al.  Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition , 2011 .

[13]  Wojciech Szpankowski,et al.  Compression of Graphical Structures: Fundamental Limits, Algorithms, and Experiments , 2012, IEEE Transactions on Information Theory.

[14]  Venkat Anantharam,et al.  Universal lossless compression of graphical data , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[15]  Alberto Apostolico,et al.  Graph Compression by BFS , 2009, Algorithms.

[16]  Torsten Suel,et al.  Compressing the graph structure of the Web , 2001, Proceedings DCC 2001. Data Compression Conference.

[17]  David J. Aldous,et al.  ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES , 2014, Probability in the Engineering and Informational Sciences.

[18]  Mehryar Mohri,et al.  Automata and graph compression , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[19]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

[20]  H. J. Ryser,et al.  Matrices of zeros and ones , 1960 .

[21]  Alexander I. Barvinok,et al.  The number of graphs and a random graph with a given degree sequence , 2010, Random Struct. Algorithms.

[22]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[23]  Jianguo Qian,et al.  On the upper bound of the diameter of interchange graphs , 1999, Discret. Math..