LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Exact Solutions for Average Trapping Time of Random Walks on Weighted Scale-Free Networks

Photo from wikipedia

In this paper, we present two deterministic weighted scale-free networks controlled by a weight parameter r(0 < r ≤ 1). One is fractal network, the other one is non-fractal network,… Click to show full abstract

In this paper, we present two deterministic weighted scale-free networks controlled by a weight parameter r(0 < r ≤ 1). One is fractal network, the other one is non-fractal network, while they have the same weight distribution when the parameter r is identical. Based on their special network structure, we study random walks on network with a trap located at a fixed node. For each network, we calculate exact solutions for average trapping time (ATT). Analyzing and comparing the obtained solutions, we find that their ATT all grow asymptotically as a power-law function of network order (number of nodes) with the exponent f(r) dependent on the weight parameter, but their exponent f(r) are obviously different, one is an increasing function of r, while the other is opposite. Collectively, all the obtained results show that the efficiency of trapping on weighted Scale-free networks has close relation to the weight distribution, but there is no stable positive or negative correlation between the weight distributi...

Keywords: network; scale free; free networks; random walks; weighted scale; exact solutions

Journal Title: Fractals
Year Published: 2017

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.