Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks

DOI10.1142/S0217979214501112zbMath1293.05362MaRDI QIDQ2877027

Zikai Wu, Hongjuan Zhang, Baoyu Hou, Feng Jin

Publication date: 21 August 2014

Published in: International Journal of Modern Physics B (Search for Journal in Brave)

zbMATH Keywords

average receiving timeaverage weighted shortest pathweighted expanded Koch network

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Random walks on graphs (05C81)

Cites Work

• Deterministic small-world communication networks
• Complex networks: structure and dynamics
• Random walks on generalized Koch 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
• First-passage properties of the Erdos–Renyi random graph
• The restaurant at the end of the random walk: recent developments in the description of anomalous transport by fractional dynamics
• Collective dynamics of ‘small-world’ networks
• Deterministic scale-free networks

This page was built for publication: Scaling of average weighted shortest path and average receiving time on weighted expanded Koch networks