Diffusive capture processes for information search
arXiv:physics/0703040 · doi:10.1016/j.physa.2007.07.022
Abstract
We show how effectively the diffusive capture processes (DCP) on complex networks can be applied to information search in the networks. Numerical simulations show that our method generates only 2% of traffic compared with the most popular flooding-based query-packet-forwarding (FB) algorithm. We find that the average searching time, , of the our model is more scalable than another well known -random walker model and comparable to the FB algorithm both on real Gnutella network and scale-free networks with . We also discuss the possible relationship between and , the second moment of the degree distribution of the networks.
References in corpus (19)
- Statistical mechanics of complex networks
- Resilience of the Internet to random breakdowns
- Scale-free brain functional networks
- Universal Behavior of Load Distribution in Scale-free Networks
- Search in Power-Law Networks
- Optimal network topologies for local search with congestion
- Statistical properties of sampled networks
- Percolation Critical Exponents in Scale-Free Networks
- Ferromagnetic ordering in graphs with arbitrary degree distribution
- Exploring complex networks by walking on them
- Critical phenomena in networks
- Sampling properties of random graphs: the degree distribution
- Capture of the Lamb: Diffusing Predators Seeking a Diffusing Prey
- Kinetics of a Diffusive Capture Process: Lamb Besieged by a Pride of Lions
- Statistical properties of sampled networks by random walks
- Self-avoiding walks on scale-free networks
- Search in weighted complex networks
- Diffusive Capture Process on Complex Networks
- Condensation phase transitions of symmetric conserved-mass aggregation model on complex networks