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

Weighted trapping time of weighted directed treelike network

Author

Listed:
  • Meifeng Dai

    (Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China)

  • Yongbo Hou

    (Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China)

  • Tingting Ju

    (Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China)

  • Changxi Dai

    (Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China)

  • Yu Sun

    (Institute of Applied System Analysis, Jiangsu University, Zhenjiang 212013, P. R. China)

  • Weiyi Su

    (#x2020;Department of Mathematics, Nanjing University, Nanjing 210093, P. R. China)

Abstract

With the deepening of research on complex networks, many properties of complex networks are gradually studied, for example, the mean first-passage times, the average receive times and the trapping times. In this paper, we further study the average trapping time of the weighted directed treelike network constructed by an iterative way. Firstly, we introduce our model inspired by trade network, each edge ei,j in undirected network is replaced by two directed edges with weights wi,j and wj,i. Then, the trap located at central node, we calculate the weighted directed trapping time (WDTT) and the average weighted directed trapping time (AWDTT). Remarkably, the WDTT has different formulas for even generations and odd generations. Finally, we analyze different cases for weight factors of weighted directed treelike network.

Suggested Citation

  • Meifeng Dai & Yongbo Hou & Tingting Ju & Changxi Dai & Yu Sun & Weiyi Su, 2020. "Weighted trapping time of weighted directed treelike network," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 31(08), pages 1-15, August.
    • Handle: RePEc:wsi:ijmpcx:v:31:y:2020:i:08:n:s0129183120501089
    DOI: 10.1142/S0129183120501089
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0129183120501089
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0129183120501089?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:31:y:2020:i:08:n:s0129183120501089. 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.