Scaling of average sending time on weighted Koch networks

DOI10.1063/1.4748305zbMath1278.05229OpenAlexW1988492174MaRDI QIDQ2872357

Meifeng Dai, Jie Liu

Publication date: 14 January 2014

Published in: Journal of Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

random walks on a class of weighted Koch networksrandom walks on weighted complex networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Stochastic network models in operations research (90B15) Mathematical problems of computer architecture (68M07) Random walks on graphs (05C81)

Related Items (9)

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 ⋮ The modified box dimension and average weighted receiving time of the weighted hierarchical graph ⋮ Random walks on non-homogenous weighted Koch networks ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ Asymptotic formula on average path length of fractal networks modeled on Sierpinski gasket ⋮ ASYMPTOTIC FORMULA OF AVERAGE DISTANCES ON FRACTAL NETWORKS MODELED BY SIERPINSKI TETRAHEDRON ⋮ Efficiency of transportation on weighted extended Koch networks ⋮ Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks

Cites Work

• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks

This page was built for publication: Scaling of average sending time on weighted Koch networks