LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP

DOI10.1142/S0218348X2250030XzbMath1484.05194OpenAlexW4207032037WikidataQ113434278 ScholiaQ113434278MaRDI QIDQ5064335

Hao Yuan, Changming Xing

Publication date: 15 March 2022

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

pseudofractal scale-free webtrapping timelazy random walks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Combinatorial probability (60C05) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Random walks on graphs (05C81)

Related Items (1)

COMBINATORIAL PROPERTIES FOR A CLASS OF SIMPLICIAL COMPLEXES EXTENDED FROM PSEUDO-FRACTAL SCALE-FREE WEB

Cites Work

• Unnamed Item
• Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph
• Lazy random walks and optimal transport on graphs
• A Guide to First-Passage Processes
• Random walks on non-homogenous weighted Koch networks
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Lazy Random Walks for Superpixel Segmentation
• Elements of the Random Walk
• The average trapping time on the weighted pseudofractal scale-free web
• RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
• Controlling the trapping efficiency in a family of scale-free tree networks
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units

This page was built for publication: LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP