Search in social networks using MCMC algorithm

DOI10.3724/SP.J.1087.2008.02600MaRDI QIDQ5188908zbMATH OpenOpenAlexFDO

Authors Kunpeng Li, Ning Zhang

Publication date 6 March 2010

Published in Journal of Computer Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3724/sp.j.1087.2008.02600

zbMATH Keywords

complex networksgreedy routingMonte-Carlo algorithmsmall world

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Depth of Field and Cautious-Greedy Routing in Social Networks
• On the searchability of small-world networks with arbitrary underlying structure
• Distributed routing in small-world networks
• Navigating Low-Dimensional and Hierarchical Population Networks
• The small-world phenomenon: an algorithmic perspective

Cited in

(1)

• Search for MC in modified networks

This page was built for publication: Search in social networks using MCMC algorithm

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