The critical branching random walk in a random environment dies out

نویسندگان

  • Olivier Garet
  • Régine Marchand
  • OLIVIER GARET
چکیده

We study the possibility for branching random walks in random environment (BRWRE) to survive. The particles perform simple symmetric random walks on the d-dimensional integer lattice, while at each time unit, they split into independent copies according to time-space i.i.d. offspring distributions. As noted by Comets and Yoshida, the BRWRE is naturally associated with the directed polymers in random environment (DPRE), for which the quantity Ψ called the free energy is well studied. Comets and Yoshida proved that there is no survival when Ψ < 0 and that survival is possible when Ψ > 0. We proved here that, except for degenerate cases, the BRWRE always die when Ψ = 0. This solves a conjecture of Comets and Yoshida.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A criterion for transience of multidimensional branching random walk in random environment

We develop a criterion for transience for a general model of branching Markov chains. In the case of multi-dimensional branching random walk in random environment (BRWRE) this criterion becomes explicit. In particular, we show that Condition L of Comets and Popov [3] is necessary and sufficient for transience as conjectured. Furthermore, the criterion applies to two important classes of branchi...

متن کامل

Characterization of the Critical Values of Branching Random Walks on Weighted Graphs through Infinite-type Branching Processes

We study the branching random walk on weighted graphs; site-breeding and edgebreeding branching random walks on graphs are seen as particular cases. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locall...

متن کامل

Central Limit Theorem in Multitype Branching Random Walk

A discrete time multitype (p-type) branching random walk on the real line R&nbsp;is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.

متن کامل

The almost sure limits of the minimal position and the additive martingale in a branching random walk

Let {V (u), u ∈ T} be a discrete-time branching random walk on the real line R, where T is an Ulam-Harris tree which describes the genealogy of the particles and V (u) ∈ R is the position of the particle u. When a particle u is at n-th generation, we write |u| = n for n ≥ 0. The branching random walk V can be described as follows: At the beginning, there is a single particle ∅ located at 0. The...

متن کامل

Critical behaviors and critical values of branching random walks on multigraphs

We consider weak and strong survival for branching random walks on multigraphs with bounded degree. We prove that, at the strong critical value, the process dies out locally almost surely. We relate the weak critical value to a geometrical parameter of the multigraph. For a large class of multigraphs (which enlarges the class of quasi-transitive or regular graphs) we prove that, at the weak cri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013