DeepAI AI Chat
Log In Sign Up

Fast approximation of centrality and distances in hyperbolic graphs

by   Victor Chepoi, et al.
Kent State University
Young’s fringes pattern obtained at 80 kV showing a point

We show that the eccentricities (and thus the centrality indices) of all vertices of a δ-hyperbolic graph G=(V,E) can be computed in linear time with an additive one-sided error of at most cδ, i.e., after a linear time preprocessing, for every vertex v of G one can compute in O(1) time an estimate ê(v) of its eccentricity ecc_G(v) such that ecc_G(v)≤ê(v)≤ ecc_G(v)+ cδ for a small constant c. We prove that every δ-hyperbolic graph G has a shortest path tree, constructible in linear time, such that for every vertex v of G, ecc_G(v)≤ ecc_T(v)≤ ecc_G(v)+ cδ. These results are based on an interesting monotonicity property of the eccentricity function of hyperbolic graphs: the closer a vertex is to the center of G, the smaller its eccentricity is. We also show that the distance matrix of G with an additive one-sided error of at most c'δ can be computed in O(|V|^2^2|V|) time, where c'< c is a small constant. Recent empirical studies show that many real-world graphs (including Internet application networks, web networks, collaboration networks, social networks, biological networks, and others) have small hyperbolicity. So, we analyze the performance of our algorithms for approximating centrality and distance matrix on a number of real-world networks. Our experimental results show that the obtained estimates are even better than the theoretical bounds.


page 1

page 2

page 3

page 4


Eccentricity terrain of δ-hyperbolic graphs

A graph G=(V,E) is δ-hyperbolic if for any four vertices u,v,w,x, the tw...

Eccentricity function in distance-hereditary graphs

A graph G = (V,E) is distance hereditary if every induced path of G is a...

Fast deterministic algorithms for computing all eccentricities in (hyperbolic) Helly graphs

A graph is Helly if every family of pairwise intersecting balls has a no...

Distance problems within Helly graphs and k-Helly graphs

The ball hypergraph of a graph G is the family of balls of all possible ...

Perturb and Combine to Identify Influential Spreaders in Real-World Networks

Recent research has shown that graph degeneracy algorithms, which decomp...

Discrete Hyperbolic Random Graph Model

The hyperbolic random graph model (HRG) has proven useful in the analysi...

Hyperbolic grids and discrete random graphs

We present an efficient algorithm for computing distances in hyperbolic ...