IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i13p2080-d1686219.html
   My bibliography  Save this article

PageRank of Gluing Networks and Corresponding Markov Chains

Author

Listed:
  • Xuqian Ben Han

    (The Independent Schools Foundation Academy, 26A Tower 2 Bel Air No. 8 Phase 6, Pok Fu Lam, Hong Kong
    These authors contributed equally to this work.)

  • Shihao Wang

    (Qiuzhen College, Tsinghua University, Beijing 100084, China
    These authors contributed equally to this work.)

  • Chenglong Yu

    (Yau Mathematical Sciences Center, Tsinghua University, Beijing 100084, China
    These authors contributed equally to this work.)

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.

Suggested Citation

  • Xuqian Ben Han & Shihao Wang & Chenglong Yu, 2025. "PageRank of Gluing Networks and Corresponding Markov Chains," Mathematics, MDPI, vol. 13(13), pages 1-23, June.
    • Handle: RePEc:gam:jmathe:v:13:y:2025:i:13:p:2080-:d:1686219
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/13/2080/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/13/13/2080/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:13:p:2080-:d:1686219. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.