Mean first passage time of preferential random walks on complex networks with applications
From MaRDI portal
Publication:1993191
DOI10.1155/2017/8217361zbMath1426.60099OpenAlexW2749738828MaRDI QIDQ1993191
Guanglin Zhang, Gaoxi Xiao, Zhongtuan Zheng, Kaizhong Jiang, Guo-Qiang Wang
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/8217361
Sums of independent random variables; random walks (60G50) Stochastic network models in operations research (90B15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of multiple random walks strategies for searching networks
- Adaptive tracking control for switched stochastic nonlinear systems with unknown actuator dead-zone
- Complex networks: structure and dynamics
- Random walks on generalized Koch networks
- Interplay between collective behavior and spreading dynamics on complex networks
- Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Finite Markov Chains and Algorithmic Applications
- A model of self‐avoiding random walks for searching complex networks
- Collective dynamics of ‘small-world’ networks
- Probability