A model of self‐avoiding random walks for searching complex networks

DOI10.1002/net.20461zbMath1251.68037OpenAlexW2117822229MaRDI QIDQ4648693

No author found.

Publication date: 15 November 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10234/68540

zbMATH Keywords

random walkself-avoiding random walkresource locationnetwork searchaverage search lengthone-hop replication

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Random walks on graphs (05C81)

Related Items (9)

Analytical results for the distribution of cover times of random walks on random regular graphs ⋮ The distribution of first hitting times of randomwalks on Erdős–Rényi networks ⋮ Improving resource location with locally precomputed partial random walks ⋮ Mean first passage time of preferential random walks on complex networks with applications ⋮ Knowledge acquisition: a complex networks approach ⋮ Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect ⋮ How information prospection facilitates spatial coverage of self-avoiding walks ⋮ The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks ⋮ Analytical results for the distribution of first hitting times of random walks on random regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Performance of random walks in one-hop replication networks
• The diffusion of self-avoiding random walk in high dimensions
• On the cover time of random walks on graphs
• Lower bounds for covering times for reversible Markov chains and random walks on graphs
• Transport properties of random walks on scale-free/regular-lattice hybrid networks
• RANDOM WALKS ON DIRECTED NETWORKS: THE CASE OF PAGERANK
• Know thy neighbor's neighbor
• Maximum hitting time for random walks on graphs
• A Technique for Lower Bounding the Cover Time
• A tight lower bound on the cover time for random walks on graphs
• Short random walks on graphs

This page was built for publication: A model of self‐avoiding random walks for searching complex networks