Pages that link to "Item:Q4648693"
From MaRDI portal
The following pages link to A model of self‐avoiding random walks for searching complex networks (Q4648693):
Displaying 10 items.
- Improving resource location with locally precomputed partial random walks (Q497106) (← links)
- Knowledge acquisition: a complex networks approach (Q780982) (← links)
- Mean first passage time of preferential random walks on complex networks with applications (Q1993191) (← links)
- The distribution of first hitting times of randomwalks on Erdős–Rényi networks (Q2979696) (← links)
- Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect (Q5006961) (← links)
- Analytical results for the distribution of cover times of random walks on random regular graphs (Q5049469) (← links)
- The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks (Q5272490) (← links)
- How information prospection facilitates spatial coverage of self-avoiding walks (Q5860297) (← links)
- Analytical results for the distribution of first hitting times of random walks on random regular graphs (Q5877020) (← links)
- Branching processes reveal influential nodes in social networks (Q6492041) (← links)
