Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk

DOI10.1016/J.PHYSA.2016.03.097zbMath1400.60095OpenAlexW2337084907MaRDI QIDQ1619636

Meifeng Dai, Qi Xie, Yanqiu Sun, Dandan Ye, Shuxiang Shao

Publication date: 13 November 2018

Published in: Physica A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.physa.2016.03.097

zbMATH Keywords

self-similarityweight factoraverage receiving timerecursive divisionweight-dependent walkweighted polygon Koch network

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Fractals (28A80)

Related Items (5)

Average weighted receiving time on the non-homogeneous double-weighted fractal networks ⋮ Spectral analysis for a family of treelike networks ⋮ Mean first-passage times for two biased walks on the weighted rose networks ⋮ CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS ⋮ TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS

Cites Work

• Unnamed Item
• Unnamed Item
• Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket
• Complex networks modeled on the Sierpinski gasket
• A small-world and scale-free network generated by Sierpinski pentagon
• Trapping on modular scale-free and small-world networks with multiple hubs
• Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
• Mapping Koch curves into scale-free small-world networks
• Statistical mechanics of complex networks
• Random walks on non-homogenous weighted Koch networks
• The Structure and Function of Complex Networks
• Exact calculations of first-passage properties on the pseudofractal scale-free web
• Impact of degree heterogeneity on the behavior of trapping in Koch networks
• A class of scale-free networks with fractal structure based on subshift of finite type
• Expanded Koch networks: structure and trapping time of random walks

This page was built for publication: Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk