Average trapping time of weighted scale-free m-triangulation networks
From MaRDI portal
Publication:5149437
DOI10.1088/1742-5468/ab38c0zbMath1457.82090OpenAlexW2988446874MaRDI QIDQ5149437
Wei Yi Su, Bo Wu, Zhizhuo Zhang, Yingying Chen
Publication date: 11 February 2021
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/ab38c0
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Related Items (3)
The average trapping time on a half Sierpinski gasket ⋮ EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS ⋮ Trapping efficiency of random walks on weighted scale-free trees
Cites Work
- Scale-free and small-world properties of Sierpinski networks
- Inverted Berezinskii-Kosterlitz-Thouless singularity and high-temperature algebraic order in an Ising model on a scale-free hierarchical-lattice small-world network
- Statistical mechanics of complex 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
- MULTIFRACTAL ANALYSIS OF ONE-DIMENSIONAL BIASED WALKS
- TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
- SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS
- SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
This page was built for publication: Average trapping time of weighted scale-free m-triangulation networks
