اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدApproximating critical parameters of branching random walks
69
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most $m$ particles per site. We investigate the convergence of weak and strong critical parameters of these truncated branching random walks to the analogous parameters of the original branching random walk. As a corollary, we apply our results to the study of the strong critical parameter of a branching random walk restricted to the cluster of a Bernoulli bond percolation.
قيم البحث
اقرأ أيضاً
The reproduction speed of a continuous-time branching random walk is proportional to a positive parameter $lambda$. There is a threshold for $lambda$, which is called $lambda_w$, that separates almost sure global extinction from global survival. Anal
ogously, there exists another threshold $lambda_s$ below which any site is visited almost surely a finite number of times (i.e.~local extinction) while above it there is a positive probability of visiting every site infinitely many times. The local critical parameter $lambda_s$ is completely understood and can be computed as a function of the reproduction rates. On the other hand, only for some classes of branching random walks it is known that the global critical parameter $lambda_w$ is the inverse of a certain function of the reproduction rates, which we denote by $K_w$. We provide here new sufficient conditions which guarantee that the global critical parameter equals $1/K_w$. This result extends previously known results for branching random walks on multigraphs and general branching random walks. We show that these sufficient conditions are satisfied by periodic tree-like branching random walks. We also discuss the critical parameter and the critical behaviour of continuous-time branching processes in varying environment. So far, only examples where $lambda_w=1/K_w$ were known; here we provide an example where $lambda_w>1/K_w$.
We study survival of nearest-neighbour branching random walks in random environment (BRWRE) on ${mathbb Z}$. A priori there are three different regimes of survival: global survival, local survival, and strong local survival. We show that local and st
rong local survival regimes coincide for BRWRE and that they can be characterized with the spectral radius of the first moment matrix of the process. These results are generalizations of the classification of BRWRE in recurrent and transient regimes. Our main result is a characterization of global survival that is given in terms of Lyapunov exponents of an infinite product of i.i.d. $2times 2$ random matrices.
We study the branching random walk on weighted graphs; site-breeding and edge-breeding 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 character
ize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locally almost surely; while, at the weak critical value, global survival and global extinction are both possible.
We consider branching random walks in $d$-dimensional integer lattice with time-space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If $d ge 3$ and the environment is not too random, then, the total population gro
ws as fast as its expectation with strictly positive probability. If,on the other hand, $d le 2$, or the environment is ``random enough, then the total population grows strictly slower than its expectation almost surely. We show the equivalence between the slow population growth and a natural localization property in terms of replica overlap. We also prove a certain stronger localization property, whenever the total population grows strictly slower than its expectation almost surely.
We study the limiting occupation density process for a large number of critical and driftless branching random walks. We show that the rescaled occupation densities of $lfloor sNrfloor$ branching random walks, viewed as a function-valued, increasing
process ${g_{s}^{N}}_{sge 0}$, converges weakly to a pure jump process in the Skorohod space $mathbb D([0, +infty), mathcal C_{0}(mathbb R))$, as $Ntoinfty$. Moreover, the jumps of the limiting process consist of i.i.d. copies of an Integrated super-Brownian Excursion (ISE) density, rescaled and weighted by the jump sizes in a real-valued stable-1/2 subordinator.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
