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

06/24/2020
by   Eugenio Angriman, et al.
0

The ubiquity of massive graph data sets in numerous applications requires fast algorithms for extracting knowledge from these data. We are motivated here by three electrical measures for the analysis of large small-world graphs G = (V, E) – i.e., graphs with diameter in O(log |V|), which are abundant in complex network analysis. From a computational point of view, the three measures have in common that their crucial component is the diagonal of the graph Laplacian's pseudoinverse, L^†. Computing diag(L^†) exactly by pseudoinversion, however, is as expensive as dense matrix multiplication – and the standard tools in practice even require cubic time. Moreover, the pseudoinverse requires quadratic space – hardly feasible for large graphs. Resorting to approximation by, e.g., using the Johnson-Lindenstrauss transform, requires the solution of O(log |V| / ϵ^2) Laplacian linear systems to guarantee a relative error, which is still very expensive for large inputs. In this paper, we present a novel approximation algorithm that requires the solution of only one Laplacian linear system. The remaining parts are purely combinatorial – mainly sampling uniform spanning trees, which we relate to diag(L^†) via effective resistances. For small-world networks, our algorithm obtains a ±ϵ-approximation with high probability, in a time that is nearly-linear in |E| and quadratic in 1 / ϵ. Another positive aspect of our algorithm is its parallel nature due to independent sampling. We thus provide two parallel implementations of our algorithm: one using OpenMP, one MPI + OpenMP. In our experiments against the state of the art, our algorithm (i) yields more accurate results, (ii) is much faster and more memory-efficient, and (iii) obtains good parallel speedups, in particular in the distributed setting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2023

A Simple and Efficient Parallel Laplacian Solver

A symmetric matrix is called a Laplacian if it has nonpositive off-diago...
research
10/24/2019

Scaling Betweenness Approximation to Billions of Edges by MPI-based Adaptive Sampling

Betweenness centrality is one of the most popular vertex centrality meas...
research
01/16/2023

Computing Distance-based metrics on Very Large Graphs

We propose PROPAGATE, a fast approximation framework to estimate distanc...
research
01/15/2021

New Approximation Algorithms for Forest Closeness Centrality – for Individual Vertices and Vertex Groups

The emergence of massive graph data sets requires fast mining algorithms...
research
11/08/2020

Tight Conditional Lower Bounds for Approximating Diameter in Directed Graphs

Among the most fundamental graph parameters is the Diameter, the largest...
research
01/20/2021

Fast Evaluation for Relevant Quantities of Opinion Dynamics

One of the main subjects in the field of social networks is to quantify ...
research
03/12/2016

Laplacian Eigenmaps from Sparse, Noisy Similarity Measurements

Manifold learning and dimensionality reduction techniques are ubiquitous...

Please sign up or login with your details

Forgot password? Click here to reset