IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0093348.html
   My bibliography  Save this article

Estimating Mean First Passage Time of Biased Random Walks with Short Relaxation Time on Complex Networks

Author

Listed:
  • Zhuo Qi Lee
  • Wen-Jing Hsu
  • Miao Lin

Abstract

Biased random walk has been studied extensively over the past decade especially in the transport and communication networks communities. The mean first passage time (MFPT) of a biased random walk is an important performance indicator in those domains. While the fundamental matrix approach gives precise solution to MFPT, the computation is expensive and the solution lacks interpretability. Other approaches based on the Mean Field Theory relate MFPT to the node degree alone. However, nodes with the same degree may have very different local weight distribution, which may result in vastly different MFPT. We derive an approximate bound to the MFPT of biased random walk with short relaxation time on complex network where the biases are controlled by arbitrarily assigned node weights. We show that the MFPT of a node in this general case is closely related to not only its node degree, but also its local weight distribution. The MFPTs obtained from computer simulations also agree with the new theoretical analysis. Our result enables fast estimation of MFPT, which is useful especially to differentiate between nodes that have very different local node weight distribution even though they share the same node degrees.

Suggested Citation

  • Zhuo Qi Lee & Wen-Jing Hsu & Miao Lin, 2014. "Estimating Mean First Passage Time of Biased Random Walks with Short Relaxation Time on Complex Networks," PLOS ONE, Public Library of Science, vol. 9(4), pages 1-10, April.
  • Handle: RePEc:plo:pone00:0093348
    DOI: 10.1371/journal.pone.0093348
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0093348
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0093348&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0093348?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Song, Xudan & Zhao, Pengcheng & Yin, Rongrong & Zu, Yunxiao & Zhang, Yong, 2025. "Cascading failure model and resilience-based sequential recovery strategy for complex networks," Reliability Engineering and System Safety, Elsevier, vol. 253(C).

    More about this item

    Statistics

    Access and download statistics

    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:plo:pone00:0093348. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.