DeepAI AI Chat
Log In Sign Up

A Parallel PageRank Algorithm For Undirected Graph

by   Qi Zhang, et al.

PageRank is a fundamental property of graph and there have been plenty of PageRank algorithms. Generally, we consider undirected graph as a complicated directed graph. However, some properties of undirected graph, such as symmetry, are ignored when computing PageRank by existing algorithms. In this paper, we propose a parallel PageRank algorithm which is specially for undirected graph. We first demonstrate that the PageRank vector can be viewed as a linear combination of eigenvectors of probability transition matrix and the corresponding coefficients are the functions of eigenvalues. Then we introduce the Chebyshev polynomial approximation by which PageRank vector can be computed iteratively. Finally, we propose the parallel PageRank algorithm as the Chebyshev polynomial approximating algorithm(CPAA). Experimental results show that CPAA only takes 60 least 4 times faster than the power method.


page 1

page 2

page 3

page 4


The game of Cops and Robbers on directed graphs with forbidden subgraphs

The traditional game of cops and robbers is played on undirected graph. ...

Generalized Tilings with Height Functions

In this paper, we introduce a generalization of a class of tilings which...

Accelerating Personalized PageRank Vector Computation

Personalized PageRank Vectors are widely used as fundamental graph-learn...

Nearly Work-Efficient Parallel DFS in Undirected Graphs

We present the first parallel depth-first search algorithm for undirecte...

A Junction Tree Framework for Undirected Graphical Model Selection

An undirected graphical model is a joint probability distribution define...

An Advanced Parallel PageRank Algorithm

Initially used to rank web pages, PageRank has now been applied in many ...

Lasserre Integrality Gaps for Graph Spanners and Related Problems

There has been significant recent progress on algorithms for approximati...