The average trapping time on the weighted pseudofractal scale-free web
From MaRDI portal
Publication:5135116
DOI10.1088/1742-5468/ab7af0zbMath1457.90049OpenAlexW3019307925MaRDI QIDQ5135116
Publication date: 19 November 2020
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/ab7af0
Characteristic functions; other transforms (60E10) Sums of independent random variables; random walks (60G50) Stochastic network models in operations research (90B15) Applications of Brownian motions and diffusion theory (population genetics, absorption problems, etc.) (60J70)
Related Items (2)
LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP ⋮ Trapping efficiency of random walks on weighted scale-free trees
Cites Work
- Scale-free and small-world properties of Sierpinski networks
- Statistical mechanics of complex networks
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- Exact calculations of first-passage properties on the pseudofractal scale-free web
- Elements of the Random Walk
- SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
- Effect of heterogeneous weights on the average trapping time and two types of random walks in weighted directed networks
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
- Collective dynamics of ‘small-world’ networks
This page was built for publication: The average trapping time on the weighted pseudofractal scale-free web