Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks

DOI10.1080/15427951.2012.685685zbMath1258.05116OpenAlexW2019646084MaRDI QIDQ4905090

Yilun Shang

Publication date: 15 February 2013

Published in: Internet Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.im/1354809987

zbMATH Keywords

flowerssmall world phenomenonErdos-Renyi random graphsmean commute timesmean effective resistancenetworks with scale-free topologiespseudofractal propertiesrandom-walk issuestwo-parameter scale-free networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items (7)

The modified box dimension and average weighted receiving time of the weighted hierarchical graph ⋮ Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks ⋮ Sandwich theorem of cover times ⋮ Extremal trees for the Randić index ⋮ Phase transition in long-range percolation on bipartite hierarchical lattices ⋮ Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree ⋮ Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks

This page was built for publication: Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks