Comparison of multiple random walks strategies for searching networks

DOI10.1155/2013/734630zbMATH Open1299.90367OpenAlexW2150887734WikidataQ59028752 ScholiaQ59028752MaRDI QIDQ474593FDOQ474593

Authors: Zhongtuan Zheng, Shengguo Gao, Hanxing Wang, Guoqiang 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

Recommendations

• Mean first passage time of preferential random walks on complex networks with applications
• A model of self-avoiding random walks for searching complex networks
• Performance of random walks in one-hop replication networks
• scientific article; zbMATH DE number 5846201
• Random walks and diffusion on networks

Mathematics Subject Classification ID

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

Cites Work

• Complex networks: structure and dynamics
• An introduction to order statistics
• Tight bounds for the cover time of multiple random walks
• Title not available (Why is that?)
• The hitting and cover times of random walks on finite graphs using local degree information
• 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
• Search and congestion in complex networks
• CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
• A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents

Cited In (6)

• Mean first passage time of preferential random walks on complex networks with applications
• Search for MC in modified networks
• WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS
• Switcher random walkers: cognitive inspired strategies for an optimized random exploration of networks
• Searching efficiency on complex networks under visual range of nodes
• Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q474593)