Trapping efficiency of random walks on weighted scale-free trees
From MaRDI portal
Publication:5006965
DOI10.1088/1742-5468/ac02cbOpenAlexW3177026667MaRDI QIDQ5006965
Junhao Peng, Alejandro P. Riascos, Long Gao, Chun-Ming Tang
Publication date: 17 August 2021
Published in: Journal of Statistical Mechanics: Theory and Experiment (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1088/1742-5468/ac02cb
Related Items
The normalized Laplacian spectrum of n -polygon graphs and applications, Eigenvalues of transition weight matrix for a family of weighted networks
Cites Work
- Unnamed Item
- From first-passage times of random walks in confinement to geometry-controlled kinetics
- The electrical resistance of a graph captures its commute and cover times
- Human mobility: models and applications
- Random walks and diffusion on networks
- Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Effects of node position on diffusion and trapping efficiency for random walks on fractal scale-free trees
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- Scaling laws for diffusion on (trans)fractal scale-free networks
- Random walks on graphs: ideas, techniques and results
- The restaurant at the end of the random walk: recent developments in the description of anomalous transport by fractional dynamics
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- The average trapping time on the weighted pseudofractal scale-free web
- The true reinforced random walk with bias
- Average trapping time of weighted scale-free m-triangulation networks
- First-Passage Phenomena and Their Applications
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- A Guide to First-Passage Processes
