THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET

DOI10.1142/S0218348X21502364zbMath1484.05193OpenAlexW3183235298MaRDI QIDQ5062371

Bo Wu, Zhizhuo Zhang, Yun Chen

Publication date: 15 March 2022

Published in: Fractals (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218348x21502364

zbMATH Keywords

average trapping timelevel-3 Sierpinski gasketnon-nearest-neighbor jumps

Mathematics Subject Classification ID

Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Processes in random environments (60K37) Fractals (28A80) Random walks on graphs (05C81)

Cites Work

• Unnamed Item
• Unnamed Item
• Spanning trees on the Sierpinski gasket
• Incompatibility networks as models of scale-free small-world graphs
• The Laplacian on the level 3 Sierpinski gasket via the method of averages
• Towards the epidemiological modeling of computer viruses
• Average weighted trapping time of the node- and edge-weighted fractal networks
• A Guide to First-Passage Processes
• Random Walks on Lattices. II
• Effect of trap position on the efficiency of trapping in treelike scale-free networks
• Dynamics of continuous-time quantum walks in restricted geometries
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Scaling laws for diffusion on (trans)fractal scale-free networks
• Probability: A Graduate Course

This page was built for publication: THE AVERAGE TRAPPING TIME WITH NON-NEAREST-NEIGHBOR JUMPS ON THE LEVEL-3 SIERPINSKI GASKET