Compression and Symmetry of Small-World Graphs and Structures

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and finally, given then structure and labeling, the contents of the labels can be described. Determining the amount of information present at each level and quantifying the degree of dependence between them, requires the study of symmetry, graph automorphism, entropy, and graph compressibility. In this paper, we focus on a class of small-world graphs. These are geometric random graphs where vertices are first connected to their nearest neighbors on a circle and then pairs of non-neighbors are connected according to a distance-dependent probability distribution. We establish the degree distribution of this model, and use it to prove the model's asymmetry in an appropriate range of parameters. Then we derive the relevant entropy and structural entropy of these random graphs, in connection with graph compression.

[1]  Wojciech Szpankowski,et al.  Structural complexity of random binary trees , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  Mark Newman,et al.  Models of the Small World , 2000 .

[3]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[4]  György Turán,et al.  On the succinct representation of graphs , 1984, Discret. Appl. Math..

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

[6]  Emmanuel Abbe,et al.  Graph compression: The effect of clusters , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Martin Sauerhoff Krengelstrasse.  On the Entropy of Models for the Web Graph , 2009 .

[8]  Silvio Lattanzi,et al.  Models for the Compressible Web , 2013, SIAM J. Comput..

[9]  Benny Sudakov,et al.  On the asymmetry of random regular graphs and random graphs , 2002, Random Struct. Algorithms.

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

[11]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks , 2016, Cambridge Series in Statistical and Probabilistic Mathematics.

[12]  Sergio Verdú,et al.  Optimal Lossless Data Compression: Non-Asymptotics and Asymptotics , 2014, IEEE Transactions on Information Theory.

[13]  Wojciech Szpankowski,et al.  Inferring Temporal Information from a Snapshot of a Dynamic Network , 2019, Scientific Reports.

[14]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

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

[16]  Ioannis Kontoyiannis.  Second-order noiseless source coding theorems , 1997, IEEE Trans. Inf. Theory.

[17]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[18]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[19]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[20]  Wojciech Szpankowski,et al.  Lossless Compression of Binary Trees With Correlated Vertex Names , 2018, IEEE Transactions on Information Theory.

[21]  Jeong Han Kim,et al.  Nearly perfect matchings in regular simple hypergraphs , 1997 .

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

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

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

[25]  Wojciech Szpankowski,et al.  Asymmetry and structural information in preferential attachment graphs , 2016, Random Struct. Algorithms.

[26]  E. Todeva.  Networks , 2007 .

[27]  T. Apostol.  An Elementary View of Euler's Summation Formula , 1999 .

[28]  Jie Zhang,et al.  A Universal Grammar-Based Code for Lossless Compression of Binary Trees , 2013, IEEE Transactions on Information Theory.

[29]  Torsten Hoefler,et al.  Survey and Taxonomy of Lossless Graph Compression and Space-Efficient Graph Representations , 2018, ArXiv.

[30]  Remco van der Hofstad,et al.  Random Graphs and Complex Networks: Volume 1 , 2016 .

[31]  T. Apostol.  Introduction to analytic number theory , 1976 .

[32]  Sergio Verdú,et al.  Compressing data on graphs with clusters , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[33]  Wojciech Szpankowski,et al.  Compression of Preferential Attachment Graphs , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[34]  Leonid Peshkin,et al.  Structure induction by lossless graph compression , 2007, 2007 Data Compression Conference (DCC'07).

[35]  Kevin Zhou.  Navigation in a small world , 2017 .

[36]  Chris Arney,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World (Easley, D. and Kleinberg, J.; 2010) [Book Review] , 2013, IEEE Technology and Society Magazine.

[37]  P. Hall,et al.  On the rate of Poisson convergence , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.

[38]  Sebastian Maneth,et al.  Grammar-Based Graph Compression , 2017, Inf. Syst..

[39]  Moni Naor.  Succinct representation of general unlabeled graphs , 1990, Discret. Appl. Math..