2014
DOI: 10.1088/0256-307x/31/8/080504
|View full text |Cite
|
Sign up to set email alerts
|

Random Walks on Deterministic Weighted Scale-Free Small-World Networks with a Perfect Trap

Abstract: Random walks are the most fundamental process among various dynamical processes, and most previous works focused on binary networks. This work studies random walks on deterministic weighted scale-free small-world networks with a perfect trap. We derive an explicit expression of the mean first passage time on the network with a trap. Meanwhile, we present the evolutionary rule for the first passage time when the network grows. The study can be useful for understanding the random walks on weighted networks.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…It is fair to say CW becomes one of the most significant models in the theories of probability and statistics. [1][2][3][4][5][6][7][8][9][10][11] Its most popular version is that a walker moves on a line in a discrete manner and that the walker flips a coin to decide the direction of the next step. In detail, if the result is the head, the walker will move its position (initially at x = 0) to the position x = 1; if the result is the tail, the walker will move its position to the position x = −1.…”
Section: Introductionmentioning
confidence: 99%
“…It is fair to say CW becomes one of the most significant models in the theories of probability and statistics. [1][2][3][4][5][6][7][8][9][10][11] Its most popular version is that a walker moves on a line in a discrete manner and that the walker flips a coin to decide the direction of the next step. In detail, if the result is the head, the walker will move its position (initially at x = 0) to the position x = 1; if the result is the tail, the walker will move its position to the position x = −1.…”
Section: Introductionmentioning
confidence: 99%
“…In contrast to stochastic models, deterministic models help us to understand the construction rules embedded in randomized structures and allow for rigorous computation of many graph features, e.g., clustering coefficients, diameter, betweenness, path length, and mean first-passage time. [10][11][12][13][14][15][16][17][18][19][20] The primary deterministic scale-free model was proposed by Barabasi et al [19] However, this model lacks the small-world effect that exists in most real networks, i.e., its clustering coefficient is too small while the average length path remains relatively large. To remedy this weakness, Chen et al [20] constructed a pseudo tree-like (PTL) deterministic model having both the small-world and the scale-free characteristics.…”
Section: Introductionmentioning
confidence: 99%