Distance Labelings on Random Power Law Graphs

12/23/2017
by   Huacheng Yu, et al.
0

A Distance Labeling scheme is a data structure that can answer shortest path queries on a graph. Experiment results from several recent studies (Akiba et al.'13, Delling et al.'14) found very efficient and very accurate labeling schemes, which scale to social and information networks with tens of millions of vertices and edges. Such a finding is not expected in the worst case, since even for graphs with maximum degree 3, it is known that any distance labeling requires Ω(n^3/2) space (Gavoille et al.'03). On the other hand, social and information networks have a heavy-tailed degree distribution and small average distance, which are not captured in the worst case. In this paper, we fill in the gap between empirical and worst case results. We consider distance labeling schemes on random graph models with a power law degree distribution. For such graphs, we show that simple breadth-first-search based algorithm can find near optimal labeling schemes. The intuition behind our proof reveals that the distances between different pairs of vertices are almost independent, even for polynomially many pairs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/30/2020

Truly Subquadratic Exact Distance Oracles with Constant Query Time for Planar Graphs

Given an undirected, unweighted planar graph G with n vertices, we prese...
research
07/28/2020

Distance labeling schemes for K_4-free bridged graphs

k-Approximate distance labeling schemes are schemes that label the verti...
research
02/13/2023

A simple statistic for determining the dimensionality of complex networks

Detecting the dimensionality of graphs is a central topic in machine lea...
research
12/29/2017

Optimal Lower Bounds for Sketching Graph Cuts

We study the space complexity of sketching cuts and Laplacian quadratic ...
research
07/16/2019

Labelings vs. Embeddings: On Distributed Representations of Distances

We investigate for which metric spaces the performance of distance label...
research
07/31/2020

Compression and Symmetry of Small-World Graphs and Structures

For various purposes and, in particular, in the context of data compress...
research
05/01/2020

We Need to Talk About Random Splits

Gorman and Bedrick (2019) recently argued for using random splits rather...

Please sign up or login with your details

Forgot password? Click here to reset