Trapping in complex networks
| dc.creator | Kittas, Aristotelis | |
| dc.creator | Carmi, Shai | |
| dc.creator | Havlin, Shlomo | |
| dc.creator | Argyrakis, Panos | |
| dc.date | 2008-08-12 | |
| dc.date | 2008-11-17 | |
| dc.date.accessioned | 2026-07-07T10:18:18Z | |
| dc.date.available | 2026-07-07T10:18:18Z | |
| dc.description | We investigate the trapping problem in Erdos-Renyi (ER) and Scale-Free (SF) networks. We calculate the evolution of the particle density $ρ(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 $ρ(t) \propto \exp(-Act)$, for longer times $ρ(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: $ρ(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 $ρ(t)\propto\exp\left[-At/N^\frac{γ-2}{γ-1}\av{k}\right]$ for all $γ>2$, where $γ$ is the exponent of the degree distribution $P(k)\propto k^{-γ}$. | |
| dc.description | Appendix added | |
| dc.identifier | https://arxiv.org/abs/0808.1736 | |
| dc.identifier | http://arxiv.org/abs/0808.1736 | |
| dc.identifier | Europhys. Lett. 84, 40008 (2008) | |
| dc.identifier | doi:10.1209/0295-5075/84/40008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/174143 | |
| dc.subject | Disordered Systems and Neural Networks | |
| dc.subject | Statistical Mechanics | |
| dc.title | Trapping in complex networks | |
| dc.type | text |