PageRank of Gluing Networks and Corresponding Markov Chains

Xuqian Ben Han, Shihao Wang () and Chenglong Yu
Additional contact information
Xuqian Ben Han: The Independent Schools Foundation Academy, 26A Tower 2 Bel Air No. 8 Phase 6, Pok Fu Lam, Hong Kong
Shihao Wang: Qiuzhen College, Tsinghua University, Beijing 100084, China
Chenglong Yu: Yau Mathematical Sciences Center, Tsinghua University, Beijing 100084, China

Mathematics, 2025, vol. 13, issue 13, 1-23

Abstract: This paper studies Google’s PageRank algorithm. By an innovative application of the method of gluing Markov chains, we study the properties of Markov chains and extend their applicability by accounting for the damping factor and the personalization vector. Many properties of Markov chains related to spectrums and eigenvectors of the transition matrix, including the stationary distribution, periodicity, and persistent and transient states, will be investigated as well as part of the gluing process. Using the gluing formula, it is possible to decompose a large network into some sub-networks, compute their PageRank separably and glue them together. The computational workload can be reduced.

Keywords: PageRank; Markov chain; equilibrium; random walk (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/13/2080/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/13/2080/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:13:p:2080-:d:1686219

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().