Graph fibrations, graph isomorphism, and PageRank

@article{Boldi2006GraphFG,
  title={Graph fibrations, graph isomorphism, and PageRank},
  author={Paolo Boldi and Violetta Lonati and Massimo Santini and Sebastiano Vigna},
  journal={ITA},
  year={2006},
  volume={40},
  pages={227-253}
}
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of inneighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 39 references

Fibrations of graphs

Discrete Mathematics • 2002
View 5 Excerpts
Highly Influenced

Partitioning a Graph in O(|A| log2 |V|)

Theor. Comput. Sci. • 1982
View 6 Excerpts
Highly Influenced

Exact and approximate graph matching using random walks

IEEE Transactions on Pattern Analysis and Machine Intelligence • 2005
View 2 Excerpts

The eigenvalues of the google matrix

L. Eldén
Technical Report LiTH-MAT- R-04-01, Department of Mathematics, Linköping University • 2004
View 1 Excerpt