Comparison of multiple random walks strategies for searching networks
From MaRDI portal
Publication:474593
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
Cites work
- scientific article; zbMATH DE number 878897 (Why is no real title available?)
- A random walk model for infection on graphs: spread of epidemics \& rumours with mobile agents
- An introduction to order statistics
- CONGESTION AND CENTRALITY IN TRAFFIC FLOW ON COMPLEX NETWORKS
- Complex networks: structure and dynamics
- Critical line in undirected Kauffman Boolean networks — the role of percolation
- On the Cover Time for Random Walks on Random Graphs
- Residual mean first-passage time for jump processes: theory and applications to Lévy flights and fractional Brownian motion
- Search and congestion in complex networks
- The hitting and cover times of random walks on finite graphs using local degree information
- Tight bounds for the cover time of multiple random walks
Cited in
(6)- Searching efficiency on complex networks under visual range of nodes
- Mean first passage time of preferential random walks on complex networks with applications
- WEIGHT-DEPENDENT WALKS AND AVERAGE SHORTEST WEIGHTED PATH ON THE WEIGHTED ITERATED FRIENDSHIP GRAPHS
- Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models
- Switcher random walkers: cognitive inspired strategies for an optimized random exploration of networks
- Search for MC in modified networks
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)
