Consider a branching random walk with a mechanism of elimination. We assume that the underlying Galton-Watson process is supercritical, thus the branching random walk has a positive survival probability. A mechanism of elimination, which is called a barrier, is introduced to erase the particles who lie above ri+εiα and all their descendants, where i presents the generation of the particles, α>1/3,ε∈R and r is the asymptotic speed of the left-most position of the branching random walk. First we show that the particle system still has a positive survival probability after we introduce the barrier with ε>0. Moreover, we show that the decay of the probability is faster than e−β′εβ as ε↓0, where β′,β are two positive constants depending on the branching random walk and α. The result in the present paper extends a conclusion in Gantert et al. (2011) in some extent. Our proof also works for some time-inhomogeneous cases.
Citation: You Lv. Asymptotic behavior of survival probability for a branching random walk with a barrier[J]. AIMS Mathematics, 2023, 8(2): 5049-5059. doi: 10.3934/math.2023253
[1] | Najmeddine Attia . Some remarks on recursive sequence of fibonacci type. AIMS Mathematics, 2024, 9(9): 25834-25848. doi: 10.3934/math.20241262 |
[2] | He Song, Longmin Wang, Kainan Xiang, Qingpei Zang . The continuity of biased random walk's spectral radius on free product graphs. AIMS Mathematics, 2024, 9(7): 19529-19545. doi: 10.3934/math.2024952 |
[3] | Chahn Yong Jung, Muhammad Shoaib Saleem, Shamas Bilal, Waqas Nazeer, Mamoona Ghafoor . Some properties of η-convex stochastic processes. AIMS Mathematics, 2021, 6(1): 726-736. doi: 10.3934/math.2021044 |
[4] | Najmeddine Attia, Amal Mahjoub . On the vectorial multifractal analysis in a metric space. AIMS Mathematics, 2023, 8(10): 23548-23565. doi: 10.3934/math.20231197 |
[5] | Andrius Grigutis . Exact expression of ultimate time survival probability in homogeneous discrete-time risk model. AIMS Mathematics, 2023, 8(3): 5181-5199. doi: 10.3934/math.2023260 |
[6] | Xiangqi Zheng . On the extinction of continuous-state branching processes in random environments. AIMS Mathematics, 2021, 6(1): 156-167. doi: 10.3934/math.2021011 |
[7] | Frithjof Lutscher, Thomas Hillen . Correlated random walks in heterogeneous landscapes: Derivation, homogenization, and invasion fronts. AIMS Mathematics, 2021, 6(8): 8920-8948. doi: 10.3934/math.2021518 |
[8] | Mohamed Abdelkader, Rafik Aguech . Moran random walk with reset and short memory. AIMS Mathematics, 2024, 9(8): 19888-19910. doi: 10.3934/math.2024971 |
[9] | István Fazekas, Attila Barta, László Fórián, Bettina Porvázsnyik . A continuous-time network evolution model describing $ N $-interactions. AIMS Mathematics, 2024, 9(12): 35721-35742. doi: 10.3934/math.20241695 |
[10] | Monthira Duangsaphon, Sukit Sokampang, Kannat Na Bangchang . Bayesian estimation for median discrete Weibull regression model. AIMS Mathematics, 2024, 9(1): 270-288. doi: 10.3934/math.2024016 |
Consider a branching random walk with a mechanism of elimination. We assume that the underlying Galton-Watson process is supercritical, thus the branching random walk has a positive survival probability. A mechanism of elimination, which is called a barrier, is introduced to erase the particles who lie above ri+εiα and all their descendants, where i presents the generation of the particles, α>1/3,ε∈R and r is the asymptotic speed of the left-most position of the branching random walk. First we show that the particle system still has a positive survival probability after we introduce the barrier with ε>0. Moreover, we show that the decay of the probability is faster than e−β′εβ as ε↓0, where β′,β are two positive constants depending on the branching random walk and α. The result in the present paper extends a conclusion in Gantert et al. (2011) in some extent. Our proof also works for some time-inhomogeneous cases.
We consider the branching random walk (BRW) on R. At time 0, an initial ancestor (denoted by ϕ) is located at the origin. At time 1, the ancestor dies and reproduces (including the number and displacement of its children) according to the distribution of a point process L, i.e., ϕ gives birth to N(ϕ) children who are located at ζi(ϕ),1≤i≤N(ϕ) (N(ϕ) can be 0) and the law of the random vector (N(ϕ),ζi(ϕ),1≤i≤N(ϕ)) is L. These children (also called particles) consist the first generation. Each of the particles in the first generation reproduces its own children who are thus in the second generation and are positioned (with respect to their parent) according to the same distribution of L. All particles reproduce independently according to the same law L as time goes on. The particle system formed in this way is called a (time-homogeneous) branching random walk. Hence BRW can be viewed as that we attach a displacement information to each particle in a Galton-Watson tree T. For a given particle u∈T we write V(u)∈R for the position of u and |u| for the generation at which u is alive. In the present paper, we focus on the barrier problem of BRW and a more general time-inhomogeneous model. The so-called barrier is in fact a function f:N→R. For any realization of the BRW, if a particle u satisfies V(u)>f(|u|), then we remove u and all its descendants. The surviving particles (i.e., which have not been removed) form a new system, which is called a BRW with barrier. For any i≤|u|, we conventionally write ui for the ancestor of u in generation i. It is evident to see that u is survival if and only if V(ui)≤f(i),∀i≤|u|. Let κ be the log−Laplace transform of L, that is to say
κ(θ):=logE(∑l∈Le−θl). |
Obviously, another equivalent expression of κ(θ) is κ(θ)=logE(∑|u|=1e−θV(u)). We always assume that
κ(0)∈(0,∞), | (1.1) |
which means that the underlying Galton-Watson process is supercritical, i.e., the survival probability of the particle system (BRW) is positive. Under the assumption that there exists ϑ>0 such that
κ(ϑ)=ϑκ′(ϑ),κ(ϑ)<+∞, | (1.2) |
where κ′ presents the derivative of κ. Hammersley [1], Kingman [2] and Biggins [3] showed that
limn→∞n−1minu∈T,|u|=nV(u)=−κ′(ϑ),non-extinction. | (1.3) |
The above result enlightens the approach for the barrier problem, which is a topic motivated by the parallel simulation, see Lubachevsky et al. [4,5]. We first introduce some notations before we recall some achieved results on the barrier problem of BRW. On the Galton-Watson tree T we define a partial order > such that u>v if v is the ancestor of u. We write u≥v if u>v or u=v (i.e., the particle u is exactly the particle v). Define an infinite path u∞ through the tree T as a sequence of particles (ui)i∈N such that
u0=ϕ,∀i∈N,|ui|=i,ui+1>ui. |
We write T∞ the collection of the infinite path. Let
ρ(ε,α):=P(∃u∞∈T∞,∀i∈N,V(ui)≤εiα−κ′(ϑ)i). |
Hence one see that ρ(ε,α) presents the survival probability for the BRW with a barrier
f(i):=εiα−κ′(ϑ)i. |
The first result on the the barrier problem of BRW can be found in Biggins et al. [6]. Under Assumptions (1.1) and (1.2) they claimed that
ρ(ε,1)>0whenε>0,ρ(ε,1)=0whenε≤0. | (1.4) |
From the view of (1.3), we can have a better understanding on this conclusion. That is to say, when critical slope of the barrier is determined by the first order of minu∈T,|u|=nV(u). Under a slightly stronger assumption, Jaffuel [7] refine the result (1.4). [7] showed that under (1.1), (1.2) and the assumption
∃δ>0,E(N1+δ(ϕ))<+∞,κ(ϑ+δ)<+∞,κ″(ϑ)∈(0,∞). | (1.5) |
It is true that
ρ(ε,1/3)>0whenε>aκ″(ϑ),ρ(ε,1/3)=0whenε<aκ″(ϑ), | (1.6) |
where the explicit form of the positive constant aκ″(ϑ) (depending on κ″(ϑ)) is obtained. Combining (1.6) with (1.4), we can prove the following statement.
Proposition 1.1. If (1.1), (1.2) and (1.5) hold, then ρ(ε,α)>0 when ε>0,α>1/3.
Proof. It is obvious when α>1 since the definition domain of the barrier f is N. Now we deal with the case α∈(1/3,1). Let ˉa be a constant such that ˉa∈(aκ″(ϑ),ε). Define
j:=maxn∈N+{(ˉa)1αn13α−ε1αn}. |
We see j is finite since α>1/3. Choose k large enough such that k>jε−1α, which ensures that ε(n+k)α>ˉan1/3,∀n∈N+. Note that
minn∈N+(ε(n+k)α−ˉan1/3)>0, |
we can find a−>0 small enough such that
ε(n+k)α>a−k+ˉan1/3,∀n∈N+anda−<min{εkα−1,ε}. |
Hence it is true that εiα>a−i for 1≤i≤k and εiα>a−k+ˉa(i−k)1/3 for i>k. By Markov property we see
ρ(ε,α)=P(∃u∈T∞,∀i∈N,V(ui)≤εiα+ri)≥P(∃|u|=k,∀i≤k,V(ui)≤a−i+ri)×P(∃u∈T∞,∀i∈N,V(ui)≤ˉai1/3+a−k+r(i+k)|V(ϕ)=a−k+rk):=P1×P2. |
(1.4) tells us that P1>0 and (1.6) means that P2>0, hence we have ρ(ε,α)>0.
The decay rate of ρ(ε,1) had been obtained in Gantert et al. [8]. When (1.1) and (1.2) hold, [8] obtained the explicit negative constant c such that
¯limε↓0√εlogρ(ε,1)≤c. |
(We remind that under (1.1), (1.2), (1.5) and some extra assumptions, the lower bound of ρ(ε,1) had also been obtained in [8].) In the present paper, we want to extend the upper bound of the rate to some non-linear barrier. It is evident to see that ρ(ε,α)=0,∀α>0 when ε=0 and ρ(ε,α) is non-decreasing on ε when the positive constant α is fixed. Combining these two facts with Proposition 1.1, we see that for any given α>1/3, it is reasonable and meaningful to ask the question about the decay rate of ρ(ε,α) as ε↓0. In the present paper, we wonder whether the decay rate of ρ(ε,α) (when α>1/3) as ε↓0 will be the same as the one of ρ(ε,1) (as ε↓0). Furthermore, if they are different, will the order be different? In other word, we want to investigate the impact of α on the decay rate. Now we give the first result in the present paper.
Theorem 1.1. If (1.1) and (1.2) hold, then for α>1, we have
¯limε↓0ε13α−1logρ(ε,α)≤−ϑ{(π2κ″(ϑ)2α2ϑ)α(3α(α−1))α−1}13α−1 | (1.7) |
and for α∈(1/3,1), we have
¯limε↓0ε13α−1logρ(ε,α)≤−ϑ(3α−1)(3ϑα)3α3α−1(3π2ϑ2κ″(ϑ)2)α3α−1. |
Remark 1.1. We remind that the limit of the right-hand-side of (1.7) as α↓1 is the exact value of the corresponding one in [8], hence our result can be viewed as an extension for the upper bound part in [8].
In fact, this asymptotic behavior can be shown for a more general model called a branching random walk with varying environment (BRWve). Let us describe the model as follows. For a sequence of time-inhomogeneous branching random walks {(T(n),V(n))}n∈N, we only consider the generations from 0 to n in (T(n),V(n)), where T(n) presents the (time-inhomogeneous) Galton CWatson tree of the genealogy of this process and V(n) the displacements of the particles in T(n). Let {Lt,t∈[0,1]} be a family of laws of point processes. All particles reproduce independently but the law of reproduce is determined in the following way. For particle u∈T(n),|u|=i<n, the reproduce law of u is Li+1n. This model has been studied in several papers. Fang and Zeitouni [9] showed that the asymptotic behavior of the maximal displacement maxu∈T(n),|u|=nV(u) under some special settings (two time intervals) on the reproduction law {Lt,t∈[0,1]}. Mallein [10] has generalized the result in [9] to more general reproduction law (a sequence of macroscopic time intervals). For a smoothly varying environment, Mallein [11] obtained a new asymptotic behavior of the maximal displacement. However, there is no result on the barrier problem of the BRWve. In the present paper, we want to extend Theorem 1.1 to some BRWve with special settings on the varying environment. Define
κt(θ):=logE(∑l∈Lte−θl). |
Assume that there exists ϑ,v>0 such that for any s,t∈[0,1],
ϑκ′t(ϑ)=κt(ϑ),κt(ϑ)=κs(ϑ)<+∞ | (1.8) |
and
supt∈[0,1]max{κt(ϑ+v),κt(ϑ−v)}<+∞. | (1.9) |
Furthermore, we assume that κ″t(ϑ) satisfies that
κ″t(ϑ)(as a function of t ) is continuous on [0,1] and mint∈[0,1]κ″t(ϑ)>0. | (1.10) |
Obviously, BRW is a special case of BRWve when the family {Lt,t∈[0,1]} is a constant one. In order to deal with the new model (BRWve), from now on we redefine the survival probability ρ(ε,α) as
ρ(ε,α):=limn→+∞mink≤nP(∃u∈T(k):|u|=k,∀i≤k,V(k)(ui)≤εiα−κ′1(ϑ)i). |
Now we give a generalized version of Theorem 1.1.
Theorem 1.2. Denote σ2−:=mint∈[0,1]ϑ2κ″t(ϑ), γσ:=π2σ2−2. If (1.8), (1.9) and (1.10) hold, then for α>1, we have
¯limε↓∞ε13α−1logρ(ε,α)≤−ϑ{(γσα2ϑ3)α(3α(α−1))α−1}13α−1 | (1.11) |
and for α∈(1/3,1), we have
¯limε↓∞ε13α−1logρ(ε,α)≤−ϑ(3α−1)(3ϑα)3α3α−1(3γσ)α3α−1. | (1.12) |
Let us give a sketch of the proof. First we give a decomposition of the survival probability of the BRWve with barrier. Secondly, we transfer BRWve to a triangular array of independent centered random variables by the version of time-inhomogeneous many-to-one formula which has been introduced in [10]. Then the survival probability will be dominated by a series of small deviation probabilities of the triangular array random variables. At last, applying a time-inhomogeneous version of small deviation principle which has been given in [11], the estimate for the upper bound will becomes a extremal problem of some continuous functions.
The many-to-one formula, which is essentially a kind of measure transformation, is a basic tool in the study of the branching random walks, It can be traced down to the early works of Peyrière [12] and Kahane and Peyrière [13]. We refer to Biggins and Kyprianou [14] for more variations of this result. Let τn,k be a random measure on R such that for any x∈R we have
τn,k((−∞,x])=E(∑l∈Lk/n1{l≤x}e−ϑl−κk/n(ϑ)), |
For any given n, we introduce a series of independent random variables {Xn,k}k∈N+,k≤n whose distributions are {τn,k}n,k∈N+ and define
S(n)k:=k∑i=1Xn,i. |
The following theorem shows the relationship between S(n)k and the BRWve.
Theorem 2.1. (Mallein [10]) For any n,k∈N+,k≤n, and a measurable function f:Rn→[0,+∞), we have
E[∑|u|=nf(V(ui),1≤i≤n)]=E[eϑSn+nκ1(ϑ)f(Si,1≤i≤n)]. |
By many-to-one formula, the barrier problem of a BRWve becomes equivalently to the small deviation problem for a time-inhomogeneous random walk.
The small deviation problem is a classic topic which attracts intensive attention for many years. We refer to Mogul'skiĭ[15], Borovkov & Mogul'skiĭ [16], Shao [17] and Lv & Hong [18] as the small deviation principle for sums of independent random variables. In our proof, a time-inhomogeneous version of a small deviation principle which has been given in [11] will be used. We state it as follows.
Theorem 2.2. (Mallein [11]) Let {˜Xn,k}n,k∈N,k≤n be a triangular array of independent centered random variables. We assume that there existsσ∈C[0,1] with σ−:=mins∈[0,1]σ(s)>0 and u>0 such that for any n,k∈N,k≤n,
E(˜X2n,k)=σ(k/n) | (2.1) |
and
supn,kE(eu|˜Xn,k|)<+∞. | (2.2) |
Set g,h∈C[0,1] and g(0)<0<h(0). Denote ˜S(n)k:=˜S0+∑ki=1˜Xn,i. Then we have
¯limn→+∞supx∈RlogP(∀i≤n,n−1/3˜S(n)i∈[g(in),h(in)]|˜S0=x)n1/3≤−π22∫10σ2(s)(h(s)−g(s))2ds. |
This conclusion extends the main result in [15] to the time-inhomogeneous case.
Recall the barrier function f(i):=εiα−κ′1(ϑ)i, hence f(i)=εiα−iκ1(ϑ)ϑ from (1.8). We define
Hj,n:=P(∃|u|∈T(n):|u|=j,V(n)(u)≤ajαnα−1/3−jκ1(ϑ)ϑ−b(n−j)1/3,∀i<j,V(n)(ui)∈[aiαnα−1/3−iκ1(ϑ)ϑ−b(n−i)1/3,aiαnα−1/3−iκ1(ϑ)ϑ]), |
H∗,n:=P(∃|u|∈T(n):|u|=n,∀i≤n,V(ui)∈[aiαnα−1/3−iκ1(ϑ)ϑ−b(n−i)1/3,aiαnα−1/3−iκ1(ϑ)ϑ]), |
where the exact value of positive constants a,b will be given later. From the definition of ρ(ε,α), we see for any n∈N, it is true that
ρ(an1/3−α,α)≤P(∃|u|∈T(n):|u|=n,∀i≤n,V(n)(ui)≤aiαnα−1/3−iκ1(ϑ)ϑ)≤n∑j=1Hj,n+H∗,n. | (3.1) |
Define T(n)i=ϑS(n)i+iκ1(ϑ). By Markov inequality and Theorem 2.2, it is true that
Hj,n=E(eT(n)j1{∀i<j,S(n)i∈[aiαnα−1/3−b(n−i)1/3−iκ1(ϑ)ϑ,aiαnα−1/3−iκ1(ϑ)ϑ],S(n)j≤ajαnα−1/3−b(n−j)1/3−jκ1(ϑ)ϑ})≤eϑajαnα−1/3−ϑb(n−j)1/3P(∀i<j,T(n)i∈[ϑaiαnα−1/3−ϑb(n−i)1/3,ϑaiαnα−1/3]). |
By the same way we get
H∗,n≤eϑan1/3P(∀i≤n,T(n)i∈[ϑaiαnα−1/3−ϑb(n−i)1/3,ϑaiαnα−1/3]). |
Note that for any n∈[Nk,(N+1)k], it is true that
logρ(an1/3−α,α)n1/3≤logρ(a(Nk)1/3−α,α)((N+1)k)1/3. | (3.2) |
Hence we have
¯limn→∞a13α−1logρ(an1/3−α,α)n1/3≤3√N3√N+1¯limk→∞a13α−1logρ(a(Nk)1/3−α,α)3√Nk. |
Taking N→∞, from (3.1) we get
¯limn→∞a13α−1logρ(an1/3−α,α)n1/3≤¯limN→∞¯limk→∞a13α−1logρ(a(Nk)1/3−α,α)3√Nk≤¯limN→∞¯limk→∞a13α−1log(∑Nkj=1Hj,Nk+H∗,Nk)3√Nk. | (3.3) |
We observe that
Nk∑j=1Hj,Nk+H∗,Nk≤N∑l=1(k+1)(eϑa(lk)α(Nk)α−1/3−ϑb(Nk−lk)1/3)×P(∀i≤(l−1)k,T(n)i∈[ϑaiα(Nk)α−1/3−ϑb(Nk−i)1/3,ϑaiα(Nk)α−1/3]). | (3.4) |
To apply Theorem 2.2, we need to verify that the sequence {T(n)i} satisfies all conditions in Theorem 2.2. According to Theorem 2.1, we see
E(Xn,i)=E(∑l∈Li/nle−ϑl)E(∑l∈Li/ne−ϑl)=−κ′i/n(ϑ). |
We observe that (1.8) and the above equality imply that
E(T(n)i−T(n)i−1)=ϑE(Xn,i)+κ1(ϑ)=−ϑκ′i/n(ϑ)+κ1(ϑ)=0, |
thus we see E(T(n)i)=0,∀i,n∈N. Moreover, Theorem 2.1 tells that
κ″i/n(ϑ)=E(∑l∈Li/nl2e−ϑl)E(∑l∈Li/ne−ϑl)−[E(∑l∈Li/nle−ϑl)]2E(∑l∈Li/ne−ϑl)2=E(X2n,i)−(E(Xn,i))2. |
Hence we have
Var(T(n)i−T(n)i−1)=ϑ2Var(S(n)i−S(n)i−1)=ϑ2Var(Xn,i)=ϑ2κ″i/n(ϑ), |
where Var presents the variation, that is to say, (1.10) ensures that {T(n)i} meets (2.1). Next we check (2.2). Note that
E(eu|T(n)i−T(n)i−1|)≤euκ1(ϑ)E(euϑ|Xn,i|) |
and
E(euϑ|Xn,i|)≤E(euϑXn,i)+E(e−uϑXn,i)=κi/n(ϑ(1−u))κi/n(ϑ)+κi/n(ϑ(1+u))κi/n(ϑ). |
Therefore, (1.9) ensures that {T(n)i} meets (2.2). We rewrite the probability in (3.4) as
P(∀i≤(l−1)k,T(n)i∈[ϑaiα(Nk)α−1/3−ϑb(Nk−i)1/3,ϑaiα(Nk)α−1/3])=P(∀i≤(l−1)k,T(n)i[(l−1)k]1/3−(l−1N)2/3ϑai(l−1)k∈[−ϑb3√Nl−1−i(l−1)k,0]). |
Let (l−1)k play the role as n in Theorem 2.2, from (3.3) and (3.4) we get
¯limn→∞(an1/3−α)13α−1logϱ(an1/3−α,α)=a13α−1¯limn→∞logρ(an1/3−α,α)n1/3≤¯limN→∞max1≤l≤N(ϑa(lN)α−ϑb3√1−lN−π22b23√l−1N∫10κ″x(ϑ)(Nl−1−x)−23dx). | (3.5) |
Recall the definition of σ− and define γσ:=π2σ2−2, we get
¯limn→∞n−13logρ(an1/3−α,α)≤¯limN→∞max1≤l≤N(ϑa(lN)α−ϑb3√1−lN−3γσϑ2b2(1−3√1−l−1N))≤supx∈[0,1]φ(x), | (3.6) |
where φ(x):=ϑaxα+(3γσϑ2b2−ϑb)3√1−x−3γσϑ2b2,x∈[0,1]. Because of the monotonicity of ρ(ε,α) on ε, by a similar argument as (3.2)–(3.3) we can see that for any a>0,
¯limε↓0ε13α−1logρ(ε,α)=¯limn→+∞a13α−1logρ(an1/3−α,α)n1/3. | (3.7) |
By the light of (3.6) and (3.7), next we need to consider how to take the value of a,b to get the minmum of supx∈[0,1]φ(x).
(ⅰ) For the case α>1, we let positive constants a,b satisfy that
ϑaα+ϑb3−γσϑ2b2=0andϑb−3γσϑ2b2≤0. | (3.8) |
Note that
φ′(x)=αaϑxα−1+13(ϑb−3γσϑ2b2)1(1−x)2/3. |
(3.8) implies that maxx∈[0,1]φ′(x)≤0. That is to say,
supx∈[0,1]φ(x)=φ(0)=−ϑb. |
Combining (3.5), (3.6) with (3.8) we get
¯limn→∞(an1/3−α)13α−1logϱ(an1/3−α,α)≤−ϑba13α−1=−ϑb(b3α−γσαϑ3b2)13α−1=−ϑ(b3α−3[γσαϑ3−b33α])13α−1. | (3.9) |
Noting that
d[xα−1(3γσϑ3−x)]dx=xα−2[3γσϑ3(α−1)−αx], |
hence we choose b=(3γσ(α−1)αϑ3)1/3, which satisfies the second condition in (3.8) and the last line in (3.9) will take its maximum. Finally, from (3.7) we complete the proof of (1.11).
(ⅱ) Now we consider the case α∈(13,1). Recall that
φ(x):=ϑaxα+(3γσϑ2b2−ϑb)3√1−x−3γσϑ2b2. |
Hence it is true that
supx∈[0,1]φ(x)≤ϑa+max{0,3γσϑ2b2−ϑb}−3γσϑ2b2≤ϑ(a−max{b,3γσϑ3b2}). |
From this point we choose b=(3γσ)1/3/ϑ such that ϑb−3γσϑ2b2=0, hence it is true that
¯limε↓0ε13α−1logρ(ε)≤−ϑa13α−1(b−a). |
By direct caculation we see
d[a13α−1(b−a)]da=b3α−1a2−3α3α−1−(3α3α−1)a13α−1=ba−1−3α, |
thus the best choice of a is a:=b3α. Finally we get
¯limε↓0ε13α−1logρ(ε)≤−ϑ(3α−1)(3α)3α3α−1b3α3α−1=−ϑ(3α−1)(3ϑα)3α3α−1(3γσ)α3α−1, |
which completes the proof of (1.12).
The author thanks the editor and the referees for the coming valuable comments and suggestions, which improves the quality of this paper greatly.
This research is supported by the Fundamental Research Funds for the Central Universities (NO.2232021D-30).
The author declares no conflict of interest.
[1] |
J. M. Hammersley, Postulates for subadditive processes, Ann. Probab., 2 (1974), 652–680. http://doi.org/10.1214/aop/1176996611 doi: 10.1214/aop/1176996611
![]() |
[2] |
J. F. C. Kingman, The first birth problem for an age dependent branching process, Ann. Probab., 3 (1975), 790–801. http://doi.org/10.1214/aop/1176996266 doi: 10.1214/aop/1176996266
![]() |
[3] |
J. D. Biggins, The first and last birth problems for a multitype age-dependent branching process, Adv. Appl. Probab., 8 (1976), 446–459. http://doi.org/10.1017/S0001867800042348 doi: 10.1017/S0001867800042348
![]() |
[4] | B. Lubachevsky, A. Shwartz, A. Weiss, The stability of branching random walks with a barrier, Israel: EE PUB 748, Technion, 1990. |
[5] |
B. Lubachevsky, A. Shwartz, A. Weiss, An analysis of rollback-based simulation, ACM Trans. Model. Comput. Simulat., 1 (1991), 154–193. http://doi.org/10.1145/116890.116912 doi: 10.1145/116890.116912
![]() |
[6] |
J. D. Biggins, B. D. Lubachevsky, A. Shwartz, A. Weiss, A branching random walk with a barrier, Ann. Appl. Probab., 1 (1991), 573–581. http://doi.org/10.1214/aoap/1177005839 doi: 10.1214/aoap/1177005839
![]() |
[7] |
B. Jaffuel, The critical barrier for the survival of branching random walk with absorption, Ann. Inst. H. Poincaré Probab. Statist., 48 (2012), 989–1009. http://doi.org/10.1214/11-AIHP453 doi: 10.1214/11-AIHP453
![]() |
[8] |
N. Gantert, Y. Hu, Z. Shi, Asymptotics for the survival probability in a killed branching random walk, Ann. Inst. H. Poincaré Probab. Statist., 47 (2011), 111–129. http://doi.org/10.1214/10-AIHP362 doi: 10.1214/10-AIHP362
![]() |
[9] |
M. Fang, O. Zeitouni, Branching random walks in time inhomogeneous environments, Electron. J. Probab., 17 (2012), 1–18. http://doi.org/10.1214/EJP.v17-2253 doi: 10.1214/EJP.v17-2253
![]() |
[10] |
B. Mallein, Maximal displacement in a branching random walk through interfaces, Electron. J. Probab., 20 (2015), 1–40. http://doi.org/10.1214/EJP.v20-2828 doi: 10.1214/EJP.v20-2828
![]() |
[11] |
B. Mallein, Maximal displacement of a branching random walk in time-inhomogeneous environment, Stoch. Proc. Appl., 125 (2015), 3958–4019. http://doi.org/10.1016/j.spa.2015.05.011 doi: 10.1016/j.spa.2015.05.011
![]() |
[12] | J. Peyriére, Turbulence et dimension de Hausdorff, C. R. Acad. Sci. Paris Sér. A, 278 (1974), 567–569. |
[13] |
J. P. Kahane, J. Peyriére, Sur certaines martingales de Benoit Mandelbrot, Adv. Math., 22 (1976), 131–145. http://doi.org/10.1016/0001-8708(76)90151-1 doi: 10.1016/0001-8708(76)90151-1
![]() |
[14] |
J. D. Biggins, A. E. Kyprianou, Measure change in multitype branching, Adv. Appl. Probab., 36 (2004), 544–581. http://doi.org/10.1239/aap/1086957585 doi: 10.1239/aap/1086957585
![]() |
[15] |
A. A. Mogul'skiĭ, Small deviations in the space of trajectories, Theor. Probab. Appl., 19 (1974), 726–736. http://doi.org/10.1137/1119081 doi: 10.1137/1119081
![]() |
[16] | A. A. Borovkov, A. A. Mogul'skiǐ, On probabilities of small deviations for stochastic processes, Sib. Adv. Math., 1 (1991), 39–63. |
[17] |
Q. M. Shao, A small deviation theorem for independent random variables, Theor. Probab. Appl., 40 (1995), 225–235. http://doi.org/10.1137/1140021 doi: 10.1137/1140021
![]() |
[18] | Y. Lv, W. Hong, Quenched small deviation for the trajectory of a random walk with time-inhomogeneous random environment, Theor. Probab. Appl., in press. |