Name
Abstract | ||
|---|---|---|
Random walks are a useful tool to describe and study various dynamical processes on networks. For some particular problems, it is more suitable to formulate them by biased random walks based on the properties of edges, for example, weight and importance. However, in some situations it is not easy to directly observe weight information of a network. In this paper, we show how to extract weight info... |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1093/comjnl/bxy131 | The Computer Journal |
Keywords | DocType | Volume |
random walks,complex networks,hitting time,edge centrality | Journal | 63 |
Issue | ISSN | Citations |
1 | 0010-4620 | 0 |
PageRank | References | Authors |
0.34 | 14 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuan Lin | 1 | 7 | 1.61 |
| Zhongzhi Zhang | 2 | 85 | 22.02 |