Small noise limits of Markov chains and the PageRank

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Borkar, Vivek S, Sowmya, S, Tripathi, Raghavendra
Format: Preprint
Veröffentlicht: 2025
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866916804798971904
author Borkar, Vivek S
Sowmya, S
Tripathi, Raghavendra
author_facet Borkar, Vivek S
Sowmya, S
Tripathi, Raghavendra
contents We recall the classical formulation of PageRank as the stationary distribution of a singularly perturbed irreducible Markov chain that is not irreducible when the perturbation parameter goes to zero. Specifically, we use the Markov chain tree theorem to derive explicit expressions for the PageRank. This analysis leads to some surprising results. These results are then extended to a much more general class of perturbations that subsume personalized PageRank. We also give examples where even simpler formulas for PageRank are possible.
format Preprint
id arxiv_https___arxiv_org_abs_2503_05137
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Small noise limits of Markov chains and the PageRank
Borkar, Vivek S
Sowmya, S
Tripathi, Raghavendra
Probability
Networking and Internet Architecture
65F99
G.1.10
We recall the classical formulation of PageRank as the stationary distribution of a singularly perturbed irreducible Markov chain that is not irreducible when the perturbation parameter goes to zero. Specifically, we use the Markov chain tree theorem to derive explicit expressions for the PageRank. This analysis leads to some surprising results. These results are then extended to a much more general class of perturbations that subsume personalized PageRank. We also give examples where even simpler formulas for PageRank are possible.
title Small noise limits of Markov chains and the PageRank
topic Probability
Networking and Internet Architecture
65F99
G.1.10
url https://arxiv.org/abs/2503.05137