Mean commute time for random walks on hierarchical scale-free networks
From MaRDI portal
Publication:4905090
Recommendations
- RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES
- Expanded Koch networks: structure and trapping time of random walks
- Analyses of some structural properties on a class of hierarchical scale-free networks
- Average trapping time of weighted scale-free \(m\)-triangulation networks
- Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks
Cited in
(10)- COMMUTE TIMES AND THE EFFECTIVE RESISTANCES OF RANDOM TREES
- The modified box dimension and average weighted receiving time of the weighted hierarchical graph
- Mean first passage time of preferential random walks on complex networks with applications
- Transport properties of random walks on scale-free/regular-lattice hybrid networks
- Scaling of the average weighted receiving time on a family of double-weighted hierarchical networks
- Phase transition in long-range percolation on bipartite hierarchical lattices
- Emergence of fractal scale-free networks from stochastic evolution on the Cayley tree
- Extremal trees for the Randić index
- Scaling of average weighted shortest path and average receiving time on weighted hierarchical networks
- Sandwich theorem of cover times
This page was built for publication: Mean commute time for random walks on hierarchical scale-free networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905090)
