Local Search in Unstructured Networks
Lada A. Adamic, Rajan M. Lukose, Bernardo A. Huberman
Abstract
We review a number of message-passing algorithms that can be used to search through power-law networks. Most of these algorithms are meant to be improvements for peer-to-peer file sharing systems, and some may also shed some light on how unstructured social networks with certain topologies might function relatively efficiently with local information. Like the networks that they are designed for, these algorithms are completely decentralized, and they exploit the power-law link distribution in the node degree. We demonstrate that some of these search algorithms can work well on real Gnutella networks, scale sub-linearly with the number of nodes, and may help reduce the network search traffic that tends to cripple such networks.
Create a lesson
Related papers
Optical Ceiling on Polaron Mobility in Disordered Molecular Semiconductors: Lessons from Eumelanin
Alvan Hunt
Glauber dynamics of the Sherrington--Kirkpatrick spin-glass model: a dynamical cavity method
Grzegorz Szamel
Generative diffusion in long-range correlated landscapes: Speciation cascade and the foam structure of the score
Jerome Garnier-Brun, Giulio Biroli, Marc Mézard et al.
A Clifford-index approach connecting boundary Dirac fermions to sigma-model topological terms in the periodic table of topological insulators and superconductors
Y. X. Zhao
Exact solution of the dynamic pseudogap model: Fock-space formalism for Gaussian fluctuations
Michael V. Sadovskii
Covariance-dependent participation scaling of Comtet disorder on open hyperbolic lattices
Wei Li, Yong Cheng