Quasi-Isometric Graph-Simplifications

We propose a general framework based on quasi-isometries to study graph simplifications. Quasiisometries are mappings on metric spaces that preserve the distance functions within an additive and a multiplicative constant. We use them to measure the distance distortion between the original graph and the simplified graph. We also introduce a novel concept called the centre-shift, which quantifies how much a graph simplification affects the location of the graph centre. Given a quasi-isometry, we establish a weak upper bound on the centre-shift. We present methods to construct so-called partition-graphs, which are quasi-isometric graph simplifications. Furthermore, in terms of the centre-shift, we show that partition-graphs constructed in a certain way preserve the centres of trees. Finally, we also show that by storing extra numerical information, partition-graphs preserve the median of trees. 2012 ACM Subject Classification Mathematics of computing—Graph algorithms

[1]  Nisheeth Shrivastava,et al.  Graph summarization with bounded error , 2008, SIGMOD Conference.

[2]  Max Klimm,et al.  Distance-preserving graph contractions , 2018, ITCS.

[3]  Hema Raghavan,et al.  SWeG: Lossless and Lossy Summarization of Web-Scale Graphs , 2019, WWW.

[4]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.

[5]  Edith Cohen,et al.  Reachability and distance queries via 2-hop labels , 2002, SODA '02.

[6]  Fang Zhou,et al.  Compression of weighted graphs , 2011, KDD.

[7]  Kun-Mao Chao,et al.  Spanning trees and optimization problems , 2004, Discrete mathematics and its applications.

[8]  Andrew V. Goldberg,et al.  Route Planning in Transportation Networks , 2015, Algorithm Engineering.

[9]  T. Hoefler,et al.  Slim graph: practical lossy graph compression for approximate graph processing, storage, and analytics , 2019, SC.

[10]  Rögnvaldur G. Möller,et al.  Quasi-isometries between graphs and trees , 2008, J. Comb. Theory, Ser. B.

[11]  Toru Takisaka,et al.  Large scale geometries of infinite strings , 2017, 2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS).

[12]  A. J. Goldman.  Optimal Center Location in Simple Networks , 1971 .

[13]  David R. Karger,et al.  Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs , 2002, SIAM J. Comput..

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

[15]  Jose Augusto Ramos Soares,et al.  Graph Spanners: a Survey , 1992 .

[16]  M. Gromov.  Groups of polynomial growth and expanding maps , 1981 .

[17]  P. Slater.  Locating Central Paths in a Graph , 1982 .

[18]  S. L. Hakimi,et al.  Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .

[19]  M. Gromov.  Geometric group theory, Vol. 2: Asymptotic invariants of infinite groups , 1996 .

[20]  Santosh S. Vempala,et al.  On clusterings-good, bad and spectral , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[21]  Claudio Gutierrez,et al.  Survey of graph database models , 2008, CSUR.