# A note on the PageRank of undirected graphs

@article{Grolmusz2015ANO, title={A note on the PageRank of undirected graphs}, author={Vince Grolmusz}, journal={Inf. Process. Lett.}, year={2015}, volume={115}, pages={633-634} }

The PageRank is a widely used scoring function of networks in general and of the World Wide Web graph in particular. The PageRank is defined for directed graphs, but in some special cases applications for undirected graphs occur. In the literature it is widely - but not exclusively - noted that the PageRank for undirected graphs is proportional to the degrees of the vertices of the graph. We prove that statement for a particular personalization vector in the definition of the PageRank, and we… Expand

#### Topics from this paper

#### 55 Citations

Fast distributed PageRank computation

- Computer Science
- Theor. Comput. Sci.
- 2015

This paper presents fast random walk-based distributed algorithms for computing PageRanks in general graphs and proves strong bounds on the round complexity, believed to be the first fully distributed algorithms to be designed with provably efficient running time. Expand

A Study of PageRank in Undirected Graphs

- Mathematics
- 2019

The PageRank (PR) algorithm is the base of Google search engine. In this paper, we study the PageRank sequence for undirected graphs of order six by PR vector. Then, we provide an ordering for graphs… Expand

Graph Similarity Using PageRank and Persistent Homology

- Computer Science, Mathematics
- ArXiv
- 2020

This work utilizes the PageRank function on the lower-star filtration of the graph as input to persistent homology to study the problem of graph similarity by representing each graph as a persistence diagram and comparing outputs using the bottleneck distance. Expand

Bidirectional PageRank Estimation: From Average-Case to Worst-Case

- Computer Science, Mathematics
- WAW
- 2015

This work shows how the reversibility of random walks on undirected networks can be exploited to convert average-case to worst-case guarantees, and discusses how to modify the methods to estimate random-walk probabilities for any length distribution, thereby obtaining fast algorithms for estimating general graph diffusions. Expand

Efficient Algorithms for Personalized PageRank

- Mathematics, Computer Science
- ArXiv
- 2015

A new bidirectional algorithm which combines linear algebra and Monte Carlo to achieve significant speed improvements is presented, which is 70x faster than past state-of-the-art algorithms. Expand

Equal Opportunity for Low-Degree Network Nodes: A PageRank-Based Method for Protein Target Identification in Metabolic Graphs

- Biology, Medicine
- PloS one
- 2013

A novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties is shown. Expand

The Multiple Instances of Node Centrality and their Implications on the Vulnerability of ISP Networks

- Computer Science
- ArXiv
- 2013

This paper carries out a correlation study to assess the consistency of the node rankings those indices generate over ISP router-level topologies and results confirm that the top- k overlap predicts the comparative impact of indices on the network vulnerability better than the full-ranking correlation. Expand

Fast Distributed PageRank Computation

- Computer Science
- ICDCN
- 2013

This work designs provably efficient fully-distributed algorithms for computing PageRank using traditional matrix-vector multiplication style iterative methods, which may not always adapt well to the distributed setting owing to communication bandwidth restrictions and convergence rates. Expand

Centrality Measures in Complex Networks: A Survey

- Computer Science
- ArXiv
- 2020

This survey discusses the extension of centrality measures to different types of networks, methods to update centrality values in dynamic networks, method to identify top-k nodes, approximation algorithms, open research problems related to the domain, and so on. Expand

The Frequent Network Neighborhood Mapping of the human hippocampus shows much more frequent neighbor sets in males than in females

- Computer Science, Biology
- PloS one
- 2020

The new method of the Frequent Network Neighborhood Mapping for the connectome, which serves as a robust identification of the neighborhoods of given vertices of special interest in the graph, is introduced and strong statistical asymmetries between the connectomes of the sexes are discovered. Expand

#### References

SHOWING 1-10 OF 20 REFERENCES

Local Graph Partitioning using PageRank Vectors

- Mathematics, Computer Science
- 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
- 2006

An improved algorithm for computing approximate PageRank vectors, which allows us to find a cut with conductance at most oslash and approximately optimal balance in time O(m log4 m/oslash) in time proportional to its size. Expand

A recommender system based on local random walks and spectral methods

- Mathematics
- WebKDD/SNA-KDD '07
- 2007

In this paper, we design recommender systems for weblogs based on the link structure among them. We propose algorithms based on refined random walks and spectral methods. First, we observe the use of… Expand

The PageRank Citation Ranking : Bringing Order to the Web

- Computer Science
- WWW 1999
- 1999

This paper describes PageRank, a mathod for rating Web pages objectively and mechanically, effectively measuring the human interest and attention devoted to them, and shows how to efficiently compute PageRank for large numbers of pages. Expand

Random Walks on Graphs: a Survey

Dedicated to the marvelous random walk of Paul Erd} os through universities, c ontinents, and mathematics Various aspects of the theory of random walks on graphs are surveyed. In particular,… Expand

Spectral centrality measures in complex networks.

- Mathematics, Physics
- Physical review. E, Statistical, nonlinear, and soft matter physics
- 2008

This work reviews and compares centrality measures based on spectral properties of graph matrices, and shall focus on PageRank, eigenvector centrality (EV), and the hub and authority scores of the HITS algorithm. Expand

Equal Opportunity for Low-Degree Network Nodes: A PageRank-Based Method for Protein Target Identification in Metabolic Graphs

- Biology, Medicine
- PloS one
- 2013

A novel method applicable in networks with directed edges (such as metabolic networks) that compensates for the low degree (non-hub) vertices in the network, and identifies important nodes, regardless of their hub properties is shown. Expand

Fast Distributed PageRank Computation

- Computer Science
- ICDCN
- 2013

This work designs provably efficient fully-distributed algorithms for computing PageRank using traditional matrix-vector multiplication style iterative methods, which may not always adapt well to the distributed setting owing to communication bandwidth restrictions and convergence rates. Expand

Keyword Extraction Based on PageRank

- Computer Science
- PAKDD
- 2007

A keyword extraction algorithm based on WordNet and PageRank that applies UW-PageRank in the rough graph to do word sense disambiguation, prune the graph, and finally apply UW- PageRank again on the pruned graph to extract keywords. Expand

The Anatomy of a Large-Scale Hypertextual Web Search Engine

- Computer Science
- Comput. Networks
- 1998

This paper provides an in-depth description of Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext and looks at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want. Expand

Random Walks on Graphs: A Survey

- Computer Science
- 2001

Estimates on the important parameters of access time, commute time, cover time and mixing time are discussed and recent algorithmic applications of random walks are sketched, in particular to the problem of sampling. Expand