Trapping efficiency of random walks on weighted scale-free trees
From MaRDI portal
(Redirected from Publication:5006965)
Recommendations
- Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
- 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
- The range of random walk on trees and related trapping problem
- Controlling the trapping efficiency in a family of scale-free tree networks
- Trapping time of weighted-dependent walks depending on the weight factor
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
- Random walks, capacity and percolation on trees
Cites work
- A Guide to First-Passage Processes
- Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
- Average trapping time of weighted scale-free m-triangulation networks
- 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
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- First-passage phenomena and their applications
- From first-passage times of random walks in confinement to geometry-controlled kinetics
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- Human mobility: models and applications
- Impact of degree heterogeneity on the behavior of trapping in Koch networks
- Random walks and diffusion on networks
- Random walks on graphs: ideas, techniques and results
- Scaling laws for diffusion on (trans)fractal scale-free networks
- The average trapping time on the weighted pseudofractal scale-free web
- The electrical resistance of a graph captures its commute and cover times
- The restaurant at the end of the random walk: recent developments in the description of anomalous transport by fractional dynamics
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- The true reinforced random walk with bias
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
Cited in
(10)- Analysis of diffusion and trapping efficiency for random walks on non-fractal scale-free trees
- Eigenvalues of transition weight matrix for a family of weighted networks
- Mean first-passage times for two biased walks on the weighted rose networks
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Trapping time of weighted-dependent walks depending on the weight factor
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- The normalized Laplacian spectrum of n -polygon graphs and applications
- Fractal and first-passage properties of a class of self-similar networks
- Controlling and optimizing the transport (search) efficiency with local information on a class of scale-free trees
- Optimization of transport efficiency on bundled networks
This page was built for publication: Trapping efficiency of random walks on weighted scale-free trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006965)