Comparison of multiple random walks strategies for searching networks

DOI10.1155/2013/734630zbMath1299.90367OpenAlexW2150887734WikidataQ59028752 ScholiaQ59028752MaRDI QIDQ474593

Zhongtuan Zheng, Shengguo Gao, Han-xing Wang, Guo-Qiang Wang

Publication date: 24 November 2014

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/734630

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Markov and semi-Markov decision processes (90C40)

Related Items

WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS ⋮ Mean first passage time of preferential random walks on complex networks with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Tight bounds for the cover time of multiple random walks
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
• The hitting and cover times of random walks on finite graphs using local degree information
• An introduction to order statistics
• Complex networks: structure and dynamics
• Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
• Critical line in undirected Kauffman Boolean networks — the role of percolation
• On the Cover Time for Random Walks on Random Graphs
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS

This page was built for publication: Comparison of multiple random walks strategies for searching networks