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

DOI10.1002/NET.20461zbMATH Open1251.68037OpenAlexW2117822229MaRDI QIDQ4648693FDOQ4648693

Authors:

Publication date: 15 November 2012

Published in: Networks (Search for Journal in Brave)

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

Recommendations

• Performance of random walks in one-hop replication networks
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• Improving resource location with locally precomputed partial random walks
• Numerical evaluation of the random walk search algorithm
• Random walk search in unstructured P2P

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) Random walks on graphs (05C81) Network design and communication in computer systems (68M10)

Cites Work

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

Cited In (17)

• Kinetic growth walks on complex networks
• Analytical results for the distribution of first hitting times of random walks on random regular graphs
• The distribution of path lengths of self avoiding walks on Erdős-Rényi networks
• How information prospection facilitates spatial coverage of self-avoiding walks
• Mean first passage time of preferential random walks on complex networks with applications
• The distribution of first hitting times of randomwalks on Erdős-Rényi networks
• The distribution of first hitting times of non-backtracking random walks on Erdos-Rényi networks
• Numerical evaluation of the random walk search algorithm
• Minimization of spatial cover times for impaired self-avoiding random walks: the mirage effect
• Complex network classification using partially self-avoiding deterministic walks
• Comparison of multiple random walks strategies for searching networks
• Knowledge acquisition: a complex networks approach
• Branching processes reveal influential nodes in social networks
• Analytical results for the distribution of cover times of random walks on random regular graphs
• Improving resource location with locally precomputed partial random walks
• Performance of random walks in one-hop replication networks
• Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

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

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