Pruning based Distance Sketches with Provable Guarantees on Random Graphs
Hongyang Zhang, Huacheng Yu, Ashish Goel

TL;DR
This paper introduces an efficient preprocessing algorithm for creating landmark-based distance sketches on large graphs, providing strong theoretical guarantees and improved practical performance over existing methods.
Contribution
It presents a novel landmark-based distance sketching algorithm with provable guarantees and demonstrates its effectiveness on various real-world and random graph models.
Findings
Reduces number of landmarks needed for accurate distance estimation
Achieves faster preprocessing times compared to previous approaches
Provides tight theoretical bounds for Erdős-Rényi and power law graphs
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\"{o}s-R\'{e}nyi graphs and random power law graphs with degree distribution exponent , our algorithm outputs an exact distance data structure with space between and depending on the value of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Topological and Geometric Data Analysis · Data Management and Algorithms
