TY - JOUR

T1 - Diffusion, annihilation, and chemical reactions in complex networks with spatial constraints

AU - Emmerich, Thorsten

AU - Bunde, Armin

AU - Havlin, Shlomo

PY - 2012/10/10

Y1 - 2012/10/10

N2 - We consider Erdos-Rényi-type networks embedded in one-dimensional (d e=1) and two-dimensional (d e=2) Euclidean space with the link-length distribution p(r)∼r -δ. The dimension d of these networks, as a function of δ, has been studied earlier and has been shown to depend on δ. Here we consider diffusion, annihilation, and chemical reaction processes on these spatially constrained networks and show that their dynamics is controlled by the dimension d of the system. We study, as a function of the exponent δ and the embedding dimension d e, the average distance r 1/dw a random walker has traveled after t time steps as well as the probability of the random walker's return to the origin P 0(t). From these quantities we determine the network dimension d and the dimension d w of the random walk as a function of δ. We find that the fraction d/d w governs the number of survivors as a function of time t in the annihilation process (A+A→0) and in the chemical reaction process (A+B→0), showing that the relations derived for ordered and disordered lattices with short-range links remain valid also in the case of complex embedded networks with long-range links.

AB - We consider Erdos-Rényi-type networks embedded in one-dimensional (d e=1) and two-dimensional (d e=2) Euclidean space with the link-length distribution p(r)∼r -δ. The dimension d of these networks, as a function of δ, has been studied earlier and has been shown to depend on δ. Here we consider diffusion, annihilation, and chemical reaction processes on these spatially constrained networks and show that their dynamics is controlled by the dimension d of the system. We study, as a function of the exponent δ and the embedding dimension d e, the average distance r 1/dw a random walker has traveled after t time steps as well as the probability of the random walker's return to the origin P 0(t). From these quantities we determine the network dimension d and the dimension d w of the random walk as a function of δ. We find that the fraction d/d w governs the number of survivors as a function of time t in the annihilation process (A+A→0) and in the chemical reaction process (A+B→0), showing that the relations derived for ordered and disordered lattices with short-range links remain valid also in the case of complex embedded networks with long-range links.

UR - http://www.scopus.com/inward/record.url?scp=84867437128&partnerID=8YFLogxK

U2 - 10.1103/physreve.86.046103

DO - 10.1103/physreve.86.046103

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:84867437128

SN - 1539-3755

VL - 86

JO - Physical Review E

JF - Physical Review E

IS - 4

M1 - 046103

ER -