IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v86y2013i10p1-1210.1140-epjb-e2013-40246-5.html
   My bibliography  Save this article

Efficiency of transportation on weighted extended Koch networks

Author

Listed:
  • Zikai Wu
  • Baoyu Hou
  • Hongjuan Zhang

Abstract

In this paper, we propose a family of weighted extended Koch networks based on a class of extended Koch networks. They originate from a r-complete graph, and each node in each r-complete graph of current generation produces mr-complete graphs whose weighted edges are scaled by factor h in subsequent evolutionary step. We study the structural properties of these networks and random walks on them. In more detail, we calculate exactly the average weighted shortest path length (AWSP), average receiving time (ART) and average sending time (AST). Besides, the technique of resistor network is employed to uncover the relationship between ART and AST on networks with unit weight. In the infinite network order limit, the average weighted shortest path lengths stay bounded with growing network order (0 > h > 1). The closed form expression of ART shows that it exhibits a sub-linear dependence (0 > h > 1) or linear dependence (h = 1) on network order. On the contrary, the AST behaves super-linearly with the network order. Collectively, all the obtained results show that the efficiency of message transportation on weighted extended Koch networks has close relation to the network parameters h, m and r. All these findings could shed light on the structure and random walks of general weighted networks. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2013

Suggested Citation

  • Zikai Wu & Baoyu Hou & Hongjuan Zhang, 2013. "Efficiency of transportation on weighted extended Koch networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 86(10), pages 1-12, October.
  • Handle: RePEc:spr:eurphb:v:86:y:2013:i:10:p:1-12:10.1140/epjb/e2013-40246-5
    DOI: 10.1140/epjb/e2013-40246-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2013-40246-5
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1140/epjb/e2013-40246-5?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.

    More about this item

    Keywords

    Statistical and Nonlinear Physics;

    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:spr:eurphb:v:86:y:2013:i:10:p:1-12:10.1140/epjb/e2013-40246-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.