Searching efficiency on complex networks under visual range of nodes

DOI10.1142/S0129183111017032MaRDI QIDQ4914205zbMATH OpenOpenAlexFDO

Authors Bin Liu, Hongzhong Deng, Xiao Yue Wu

Publication date 18 April 2013

Published in International Journal of Modern Physics C (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129183111017032

zbMATH Keywords

complex networksefficiencysearchtopologyvisual range

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)

Recommendations

• Non-searchability of random scale-free graphs
• Search and congestion in complex networks
• Comparison of multiple random walks strategies for searching networks
• Searchability of central nodes in networks
• On the searchability of small-world networks with arbitrary underlying structure

Cites work

• Complex networks: structure and dynamics
• Efficient routing on scale-free networks based on local information
• scientific article; zbMATH DE number 1866312 (Why is no real title available?)
• Software -- A performing science?
• Statistical mechanics of complex networks
• The Structure and Function of Complex Networks

Cited in

(1)

• Searching on patch networks using correlated random walks: space usage and optimal foraging predictions using Markov chain models

This page was built for publication: Searching efficiency on complex networks under visual range of nodes

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