Computing Distance-based metrics on Very Large Graphs

01/16/2023
by   Giambattista Amati, et al.
0

We propose PROPAGATE, a fast approximation framework to estimate distance-based metrics on very large graphs such as the (effective) diameter, the (effective) radius, or the average distance within a small error. The framework assigns seeds to nodes and propagates them in a BFS-like fashion, computing the neighbors set until we obtain either the whole vertex set (the diameter) or a given percentage (the effective diameter). At each iteration, we derive compressed Boolean representations of the neighborhood sets discovered so far. The PROPAGATE framework yields two algorithms: PROPAGATE-P, which propagates all the s seeds in parallel, and PROPAGATE-s which propagates the seeds sequentially. For each node, the compressed representation of the PROPAGATE-P algorithm requires s bits while that of PROPAGATE-S only 1 bit. Both algorithms compute the average distance, the effective diameter, the diameter, and the connectivity rate within a small error with high probability: for any ε>0 and using s=Θ(log n/ε^2) sample nodes, the error for the average distance is bounded by ξ = εΔ/α, the error for the effective diameter and the diameter are bounded by ξ = ε/α, and the error for the connectivity rate is bounded by ε where Δ is the diameter and α is a measure of connectivity of the graph. The time complexity is 𝒪(mΔlog n/ε^2), where m is the number of edges of the graph. The experimental results show that the PROPAGATE framework improves the current state of the art both in accuracy and speed. Moreover, we experimentally show that PROPAGATE-S is also very efficient for solving the All Pair Shortest Path problem in very large graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/23/2019

A story of diameter, radius and Helly property

A graph is Helly if every family of pairwise intersecting balls has a no...
research
08/30/2018

Maximum Eccentric Connectivity Index for Graphs with Given Diameter

The eccentricity of a vertex v in a graph G is the maximum distance betw...
research
04/25/2019

Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems

Some of the most fundamental and well-studied graph parameters are the D...
research
01/17/2018

The Complexity of Subdivision for Diameter-Distance Tests

We present a general framework for analyzing the complexity of subdivisi...
research
06/24/2020

Approximation of the Diagonal of a Laplacian's Pseudoinverse for Complex Network Analysis

The ubiquity of massive graph data sets in numerous applications require...
research
05/08/2018

Parallel Graph Connectivity in Log Diameter Rounds

We study graph connectivity problem in MPC model. On an undirected graph...
research
03/02/2023

Solving Distance-constrained Labeling Problems for Small Diameter Graphs via TSP

In this paper, we give a simple polynomial-time reduction of L(p)-Labeli...

Please sign up or login with your details

Forgot password? Click here to reset