2016
DOI: 10.1007/s12043-016-1196-8
|View full text |Cite
|
Sign up to set email alerts
|

Average weighted receiving time in recursive weighted Koch networks

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 its neighbours. In order to study the model more conveni… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…In view of the fact that many research studies on random walks mainly focus on undirected and unweighted networks, Zhang et al [14] discussed two types of random walks for a class of weighted and undirected networks. Dai et al [15][16][17][18] introduced several weighted random walks on the complex network. In fact, many real networks contain the relationships between individuals with different weights in different directions.…”
Section: Introductionmentioning
confidence: 99%
“…In view of the fact that many research studies on random walks mainly focus on undirected and unweighted networks, Zhang et al [14] discussed two types of random walks for a class of weighted and undirected networks. Dai et al [15][16][17][18] introduced several weighted random walks on the complex network. In fact, many real networks contain the relationships between individuals with different weights in different directions.…”
Section: Introductionmentioning
confidence: 99%