Scaling limits of random walk bridges conditioned to avoid a finite set
Kohei Uchiyama

TL;DR
This paper investigates the scaling limits of one-dimensional random walk bridges conditioned to avoid a finite set, revealing different limiting processes depending on the moments and tail behavior of the increments.
Contribution
It provides a comprehensive analysis of the functional limit of conditioned random walks under various moment and tail assumptions, extending existing results to infinite variance and heavy-tailed cases.
Findings
Converges to a continuous process if third moment is finite.
In heavy-tailed cases, the limit process has a downward jump if tail exponent is less than 3.
Results include cases with infinite variance and stable law attraction.
Abstract
This paper concerns a scaling limit of a one-dimensional random walk started from on the integer lattice conditioned to avoid a non-empty finite set , the random walk being assumed to be irreducible and have zero mean. Suppose the variance of the increment law is finite. Given positive constants , and we consider the scaled process , started from a point conditioned to arrive at another point at and avoid in between and discuss the functional limit of it as . We show that it converges in law to a continuous process if . If we suppose to vary regularly as with exponent , and show that it converges to a process which has one downward…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Markov Chains and Monte Carlo Methods · Mathematical Dynamics and Fractals
Scaling limits of random walk bridges conditioned to avoid a finite set
Kôhei UCHIYAMA
Department of Mathematics, Tokyo Institute of Technology
Oh-okayama, Meguro Tokyo 152-8551
running head: Scaling limits of random walk bridges
key words: random walk on the integer lattice; conditioned to avoid a set; third moment; functional limit theorem; killing on a finite set; tightness of pinned walk; tunneling. AMS Subject classification (2010): Primary 60G50, Secondary 60J45.
Abstract
This paper concerns a scaling limit of a one-dimensional random walk started from on the integer lattice conditioned to avoid a non-empty finite set , the random walk being assumed to be irreducible and have zero mean. Suppose the variance of the increment law is finite. Given positive constants , and we consider the scaled process , started from a point conditioned to arrive at another point at and avoid in between and discuss the functional limit of it as . We show that it converges in law to a continuous process if . If we suppose to vary regularly as with exponent , and show that it converges to a process which has one downward jump that clears the origin if ; in case there arises the same limit process as in case . In case we consider the special case when belongs to the domain of attraction of a stable law of index having no negative jumps and obtain analogous results.
1 Introduction
Let be a random walk on started at the origin, namely and are i.i.d. random variables taking values in the integer lattice . Let be defined on a probability space and suppose that is irreducible and
[TABLE]
Let be the variance of the step variable: . We consider the both of cases and , but usually suppose unless the contrary is stated explicitly when we discuss the problem for the case . In [14] the present author obtained a precise asymptotic form of transition probability of the walk killed on a finite non-empty set (in case ). In the present paper we are interested in the behaviour of , for large , conditioned on the events for and where , . In [14] it is observed that if , then the walk thus conditioned “continuously” transits from the positive half line to the negative half still avoiding , while if it clears by one “long jump”. In this paper we observe that this is reflected to the scaling limit. In case we suppose that is regularly varying as with index , . Then we prove that the scaled process converges in law and the limit process is continuous in the former case; in the latter case it has exactly one downward jump if while the limit process agrees with that of the former case if . In case analogous results are given for the special case when belongs to the domain of attraction of a stable law with exponent having no negative jumps.
There are a lot of works dealing with various problems concerning random walks on the real line conditioned to avoid a finite set or a half line. To mention among them only those studying the functional limit theorems, the finite set case are studied by [1] and [10], whereas for the half line we have a long list of papers for which the readers are referred to [3], [6] where brief descriptions of them are found.
2 Statements of results
Supposing we first describe the processes arising in the limit of the random walk bridges conditioned to avoid , and then state the convergence results. The case will be discussed separately after that. There appear some processes in the limit, which we suppose to be given in the same probability space as . Limit processes. Let be a standard linear Brownian motion started at [math], , a 3-dimensional Bessel process started at , and (, ) the Bessel bridge of length joining and obtained by conditioning . The processes are supposed to be independent of . For we write for and let be the first passage time of zero by .
Put
[TABLE]
and
[TABLE]
For each constants and , is a Markov process with transition law
[TABLE]
(cf. [11, Section VI.3]). In the sequel the letters and denote positive constants.
Transit made by creeping. Writing we define the time-inhomogeneous process , by
[TABLE]
on the event . The process conditioned on is a Markov process on (inhomogeneous in time) whose transition probability density is described below. (See (4.1) for the finite dimensional distribution.) Note that if is a linear Brownian motion independent of , the Bessel bridge in (2.2) can be substituted for by conditional on , the two processes having the same law (cf. e.g., [11, XI(3.12)]), provided the event conditioning is accordingly replaced by .
For ,
[TABLE]
and for ,
[TABLE]
Remark 1. (a) The semi group property of can be directly ascertained by using the relations
[TABLE]
(e.g., to see write and similarly for ). The former one says that the family constitutes the entrance law for the semigroup (cf., e.g., [11]) and the latter follows from the fact that , is the transition density of the passage time process ([9]).
(b) The process defined above can be obtained as a normalized limit of Brownian bridge killed at rate as , where is the Brownian local time at zero (see Appendix (A)).
(c) Although the limit processes are described by means of the 3-dimensional Bessel process, one may think that there should naturally appear the Brownian meander. The bridges of the two processes have the same law which can be described by the Brownian motion killed on hitting zero together with the entrance law for it as is displayed in (2.1). (See also Remark 3.)
Transit made by a jump. Let . Put for and ,
[TABLE]
(see Remark 2 below for the integrability). Let and be positive random variables dependent on with the conditional law
[TABLE]
where is the -field on generated by . Note that
[TABLE]
and is an -stopping time taking values in a.s. Let the Bessel processes , be independent of as well as of . Define
[TABLE]
Then , is a Markov process on and its transition probability is given by replacing by in (2.3) and (2.4): For ,
[TABLE]
and for ,
[TABLE]
Remark 2. The integrability of the repeated integral defining reduces to that of which is finite if and only if .
Scaling limits. Let be the random walk on as specified in Introduction. Let
[TABLE]
and write for the first hitting time of a non-empty set by :
[TABLE]
We shall write for . Let and be positive constants, and and , two sequences of integers such that as
[TABLE]
(provided ), and define the scaled process
[TABLE]
where means that the ratio of two sides of it approaches 1. Let be an arbitrarily given positive constant and a non-empty finite subset of . We are concerned with the law of under the condition that
[TABLE]
namely the walk visits at time without entering ( stands for the integer part). We suppose that for some, then all, and so that the probability of event (2.8) is positive for all sufficiently large if the walk is further supposed to be temporally aperiodic (which is not restrictive for the present problem). In what follows the probability of (2.8) is tacitly supposed to be positive when the conditioning on (2.8) is considered.
Let be the distribution function of : , .
Theorem 1**.**
Suppose that or is regularly varying with index as . Then the law of conditioned on event (2.8) converges to the law of conditioned on relative to the uniform topology of .
Theorem 2**.**
Suppose that is regularly varying with index as , . Then the law of conditioned on event (2.8) converges to the law of relative to the Skorohod topology of .
Here we briefly explain how the two types of limit processes emerge in Theorems 1 and 2 and thereby indicate a crucial point in question. For large the way enters the half line is virtually determined by
[TABLE]
the hitting distribution of for the walk ‘started at infinity’. The above limits exist and constitute a probability distribution on [12, Theorem 30.1]. It holds that is bounded above and below by positive multiples of ; in particular
[TABLE]
(cf. e.g., [14, (2.7)]). It is observed in [14] that conditioned on event (2.8) either comes near to but still avoids it or clears by one long jump that becomes indefinitely large as according as the above infinite series is convergent or divergent. This would convince one that if the series are convergent there appears a continuous process in the limit. In case of the divergence the limit process may still be continuous and in order to ascertain it to be discontinuous we need to estimate the length of a typical jump to reveal whether it is comparable to the scale so as to remain positive in the limit. (An answer to the question will be given in Lemma 3.2.)
Results for a random walk with .
Let and the distribution function of satisfy
[TABLE]
where is a continuous positive function on slowly varying at infinity. This condition is necessary and sufficient in order for the scaled process to converge in law to a strictly stable process of index which has no negative jump, provided that the norming constants are suitably chosen, which we may and do take so that . Let denotes the potential function of the walk (defined in (3.1)). Then, corresponding to the equivalence relation (2.10) it holds that under the condition (2.11)
[TABLE]
Let stand for the first sum in (2.12) so that . Then
[TABLE]
(Cf. [17, Theorem 2 and Corollary 2] for (2.12), (2.13).) Denote by the limiting stable process started from zero and put . Let be the probability density of and the transition density of the stable process killed on hitting zero. For define to be the density of the hitting time of for . Then
[TABLE]
(cf. [2, Corollary VII.3]). It follows that for ,
[TABLE]
(cf. Appendix (B)), saying that the family constitutes an entrance law for the transition semigroup of the processes killed on exiting from the negative half line . Note that the transition function of this killed process agrees with restricted to .
Let be the process whose transition law is given as before by (2.3) and (2.4) but with in place of and similarly for , . Instead of (2.6) let and and define the scaled process by
[TABLE]
The probability of event (2.8) is supposed to be positive for large enough. Then the following theorems hold for . It is noted that under (2.11)
[TABLE]
where (cf. [15, Lemma 3.1, Eq(9.2)], [1, Lemma 3.3]), so that if with .
Theorem 3**.**
Suppose (2.11) to hold and that either or is regularly varying with index as . Then the law of conditioned on event (2.8) converges to the law of w.r.t. the Skorohod topology of .
Theorem 4**.**
Suppose (2.11) to hold and that is regularly varying as with index , . Then the law of conditioned on event (2.8) converges to the law of w.r.t. the Skorohod topology of .
Remark 3. In Theorems 1 through 4 the scaled walk is considered under the conditional law given the two events given in (2.8). By the same token as what is mentioned in Remark 1(c) we can replace the first of it by with the conclusion kept unaltered; in other words, if denotes the conditional law , the bridge converges to the same limit laws as specified above.
In the next section we collect the known results concerning the walk killed on which are used in the proofs of Theorems 1 to 4, and prove some related lemmas, especially Lemma 3.2 mentioned above. The proofs of Theorems 1 and 2 are given in Sections 4.1 and 4.2, in which the tightness of the sequence of conditional laws of is verified and the finite dimensional distributions of limit processes are derived. Theorems 3 and 4 are proved in almost the same way as Theorems 1 and 2 and we do not provide full proofs of them except for some remarks and key lemmas that we give in Section 4.3 as well as Section 3.
3 Preliminary Results
We present known results taken mainly from [12], [13] and [14] and prove some related results. In the rest of this paper the letters and always denote the integers representing states of the walk.
For a non-empty denote by the transition probability of the walk killed upon entering , which we define by
[TABLE]
This entails whenever ; and even if , where equals unity if and zero if (recall that for every ). Put
[TABLE]
We suppose that the walk is (temporally) aperiodic, namely for every there exists such that for , which does not give rise to any loss of generality.
Let be the potential function of the walk defined by
[TABLE]
It holds that as , which implies
[TABLE]
with as uniformly for with , and as . (Cf. Theorem 28.1 and Theorem 29.2 of [12].) Let , the Green function of the walk killed on visiting the origin. We have the identity
[TABLE]
where [12, Proposition 29.4]. In what follows these relations will be used frequently and not noticed of their use. On putting
[TABLE]
it also holds [13, (2.9)], [14, (2.15)] that if ,
[TABLE]
Let be a non-empty finite subset of . For convenience of description we assume that (namely and ) and that
[TABLE]
In the following statements a constant is given arbitrarily in advance. In the square bracket at the head of each of them is indicated the proposition which the result is taken from. etc. denote unimportant positive constants whose values may depend on and vary at different occurrences of them. Sometimes these constant depends on and possibly on , in which case we write , , etc.
P0 [14, Remark 4 (Sect. 5), Theorem C (Sect. 4.2) ] Uniformly for positive ,
[TABLE]
(Here and in the sequel means that the ratio of two sides of it is bounded away from zero and infinity.)
In view of the first relation above and may be interchangeable in most of the arguments made later if , since the precision of estimates for small values of are irrelevant for the proofs of Theorems 1 and 2.
P1 [13, Theorem 1.1]. (a)* Uniformly for and subject to the constraints and , as and *
[TABLE]
(b)* As under *
[TABLE]
(c)* Whenever ,*
[TABLE]
[Here Spitzer’s bound () (cf. [12]) is also employed.] (d) For all , and ,
[TABLE]
*in case the right side may be replaced by . *
P2 [14, Theorem 2]. If , then
(a)* as (a′) and*
(b)* as subject to the condition *
[TABLE]
where is some positive constant determined by and (see [14] for an explicit form).
P3 [14, Proposition 8]. For and for large enough
[TABLE]
where is a positive constant depending on as well as and .
P4 [14, Corollary 7]. *Under *
[TABLE]
P5 [14, Corollary 3], [13, Propositions 2.2 and 2.3]. Uniformly for and , as
[TABLE]
P6 [13, Theorem 1.4]. Let be the space-time distribution of the first entrance of into , namely Then uniformly for , as
[TABLE]
and there exists a positive constant such that whenever ,
[TABLE]
*Here is the probability law given in (2.9) and is a positive multiple of the renewal function of the descending ladder height process with the multiplicative constant chosen so that as .
- [Although (3.8) is restricted to in [13], the extension to is easily verified (cf. [14, Lemma 4.1] or proof of [15, Lemma 6.5].) ]
Lemma 3.1**.**
If , then for some constant ,
[TABLE]
Proof. First consider the case and suppose that is even for convenience of description. In the decomposition
[TABLE]
we break the double sum on the right into three parts:
[TABLE]
By P1(c) it follows that for , , so that uniformly for ,
[TABLE]
where for the last inequality we use the assumption (see P2(a)). Observe that is dominated by a constant multiple of , whose sum over is bounded by a constant. Using this and P2(a*′*) in turn we deduce that
[TABLE]
By the second half of P6 we have for , and hence, employing P2(a*′*) again,
[TABLE]
Thus the bound of the lemma is obtained if .
For , we break the outer sum at in the right side expression of (3.9). Use (3.8) together with () for the sum over , which is then evaluated to be at most a constant multiple of . The same bound is obtained for the other sum by using valid for (cf. P1(d)). ∎
Lemma 3.2**.**
Suppose that is regularly varying at with index , . Then for each the following hold uniformly for satisfying .
(a)* If ,*
[TABLE]
(b1)* If ,*
[TABLE]
(b2)* If , (3.10) holds for satisfying in addition.*
(c)* If and E\big{[}|S_{1}|^{3};S_{1}<0\big{]}=\infty, then for each *
[TABLE]
Proof. Let be regularly varying as is assumed in the lemma. As by Karamata’s theorem
[TABLE]
Note that is non-increasing in and then observe that (a) follows if we show that as
[TABLE]
owing to P3. As before we split the outer summation of the numerator at . Employing the obvious inequality together with P1(d) we infer that the sums over and are dominated by constant multiples of
[TABLE]
and
[TABLE]
respectively. We have the bound for all and with . On putting and substituting from and an elementary computation verifies that both of the sums of the above double series are dominated by a constant multiple of which is at most
[TABLE]
Since , this together with (3.11) shows (3.12) if .
As for (b1) and (c) we show shortly that if , then for all large enough
[TABLE]
If , on taking (b1) is immediate from this in view of (3.11). If , then is slowly varying and it follows that and
[TABLE]
On using P3 as before this together with (3.16) shows that the conditional probability of the event tends to zero. (c) now follows from P4.
The proof of (3.16) is similar to the one given above for (3.12). What we should evaluate are
[TABLE]
instead of (3.13) and (3.14), respectively. By it plainly follows that
[TABLE]
and if the sum of the first double series in (3.17) is at most a constant multiple of
[TABLE]
Noting that as a similar computation leads to the same upper bound for the second one. This shows (3.16), since .
It remains to verify (b2). If , the upper bound (3.19) is not valid but in (b2) it is supposed that so that if (), then for and owing to P1(c), and we obtain instead of (3.19)
[TABLE]
Observing that the second sum in (3.17) admits the same upper bound we conclude (b2) to be true since for large enough. ∎
Corollary 3.1**.**
Let be as in the preceding lemma and suppose if . Then for each , uniformly for satisfying , (a) P\big{[}S^{x}_{k}<0\;\;\mbox{for}\;\;\sigma^{x}_{(-\infty,0]}\leq k\leq n\,\big{|}\,S^{x}_{n}=y,\sigma^{x}_{A}>n\big{]}\;\to\;1 , (b) if ,
[TABLE]
(c)* if , then for each *
[TABLE]
Proof. The first relation follows from and , the latter asserting as . By duality relations the rest follows from Lemma 3.2. ∎
Corresponding lemmas for the case
Here we suppose that (2.11) is satisfied and prove Lemmas 3.3 and 3.4 below that correspond to Lemmas 3.1 and 3.2, respectively, and will be used for the proofs of Theorems 3 and 4. We shall use the following large deviation estimate:
[TABLE]
(cf. [4]). We also have
[TABLE]
valid if always true under (2.11) (cf. [17, Corollary 1]). Recall . Most of the results given below are based on [15] in which the transition function of the killed walk denoted by is defined slightly differently from but agrees with whenever .
Lemma 3.3**.**
If , then for some constant ,
[TABLE]
Proof. For , the proof parallels to that of Lemma 3.1 with the help of the following bounds
[TABLE]
[TABLE]
that follow immediately from Lemma 6.2 (combined with (3.20)) and Lemma 6.5(ii) of [15], respectively. As for , in view of the identity what has been just proved yields the bound for . For , a better bound is obtained in [15, Proposition 2.3(i)] (applied to ). ∎
Lemma 3.4**.**
Suppose is regularly varying at with index , in addition to (2.11). For each the following holds uniformly for satisfying .
(a∗)* If ,*
[TABLE]
(b∗1)* If , under the additional constraint *
[TABLE]
(b∗2)* If , (3.24) holds for satisfying in addition.*
(c∗)* If and , for each *
[TABLE]
The proof of the lemma proceeds parallel to that of Lemma 3.2 and we point out only main steps after stating the results from [15] needed for it. Put for
[TABLE]
Instead of P3 it holds that if either or is regularly varying as , then
[TABLE]
(the reversed inequality with replaced by also holds), where is a positive constant (see Proposition 2.3(ii) of [15] as well as the comment given right after it). We also have
[TABLE]
and its dual (cf. [15, Lemma 6.1(i)]). Since , (3.26) together with entails
[TABLE]
Proof of (a∗). (3.12), (3.13) and (3.14) are modified in an obvious way according to (3.25), (3.27) and (3.26). Put as before. Noting g_{\{0\}}(x,y)\leq C\big{[}a(-|x|)\wedge a(-|y|)\big{]} (), we see first that is at most a constant multiple of
[TABLE]
an estimate corresponding to (3.15), and then that (a∗) follows if we show that
[TABLE]
as . Now let () for a slowly varying function . Then for we have
[TABLE]
with a constant (cf. [16, Proposition 6.2, Eq(6.17)]). Recalling we find (3.28) to be true, provided that .
Proof of (b∗1) and (c∗). Instead of (3.16) one shows that if , for large enough,
[TABLE]
the proof being the same as before except for a minor modification. (b∗1) readily follows from (3.29). As for (c∗) we have the same result as in P4 but with instead of as well as with replacing (cf. [15, Proposition 2.1]) and combining it with (3.29) leads to the assertion as before.
Proof of (b∗2). Using the bound valid for (see the dual of (3.26)) one can proceed as before.
4 Proofs of Theorems
Let be as in (2.7) and denote by the conditional probability law of the walk , and hence of , given the event (2.8):
[TABLE]
Let and stand for the first time enters and the last time it leaves , respectively:
[TABLE]
The proofs of Theorems 1 and 2 are given separately according to whether is finite or infinity. We continue to use the notation of the preceding section. For simplicity we shall suppose and .
4.1 Case
Under the conditional law once the walk goes down below the level with prescribed, it never takes the positive value up to the time it terminates at with the probability that approaches unity as as we shall see (the second half of Lemma 4.1). On taking this for granted the convergence of the finite dimensional distribution of under follows immediately from P1(b) and P2(b): Noting as by P0, we infer that given (, ) with and and , we let , , and . Then, as
[TABLE]
of which the right side is the density of the corresponding finite dimensional distribution of the limit process given by (2.2)—with apparent change of letters to .
We need to show the tightness of the law of under , or what amounts to the same thing [5], that for any there exist and such that if , then
[TABLE]
For let denote the random variable
[TABLE]
It suffices to show, instead of (4.3), that
[TABLE]
For simplicity we let . First we show that
[TABLE]
The conditional probability on the left side is expressed as
[TABLE]
Splitting the inner summation at , by P4 we can find such that the contribution to the double sum from is less than , whereas by P1(c, d) it follows that for any ,
[TABLE]
Since according to P2, the latter bound shows that the ratio under the double summation sign is bounded by a constant for , which together with the former one leads to
[TABLE]
hence by the invariance principle, which entails that for small enough, we obtain (4.4).
The bound follows from (4.4) as the dual assertion of it.
It remains to dispose of . Since can not exceed if the path of the walk is confined in the interval for the time duration between and , it suffices to show which follows from the next lemma.
Lemma 4.1**.**
If , then there exists a constant depending on and such that for
[TABLE]
and .
Proof. We have only to verify (4.5), the other relation being its dual. Let . Then according to P2(b), so that the conditional probability in (4.5) is dominated by a constant multiple of
[TABLE]
which is obviously less than
[TABLE]
We know that as uniformly in whenever (cf. [16, Proposition 5.2(i)]), while
[TABLE]
so that by (3.2) the sum in (4.6) is , being bounded under the present moment condition. Since the supremum in (4.6) is dominated by a constant multiple of owing to Lemma 3.1, we can conclude the asserted bound. ∎
In the next subsection we shall need a tightness result with the conditional of avoiding instead of . The following result, of which the condition is irrelevant, actually shows that the random walk bridge conditioned to stay positive weakly converges to a standard Brownian meander of length 1 pinned at a prescribed point at time 1 locally uniformly in .
Lemma 4.2**.**
For each , as and independently
[TABLE]
uniformly for , and .
Proof. The main part of the proof will be given by means of the dual walk, denoted by (defined by ). If for some constant the assertion is easy to show, since then (for subject to the condition of the lemma) according to P1(b) and the problem is the same for the bridge without killing. For the proof of the lemma it therefore suffices to show that if and is the last time when leaves , then
[TABLE]
(as and ) since . In order to separate the increment from we use the inequality
[TABLE]
Now we switch the description to that by the dual walk. Write for where denotes the hitting time for . For any we can choose and so that
[TABLE]
for, by P0 and P1(a), the conditional probability above is dominated by
[TABLE]
With the help of strong Markov property of one applies what is mentioned above for the case to the walk to find so that
[TABLE]
Since in this bound as well as in (4.8) may be made arbitrarily small, (4.7) follows if we can show that
[TABLE]
for any prescribed .
Our proof of (4.9) rests on the following facts: for ,
[TABLE]
(In (b) is a positive constant that may depend on .) Here (a) follows from P5 and (b) from P0. Let stand for the event
[TABLE]
For simplicity we suppose to be even. Applying (4.10b) to the dual walk with the help of the trivial bound leads to
[TABLE]
and hence
[TABLE]
The constant may be supposed to be smaller than so that the occurrence of entails that , and hence that
[TABLE]
hence according to (4.10a), and we may conclude
[TABLE]
which is the same as (4.9). Proof of Lemma 4.2 is finished. ∎
4.2 Case
Here we suppose in addition to that is regularly varying as with index .
Given we shall let under the constraint
[TABLE]
The following result refines the estimates given in P3 and P4 under the present assumption.
Proposition 4.1**.**
As under (4.12) (i) if ,
[TABLE]
(ii)* if and E\big{[}|S_{1}|^{3};S_{1}<0\big{]}=\infty,*
[TABLE]
We write
[TABLE]
Recall the definition of . An elementary computation derives from Proposition 4.1 the following
Corollary 4.1**.**
For any uniformly for satisfying (4.12) and , as ,
[TABLE]
The convergence of finite dimensional distributions of —given by a formula analogous to (4.1)—follows from Corollary 4.1. The proof of Theorems 1 and 2 is accordingly accomplished if we verify Proposition 4.1 as well as the tightness of the conditional law of . The verification of Proposition 4.1 is given in the paragraphs 4.2.1 and 4.2.2 for the cases and respectively. The tightness proof is given in the paragraph 4.2.3.
4.2.1. Proof of (i) of Proposition 4.1.
Let and and be defined as in (4.1) with in place of . We first observe that as under (4.12) and (independently)
[TABLE]
and
[TABLE]
((4.14) is proved also in case but by a different approach in the next paragraph 4.2.2.) (4.13) follows immediately from Corollary 3.1(a,b). For the proof of (4.14), recalling the convention consider the representation
[TABLE]
It then suffices to show that for any there exists such that the sum in (4.15) restricted to is at most , the part being disposed of by duality because of (4.13). We may restrict the summation over and to with a positive constant because of (4.13) again . The proof is therefore finished if we show that for any and there exists such that
[TABLE]
On using the trivial bound and in turn this triple sum is dominated by
[TABLE]
Since the last ratio is bounded, the right-most member becomes arbitrarily small along with , as desired. Thus (4.14) has been proved.
In view of P0 and being interchangeable, we infer from (4.13) and (4.14) that
[TABLE]
where as under (4.12) and . In this triple sum we may replace by owing to P1 since the contribution to the sum from becomes negligible as as is assured without difficulty. Similarly may be replaced by . Since either of the sums over and contributes only and for reason of symmetry Proposition 4.1 (i) therefore follows from the next lemma.
Lemma 4.3**.**
Suppose that , with a slowly varying function and . Then for each , as under and ,
[TABLE]
Proof. On summing by parts,
[TABLE]
We can choose a slowly varying function so that with and so that as . Then substituting , and summing by parts back, the sum of the last series above is written as
[TABLE]
where . Noting
[TABLE]
we deduce that
[TABLE]
On the other hand if and , then the sum on the right side of (4.16) is bounded from below by a positive multiple of
[TABLE]
with a positive constant, showing is negligible. This finishes the proof. ∎
4.2.2. Proof of (ii) of Proposition 4.1. Let so that , with a slowly varying , and put
[TABLE]
which is also slowly varying. Recall as , the fact that differentiates the case from the case (as is exhibited by Lemma 3.2).
We follow the proof of P2 given in [13, pp.702-703] for the special case . As therein, take a small and break the sum in the expression of given in (4.15) into three parts by splitting the range of according as and , and call the corresponding sum and .
On using the second half of P6 and the bound () the part is dominated by a constant multiple of
[TABLE]
By the present assumption about
[TABLE]
(cf. [14, (2.7)]). Under (4.12) and easy computations deduce that
[TABLE]
admits the same bound as a dual relation since by Corollary 3.1.
As for we note that for arbitrarily small the range of the variable may be restricted to in view of Lemma 3.2(c). Then by the first half of P6 and P1(d)
[TABLE]
Here for each pair of and , as uniformly for satisfying (4.12).
By P1 as under and observe, on replacing by ,
[TABLE]
Writing , we see and
[TABLE]
Here we have used the condition (4.12) again. On the other hand in view of (4.18)
[TABLE]
Finally observing we find that
[TABLE]
which together with the bounds of and verifies the formula in (ii). ∎
4.2.3. Proof of tightness. It suffices to show that for any there exists and such that
[TABLE]
( and are given in (4.1)), since in view of Corollary 3.1(a). Observe that , may be written as
[TABLE]
By the dual assertion of Lemma 3.2(b,c) one can choose so large that and accordingly obtains that is at most plus
[TABLE]
By Lemma 4.2, as and , or, what amounts to the same,
[TABLE]
uniformly for and for each positive . On recalling (4.15) this disposes of the contribution from . It follows from (4.14) (if ) and (4.19) (if ) that the contribution from is negligible; and similarly for that from , the proof of tightness is complete. ∎
4.3 Notes on the proofs of Theorems 3 and 4
The proofs are similar to those of Theorems 1 and 2 and we do not present them but indicate some points that make difference from the latter. Throughout this section we assume (2.11) to be valid, put and and let , and be defined as before. First we note that the propositions corresponding to P1 through P4 and P6 for the case are obtained in [15]: specifically the corresponding results of [15] are P1(a,b) Theorem 3, Corollary 3, Proposition 2.1; P1(c) Lemma 5.2 [(3.22)];
P1(d) Proposition 2.3(ii) [(3.27)]; P2 Theorem 4;
P3 Proposition 6.1; P4 Proposition 2.2; P6 Lemma 6.5, where Theorems, Propositions or Lemmas are those of [15], of which a few are already used in Section 4, their reference numbers being indicated in the square brackets. The result corresponding to P0 (in particular its first one saying ) that is missing in the above list and used in the proofs of Corollary 3.1 and Lemma 4.2 does not hold in the relevant range but is valid if restricted to . Corollary 3.1 was used only under this restriction, while a result corresponding to Lemma 4.2 will be proved below. As for P5 also missing in the above, we need a corresponding one in a dual form, which will be presented below in (4.24).
It is shown in [15, Theorem 6] that as
[TABLE]
where is some positive constant. Instead of Lemmas 4.1 and 4.2 we obtain the following Lemmas 4.4 and 4.5, respectively.
Lemma 4.4**.**
Suppose . Then there exists a constant depending on and such that for
[TABLE]
and .
Proof. As in the proof of Lemma 4.1 we see that () and owing to Lemma 3.3 () and that by (4.22) and (2.13) the probability in (4.23) is at most a constant multiple of
[TABLE]
where we have also used relation (3.21) that gives . ∎
For let denote the random variable
[TABLE]
Lemma 4.5**.**
For each , as and independently
[TABLE]
uniformly for and .
Proof. As in the proof of Lemma 4.2 the proof is reduced to verification of (4.9) modified in an obvious way (except for the existence of that makes (4.8) valid (with replaced by ) for which we use the convergence of the normalized walk conditioned to stay positive to a stable meander (as found in [7]). The verification of (4.9) is carried out in the same line if an appropriate substitute for (4.10) (and accordingly that for (4.11)) is given. Let denote the renewal function of the ascending ladder height process of the walk . Then, as
[TABLE]
uniformly for , according to [17, Lemma 1.1]. From Proposition 11 of [8] we infer that for each there exists a constant such that
[TABLE]
Moreover varies regularly (with index ) and approaches a positive constant as . From these facts one deduces that for ,
[TABLE]
instead of (4.10), and then
[TABLE]
instead of (4.11). The rest of proof is easy and omitted. ∎
With these two lemmas as well as those corresponding to P1 to P6 one can follow the arguments of Sections 4.1 and 4.2 to prove Theorems 3 and 4.
5 Appendix
(A) Let be the local time at the origin of the Brownian motion . For a constant let be killed at the rate ; in other words, is a Markov process whose sample path is continuous and whose transition probability is given by
[TABLE]
Here denotes the probability law of and being dropped from under . Then the conditional law of the process given and converges weakly, as , to the law of the process described in (2.2) and the density of finite dimensional distribution of the limit process given on the right side of (4.1) is expressed as
[TABLE]
We prove only the latter half of the assertion, the other half being argued similarly to what is done in Section 4.1 for the random walk. The proof rests on the formula
[TABLE]
(cf. [9, Problem 2.2.3], [11, Eq(VI.2.18)] etc.), from which we derive
[TABLE]
as follows. If , then as , , so that
[TABLE]
showing (i). If , (5.2) together with leads to
[TABLE]
hence (ii) follows.
Now for and ,
[TABLE]
disposing of the case (by taking , , and on using this result for and ,
[TABLE]
(), showing the limit in (5.1) to agree with the corresponding density in (4.1) if . The case is dealt with in a similar way and the general case by the double induction on .
(B) Here is given a proof of (2.14). The proof is the same as for the Brownian case but we need to take care of asymmetry of the processes . Let . Let be the first hitting time of zero for . Noting that the event entails since makes no negative jumps and , we see
[TABLE]
and differentiation yields that is the same as (2.14).
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] B. Belkin, An invariance principle for conditioned recurrent random walk attracted to a stable law, Zeit. Wharsch. Verw. Gebiete 21 (1972), 45-64.
- 2[2] J. Bertoin, Lévy Processes, Cambridge Univ. Press, Cambridge (1996).
- 3[3] J. Bertoin and R. A. Doney, On conditioning a random walk to stay positive, Ann. Probab,, 22 (1994), 2152-2167.
- 4[4] Q. Berger, Notes on random walks in the Cauchy domain of attraction. Probab. Theor. Rel. Field (2018). https://doi.org/10.1007/s 00440-018-0887-0
- 5[5] P. Billingsley, Convergence of probability measures, John Wiley & Sons, Ltd., New York 1968.
- 6[6] F. Caravenna and L. Chaumont, An invariance principle for random walk bridges conditioned to stay positive, Electron. J. Probab. 18 (2013), no.60, 1-32.ISSN: 1883-6489 DOI: 18.1214/EJP.v 18-2362
- 7[7] R.A. Doney, Conditional limit theorems for asymptotically stable random walks, Z. Wahrsch. verw. Gebiete, 70 (1985), 351-360,
- 8[8] R.A. Doney, Local behaviour of first passage probabilities, Probab. Theor. Rel. Fields, 152 , (2012), 559-588.
