RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES

DOI10.1142/S0218348X1750058XzbMath1432.05104OpenAlexW2765881145MaRDI QIDQ5219466

No author found.

Publication date: 12 March 2020

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

random walkscomplex networksfractal networksaverage trapping time

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Random walks on graphs (05C81)

Related Items (5)

LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP ⋮ CONSENSUS PROBLEMS IN WEIGHTED HIERARCHICAL GRAPHS ⋮ RANDOM WALKS IN HETEROGENEOUS WEIGHTED PSEUDO-FRACTAL WEBS WITH THE SAME WEIGHT SEQUENCE ⋮ THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE ⋮ Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Cites Work

• Complex networks: structure and dynamics
• Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
• Statistical mechanics of complex networks
• Effect of trap position on the efficiency of trapping in treelike scale-free networks
• Dynamical and spatial disorder in an intermittent search process
• Efficient search by optimized intermittent random walks
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units

This page was built for publication: RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES