Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks

DOI10.1063/1.4768665zbMath1319.05120arXiv1211.4295OpenAlexW3101505259WikidataQ85820072 ScholiaQ85820072MaRDI QIDQ2944637

Zhong-Zhi Zhang, Yibin Sheng, Zhengyi Hu, Guan-Rong Chen

Publication date: 2 September 2015

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

Full work available at URL: https://arxiv.org/abs/1211.4295

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Sums of independent random variables; random walks (60G50) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Random walks on graphs (05C81)

Related Items

Exact evaluation of the causal spectrum and localization properties of electronic states on a scale-free network ⋮ Exact calculations of first-passage properties on the pseudofractal scale-free web ⋮ On the Kemeny time for continuous-time reversible and irreversible Markov processes with applications to stochastic resetting and to conditioning towards forever-survival ⋮ Kemeny's constant and global mean first passage time of random walks on octagonal cell network ⋮ EIGENTIME IDENTITY FOR WEIGHT-DEPENDENT WALK ON A CLASS OF WEIGHTED FRACTAL SCALE-FREE HIERARCHICAL-LATTICE NETWORKS ⋮ Volatilities analysis of first-passage time and first-return time on a small-world scale-free network ⋮ The 3-cycle weighted spectral distribution in evolving community-based networks ⋮ Navigation in spatial networks: a survey ⋮ RANDOM WALKS WITH A TRAP IN SCALE-FREE FRACTAL HIERARCHICAL LATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Resistance distance and the normalized Laplacian spectrum
• Complex networks: structure and dynamics
• Statistical mechanics of complex networks
• Emergence of Scaling in Random Networks
• Eigenvalue spectrum of transition matrix of dual Sierpinski gaskets and its applications
• Influences of degree inhomogeneity on average path length and random walks in disassortative scale-free networks
• Kemeny's Constant and the Random Surfer
• The Structure and Function of Complex Networks
• First-passage properties of the Erdos–Renyi random graph
• EXACT FORMULA FOR THE MEAN LENGTH OF A RANDOM WALK ON THE SIERPINSKI TOWER
• Random Walks on Lattices. III. Calculation of First-Passage Times with Application to Exciton Trapping on Photosynthetic Units
• Spectra of random graphs with given expected degrees
• Networks

This page was built for publication: Optimal and suboptimal networks for efficient navigation measured by mean-first passage time of random walks