IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v519y2019icp295-302.html
   My bibliography  Save this article

Average hopcount of the shortest path in tree-like components with finite size

Author

Listed:
  • Guo, Dongchao
  • Yin, Hao
  • Li, Cong
  • Zhang, Xu

Abstract

An exact formula for computing the average hopcount of the shortest path in finite-size tree-like components of undirected unweighted random networks is proposed. In a tree-like component with size s, there exists virtually only one shortest path between two arbitrary nodes. The summation of hopcounts of all shortest paths can be calculated approximately by the summation of the betweenness of all nodes, and the difference between them is only a constant s(s−1). Therefore, the average hopcount can be calculated by further dividing the summation by the number of all shortest paths. In this paper, we first derive the conditional probability p(k|s) of the degree distribution of finite components with size s and the summation of all nodal betweenness respectively. By means of these results, we obtain the exact formula for calculating the average hopcount. Also, We confirm the proposed formula by simulations for networks with Poisson and power law degree distributions respectively.

Suggested Citation

  • Guo, Dongchao & Yin, Hao & Li, Cong & Zhang, Xu, 2019. "Average hopcount of the shortest path in tree-like components with finite size," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 519(C), pages 295-302.
    • Handle: RePEc:eee:phsmap:v:519:y:2019:i:c:p:295-302
    DOI: 10.1016/j.physa.2018.12.034
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437118315474
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2018.12.034?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:eee:phsmap:v:519:y:2019:i:c:p:295-302. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.