IDEAS home Printed from https://ideas.repec.org/a/wsi/ijmpcx/v25y2014i03ns0129183113500976.html
   My bibliography  Save this article

Mean first-passage time on a family of small-world treelike networks

Author

Listed:
  • Long Li

    (Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • Weigang Sun

    (Institute of Applied Mathematics and Engineering Computations, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • Guixiang Wang

    (Institute of Operational Research and Cybernetics, Hangzhou Dianzi University, Hangzhou 310018, P. R. China)

  • Guanghui Xu

    (School of Science, Zhejiang A & F University, Hangzhou 311300, P. R. China)

Abstract

In this paper, we obtain exact scalings of mean first-passage time (MFPT) of random walks on a family of small-world treelike networks formed by two parameters, which includes three kinds. First, we determine the MFPT for a trapping problem with an immobile trap located at the initial node, which is defined as the average of the first-passage times (FPTs) to the trap node over all possible starting nodes, and it scales linearly with network sizeNin large networks. We then analytically obtain the partial MFPT (PMFPT) which is the mean of FPTs from the trap node to all other nodes and show that it increases withNasNlnN. Finally we establish the global MFPT (GMFPT), which is the average of FPTs over all pairs of nodes. It also grows withNasNlnNin the large limit ofN. For these three kinds of random walks, we all obtain the analytical expressions of the MFPT and they all increase with network parameters. In addition, our method for calculating the MFPT is based on the self-similar structure of the considered networks and avoids the calculations of the Laplacian spectra.

Suggested Citation

  • Long Li & Weigang Sun & Guixiang Wang & Guanghui Xu, 2014. "Mean first-passage time on a family of small-world treelike networks," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 25(03), pages 1-10.
    • Handle: RePEc:wsi:ijmpcx:v:25:y:2014:i:03:n:s0129183113500976
    DOI: 10.1142/S0129183113500976
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183113500976
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183113500976?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:wsi:ijmpcx:v:25:y:2014:i:03:n:s0129183113500976. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/ijmpc/ijmpc.shtml .

    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.