TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
From MaRDI portal
Publication:4961155
DOI10.1142/S0218348X19500282zbMath1433.05286WikidataQ128988843 ScholiaQ128988843MaRDI QIDQ4961155
Chunyu Shen, Meifeng Dai, Tingting Ju, Jiaojiao He, Yue Zong, Wei Yi Su
Publication date: 22 April 2020
Published in: Fractals (Search for Journal in Brave)
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks on graphs (05C81)
Related Items (4)
WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS ⋮ EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS ⋮ Average trapping time of weighted scale-free m-triangulation networks ⋮ Trapping efficiency of random walks on weighted scale-free trees
Cites Work
- Global synchronization of weighted cellular neural network with time-varying coupling delays
- Box dimensions of Riemann-Liouville fractional integrals of continuous functions of bounded variation
- Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk
- Scale-free and small-world properties of Sierpinski networks
- Network coherence and eigentime identity on a family of weighted fractal networks
- Network coherence in the web graphs
- Average weighted trapping time of the node- and edge-weighted fractal networks
- Statistical mechanics of complex networks
- Effect of trap position on the efficiency of trapping in treelike scale-free networks
- Emergence of Scaling in Random Networks
- Influence of weight heterogeneity on random walks in scale-free networks
- Random walks on non-homogenous weighted Koch networks
- Ordering dynamics of the multi-state voter model
- Efficient search by optimized intermittent random walks
- The Structure and Function of Complex Networks
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI GASKET AND SIERPINSKI NETWORKS
- FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
- AVERAGE GEODESIC DISTANCE OF SIERPINSKI CARPET
- Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
- A Circularly Polarized Pattern Diversity Antenna for Hemispherical Coverage
- DIMENSION ANALYSIS OF CONTINUOUS FUNCTIONS WITH UNBOUNDED VARIATION
- A geometric growth model interpolating between regular and small-world networks
This page was built for publication: TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS
