THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE

DOI10.1142/S0218348X19501123zbMath1434.05141OpenAlexW2965226705MaRDI QIDQ5108645

Changming Xing

Publication date: 5 May 2020

Published in: Fractals (Search for Journal in Brave)

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

zbMATH Keywords

weighted networkfractal networkaverage trapping timebiased walkinfluence factor

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Fractals (28A80) Signed and weighted graphs (05C22) Random walks on graphs (05C81)

Related Items (1)

Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Cites Work

• Unnamed Item
• The different cooperative behaviors on a kind of scale-free networks with identical degree sequence
• A Guide to First-Passage Processes
• Emergence of Scaling in Random Networks
• Random walks on non-homogenous weighted Koch networks
• Efficient search by optimized intermittent random walks
• The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks
• RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units

This page was built for publication: THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE