Pruning based Distance Sketches with Provable Guarantees on Random Graphs release_tgcg5i3qzjaxhna2m2onh4uyki

by Hongyang Zhang, Huacheng Yu, Ashish Goel

Released as a article .

2019  

Abstract

Measuring the distances between vertices on graphs is one of the most fundamental components in network analysis. Since finding shortest paths requires traversing the graph, it is challenging to obtain distance information on large graphs very quickly. In this work, we present a preprocessing algorithm that is able to create landmark based distance sketches efficiently, with strong theoretical guarantees. When evaluated on a diverse set of social and information networks, our algorithm significantly improves over existing approaches by reducing the number of landmarks stored, preprocessing time, or stretch of the estimated distances. On Erdös-Rényi graphs and random power law graphs with degree distribution exponent 2 < β < 3, our algorithm outputs an exact distance data structure with space between Θ(n^5/4) and Θ(n^3/2) depending on the value of β, where n is the number of vertices. We complement the algorithm with tight lower bounds for Erdos-Renyi graphs and the case when β is close to two.
In text/plain format

Archived Files and Locations

application/pdf  499.6 kB
file_ibzo5a7pjbaohh6xemty3lwoa4
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2019-02-10
Version   v3
Language   en ?
arXiv  1712.08709v3
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: f00dda3c-0cbc-4b9c-94d0-152da7514604
API URL: JSON