Trapping in complex networks

Details Trapping in complex networks Trapping in complex networks

2008-08-12

arxiv.org/abs/0808.1736v2

Europhys. Lett. 84, 40008 (2008)

Physics

Condensed Matter

Disordered Systems and Neural Networks

Appendix added

Scientific paper

10.1209/0295-5075/84/40008

We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $\rho(t)$ of random walkers in the presence of one or multiple traps with concentration $c$. We show using theory and simulations that in ER networks, while for short times $\rho(t) \propto \exp(-Act)$, for longer times $\rho(t)$ exhibits a more complex behavior, with explicit dependence on both the number of traps and the size of the network. In SF networks we reveal the significant impact of the trap's location: $\rho(t)$ is drastically different when a trap is placed on a random node compared to the case of the trap being on the node with the maximum connectivity. For the latter case we find $\rho(t)\propto\exp\left[-At/N^\frac{\gamma-2}{\gamma-1}\av{k}\right]$ for all $\gamma>2$, where $\gamma$ is the exponent of the degree distribution $P(k)\propto k^{-\gamma}$.

Affiliated with

Also associated with

No associations

Rating

Trapping in complex networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Trapping in complex networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trapping in complex networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-386032