SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS

DOI10.1142/S0218348X18500950zbMath1433.26006MaRDI QIDQ5107204

Xianbin Wu, Meifeng Dai, Wenjing Feng, Huijia Chi, Wei Yi Su, Yue Zong

Publication date: 17 April 2020

Published in: Fractals (Search for Journal in Brave)

zbMATH Keywords

first return timemean and secondary moment and varianceweighted transfractals \((1, 3)\)-flowersweighted-dependent walk

Mathematics Subject Classification ID

Fractional derivatives and integrals (26A33) Time series analysis of dynamical systems (37M10) Fractals (28A80)

Related Items (7)

EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ EXACT CALCULATIONS OF FIRST-PASSAGE QUANTITIES ON A CLASS OF WEIGHTED TREE-LIKE FRACTAL NETWORKS ⋮ COHERENCE ANALYSIS FOR ITERATED LINE GRAPHS OF MULTI-SUBDIVISION GRAPH ⋮ Eigentime identity of the weighted (m,n)-flower networks ⋮ CONVERGENCE RATE AND GLOBAL MEAN WEIGHTED FIRST-PASSAGE TIME IN A 1D CHAIN NETWORK WITH A WEIGHTED ADDING REVERSE EDGE ⋮ Average trapping time of weighted scale-free m-triangulation networks ⋮ Scaling of average receiving time and average weighted shortest path on weighted-crystal network

Cites Work

• Mean value properties of harmonic functions on Sierpinski gasket type fractals
• Geographical embedding of scale-free networks
• Scale-free and small-world properties of Sierpinski networks
• Network coherence and eigentime identity on a family of weighted fractal networks
• Average weighted trapping time of the node- and edge-weighted fractal networks
• Coherence analysis of a class of weighted networks
• FIRST-ORDER NETWORK COHERENCE AND EIGENTIME IDENTITY ON THE WEIGHTED CAYLEY NETWORKS
• COUNTING SPANNING TREES IN PRISM AND ANTI-PRISM GRAPHS
• SPECTRAL ANALYSIS FOR WEIGHTED ITERATED TRIANGULATIONS OF GRAPHS

This page was built for publication: SCALING PROPERTIES OF FIRST RETURN TIME ON WEIGHTED TRANSFRACTALS (1,3)-FLOWERS