• Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pram/086/06/1173-1182

    • Keywords

       

      Weighted Koch network; recursive division method; average weighted receiving time.

    • Abstract

       

      Motivated by the empirical observation in airport networks and metabolic networks, we introduce the model of the recursive weighted Koch networks created by the recursive division method. As a fundamental dynamical process, random walks have received considerable interest in the scientific community. Then, we study the recursive weighted Koch networks on random walk i.e., the walker, at each step, starting from its current node, moves uniformly to any of itsneighbours. In order to study the model more conveniently, we use recursive division method again to calculate the sum of the mean weighted first-passing times for all nodes to absorption at the trap located in the merging node. It is showed that in a large network, the average weighted receiving time grows sublinearly with the network order.

    • Author Affiliations

       

      DAI MEIFENG1 YE DANDAN1 LI XINGYI2 HOU JIE1

      1. Nonlinear Scientific Research Center, Faculty of Science, Jiangsu University, Zhenjiang, Jiangsu, 212013, People’s Republic of China
      2. School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang, 212013, People’s Republic of China
    • Dates

       
  • Pramana – Journal of Physics | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2021-2022 Indian Academy of Sciences, Bengaluru.