Random walks on non-homogenous weighted Koch networks

DOI10.1063/1.4810927zbMath1323.05114OpenAlexW2073081972WikidataQ44353666 ScholiaQ44353666MaRDI QIDQ3193330

Li-Feng Xi, Meifeng Dai, Xingyi Li

Publication date: 28 October 2015

Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1063/1.4810927

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Signed and weighted graphs (05C22) Random walks on graphs (05C81)

Related Items (20)

Average receiving scaling of the weighted polygon Koch networks with the weight-dependent walk ⋮ Multifractal analysis and topological properties of a new family of weighted Koch networks ⋮ Average weighted receiving time on the non-homogeneous double-weighted fractal networks ⋮ Network coherence and eigentime identity on a family of weighted fractal networks ⋮ Scaling of average weighted shortest path and average receiving time on the weighted Cayley networks ⋮ LAZY RANDOM WALKS ON PSEUDOFRACTAL SCALE-FREE WEB WITH A PERFECT TRAP ⋮ Eigentime identity of the weighted scale-free triangulation networks for weight-dependent walk ⋮ The Laplacian spectrum and average trapping time for weighted Dyson hierarchical network ⋮ The trapping problem of the weighted scale-free treelike networks for two kinds of biased walks ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ Coherence analysis of a class of weighted networks ⋮ NETWORK COHERENCE ANALYSIS ON A FAMILY OF NESTED WEIGHTED n-POLYGON NETWORKS ⋮ CHARACTERISTIC POLYNOMIAL OF ADJACENCY OR LAPLACIAN MATRIX FOR WEIGHTED TREELIKE NETWORKS ⋮ RANDOM WALKS IN HETEROGENEOUS WEIGHTED PSEUDO-FRACTAL WEBS WITH THE SAME WEIGHT SEQUENCE ⋮ THE TRAPPING PROBLEM OF WEIGHTED (2,2)-FLOWER NETWORKS WITH THE SAME WEIGHT SEQUENCE ⋮ The 3-cycle weighted spectral distribution in evolving community-based networks ⋮ TRAPPING PROBLEM OF THE WEIGHTED SCALE-FREE TRIANGULATION NETWORKS FOR BIASED WALKS ⋮ Percolation on interacting networks with feedback-dependency links ⋮ Determination of multifractal dimensions of complex networks by means of the sandbox algorithm ⋮ Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

Cites Work

• Unnamed Item
• Complex networks: structure and dynamics
• Scaling of average sending time on weighted Koch networks
• Mapping Koch curves into scale-free small-world networks
• From time series to complex networks: The visibility graph
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
• Impact of degree heterogeneity on the behavior of trapping in Koch networks
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Random walks on non-homogenous weighted Koch networks