ترغب بنشر مسار تعليمي؟ اضغط هنا

Recurrence and Density Decay for Diffusion-Limited Annihilating Systems

179   0   0.0 ( 0 )
 نشر من قبل Leonardo Rolla
 تاريخ النشر 2013
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

We study an infinite system of moving particles, where each particle is of type A or B. Particles perform independent random walks at rates D_A>0 and D_B>0, and the interaction is given by mutual annihilation A+B->0. The initial condition is i.i.d. with finite first moment. We show that this system is site-recurrent, that is, each site is visited infinitely many times. We also generalize a lower bound on the density decay of Bramson and Lebowitz by considering a construction that handles different jump rates.



قيم البحث

اقرأ أيضاً

Place an $A$-particle at each site of a graph independently with probability $p$ and otherwise place a $B$-particle. $A$- and $B$-particles perform independent continuous time random walks at rates $lambda_A$ and $lambda_B$, respectively, and annihil ate upon colliding with a particle of opposite type. Bramson and Lebowitz studied the setting $lambda_A = lambda_B$ in the early 1990s. Despite recent progress, many basic questions remain unanswered for when $lambda_A eq lambda_B$. For the critical case $p=1/2$ on low-dimensional integer lattices, we give a lower bound on the expected number of particles at the origin that matches physicists predictions. For the process with $lambda_B=0$ on the integers and the bidirected regular tree, we give sharp upper and lower bounds for the expected total occupation time of the root at and approaching criticality.
We consider diffusion-limited annihilating systems with mobile $A$-particles and stationary $B$-particles placed throughout a graph. Mutual annihilation occurs whenever an $A$-particle meets a $B$-particle. Such systems, when ran in discrete time, ar e also referred to as parking processes. We show for a broad family of graphs and random walk kernels that augmenting either the size or variability of the initial placements of particles increases the total occupation time by $A$-particles of a given subset of the graph. A corollary is that the same phenomenon occurs with the total lifespan of all particles in internal diffusion-limited aggregation.
The change from the diffusion-limited to the reaction-limited cooperative behaviour in reaction-diffusion systems is analysed by comparing the universal long-time behaviour of the coagulation-diffusion process on a chain and on the Bethe lattice. On a chain, this model is exactly solvable through the empty-interval method. This method can be extended to the Bethe lattice, in the ben-Avraham-Glasser approximation. On the Bethe lattice, the analysis of the Laplace-transformed time-dependent particle-density is analogous to the study of the stationary state, if a stochastic reset to a configuration of uncorrelated particles is added. In this stationary state logarithmic corrections to scaling are found, as expected for systems at the upper critical dimension. Analogous results hold true for the time-integrated particle-density. The crossover scaling functions and the associated effective exponents between the chain and the Bethe lattice are derived.
In this paper we consider three classes of interacting particle systems on $mathbb Z$: independent random walks, the exclusion process, and the inclusion process. We allow particles to switch their jump rate (the rate identifies the type of particle) between $1$ (fast particles) and $epsilonin[0,1]$ (slow particles). The switch between the two jump rates happens at rate $gammain(0,infty)$. In the exclusion process, the interaction is such that each site can be occupied by at most one particle of each type. In the inclusion process, the interaction takes places between particles of the same type at different sites and between particles of different type at the same site. We derive the macroscopic limit equations for the three systems, obtained after scaling space by $N^{-1}$, time by $N^2$, the switching rate by $N^{-2}$, and letting $Ntoinfty$. The limit equations for the macroscopic densities associated to the fast and slow particles is the well-studied double diffusivity model. This system of reaction-diffusion equations was introduced to model polycrystal diffusion and dislocation pipe diffusion, with the goal to overcome the limitations imposed by Ficks law. In order to investigate the microscopic out-of-equilibrium properties, we analyse the system on $[N]={1,ldots,N}$, adding boundary reservoirs at sites $1$ and $N$ of fast and slow particles, respectively. Inside $[N]$ particles move as before, but now particles are injected and absorbed at sites $1$ and $N$ with prescribed rates that depend on the particle type. We compute the steady-state density profile and the steady-state current. It turns out that uphill diffusion is possible, i.e., the total flow can be in the direction of increasing total density. This phenomenon, which cannot occur in a single-type particle system, is a violation of Ficks law made possible by the switching between types.
We consider reversible random walks in random environment obtained from symmetric long--range jump rates on a random point process. We prove almost sure transience and recurrence results under suitable assumptions on the point process and the jump ra te function. For recurrent models we obtain almost sure estimates on effective resistances in finite boxes. For transient models we construct explicit fluxes with finite energy on the associated electrical network.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا