Path Transformations Connecting

Brownian Bridge, Excursion and Meander

By

Jean Bertoin Universit6 Pierre et Marie Curie Tour 56, 4 Place Jussieu 75252 Paris Cedex France

and Jim Pitman

Technical Report No. 350 June 1992 Research partially supported by NSF Grant DMS 91-07531

Department of Statistics University of California Berkeley, California 94720

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

JEAN BERTOIN (1) AND JIM PITMAN (2) ABSTRACT. We present a unified approach to numerous path transformations connecting the Brownian bridge, excursion and meander. Simple proofs of known results are given and new results in the same vein are proposed.

1. INTRODUCTION

Let B = (Bt : t > 0) be a standard Brownian motion started at Bo 0, Bbr - (Bbr 0 K t < 1) a Brownian bridge, Be = (BX : < K t < 1) a (normalized) Brownian excursion, = and Bm (Br e 0 < t < 1) a Brownian meander. That is =

B _ (Bt: < t < Be:x (Bt: 0 < t < Bme d (Bt: 0 < t <

i1 B1 °=0), 11 Bt > 0 for 0 < t < 1 and B1 11 Bt > 0 for 0 < t < 1)

=

0)

The symbol d denotes equality in distribution, referring here to distribution on the space C[O, 1]. It is well known that the above formal conditioning on events of probability zero can be justified by natural limit schemes, leading to well defined processes with continuous paths. See Durrett et al. [D-I], [D-I-M], Iglehart [Ig] and the references therein, where these processes also appear as weak limits of correspondingly conditioned simple random walks. The scaling property of Brownian motion yields the following elementary construction, see e.g. Biane and Yor [B-Y.1] or Revuz and Yor [R-Y]. Introduce g = sup{t < 1 : Bt = 0} and d = inf{t > 1 : Bt = 0}, respectively the last zero of B before time 1, and the first zero of B after time 1. Then

(1-br)

(1-ex)

(

(

zBgt : 0 < t < 1)

=IB9+(d-9)tl

is a bridge independent of g,

0 < t < 1) is an excursion independent of g and

d,

Key words and phrases. Brownian motion, bridge, excursion, meander. (1) Research done during a visit to the University of California, San Diego, whose support is gratefully

acknowledged. (2) Research partially supported by N.S.F. Grant DMS 91-07531 Typeset by AMS-TFX 1

2

(1-me)

JEAN BERTOIN

AND JIM PITMAN

(.,3Bg+(l-g)tI : O < t < 1) is a meander independent of g.

A recurring feature in the study of these processes is that some functional f of one of them, say B', has the same law as some other functional h of one of the others, say B":

f(B')_ h(B").

(2)

Probabilists like to find a 'pathwise explanation' of such identity, meaning a transformation T : C[O, 1] -+ C[0, 1] such that

T(B')

(3)

d

B", and f= h o T.

Most often, the discovery of some identity of the form (2) precedes that of the transformation T satisfying (3). But once T is found, (2) is suddenly extended to hold jointly for the infinite collection of all f and h such that f = h o T. The purpose of this paper is to present a unified approach to such path transformations connecting the bridge, the excursion and the meander. Known results are reviewed and several new transformations are proposed. Composition of the various mappings described here gives a bewildering variety of transformations which it would be vain to try to exhaust. We have chosen to present only the most significant, usually mapping the bridge into another process. All these transformations can be inverted, though we do not always make the inverse explicit. The main mappings are depicted graphically in figures which should help the reader both in statements and proofs. We describe essentially four sets of transformations. The first relies on the decomposition of the bridge at its minimum on [0,1] (section 2). The associated mapping from the bridge to the excursion was discovered by Vervaat [Ve]. The mapping from the bridge to the meander was found independently by Bertoin [Be] and Pitman (unpublished). These two results form the starting point of this work and are not re-proved. They will be applied to deduce the other mappings. The second set of transformations is based on the absolute value of the bridge and its local time at 0 (section 3), the third on various types of reflections for the bridge (section 4), and the ultimate on the signed excursions of the bridge away from 0 (section 5). 2. SPLITTING THE BRIDGE AT ITS MINIMUM

Chung [Ch] and Kennedy [Ke] noted that the maximum of the excursion, maxo
PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

Theorem 2.1. Bridge * Excursion. (Vervaat) (i) Let U be the instant when Bbr attains its minimum value on [0, 1]. Then U has a uniform [0, 1] distribution, and the process

(Bbr

d)

Bbr

O < t < 1)

is an excursion independent of U. (ii) Conversely, if U is a uniform [0, 1] variable independent of B", then

(Bu+tx

B)-Bt

O
is a bridge which attains its minimum at time U

1 -U.

1)

Bbr

|ext

1-U

FIgure 1: Bridge ++ Excursion in Theorem 2.1 A transformation in the same vein, from the bridge to the meander, is described in [Be], Corollary 6: split the bridge at its minimum, time-reverse the pre-minimum part, and then tack on the post-minimum part (see figure 2). This transformation is one-to-one. Here is the formal statement:

13

AND JIM PITMAN

JEAN BERTOIN

4

Theorem 2.2. Bridge

-

Xt

Meander. Notations are as in Theorem 2.1. Put t = -

{brU-t - BUbr

~Bbr -

for 0 < t < U, for U
2B br

Then Bme :=X is a meander. Moreover U Bbr can be recovered from Bme.

=

=B

sup{t < 1 :

}. In particular,

B me

B br Bme u~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 4AIl I

Figure 2: Bridge

+-+

2Bs

W_

/

/

I

Meander in Theorem 2.2

An immediate combination of Theorems 2.1 and 2.2 yields Theorem 2.3. Excursion 4-+ Meander. Let U be a uniform [0, 1] variable independent of BgI. Put f BeZ for 0 < t < U, Xt | ~BUx + Bp$(-U) fiolrU
Then Bm" := X is a meander and U U can be recovered from Bme.

=

sup{t < 1 : Bt

= Be}. In particular, B" and

Just as in Vervaat [Ve], Theorem 2.3 also follows by a weak convergence argument from its random walk analog, a simple transformation underlying the classical fluctuation theory of Feller [Fe], vol.l. The details are even easier because there is no difficulty involving ties in the discrete set up. Proof of the discrete analog of Theorem 2.8. Let Sk =6 + + Gk, k > 1, and So 0, where the ('s are independent with P(cj ±1) 2. Fix a positive integer n, and let =

=

=

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

A {Sk > 0 for all 1 < k < 2n}, and A+' = {Sk > 0 for all 1 < k < 2n and S2, = 0}. So, the law of (Sk 0 < k < 2n) conditionally on A+ is the the law of the discrete meander with 2n-steps, and the law of (Sk : 0 < k < 2n) conditionally on A+' is the the law of the discrete excursion with 2n-steps. On the event A+, define U max{k: 1 < k < 2n, Sk = S2n/2}, and set Xk = Sk for 0 < k < U, Xk = SU + S2n-(k-U)-S2n for U < k < 2n. Identify the events A+ and A+' in the usual way with sets of paths of length 2n. It is easily verified that (Sk: 0 < k < 2n) -* (Xk : 0 < k < 2n) induces a mapping from A+ to A+' which is 2n - 1 to one: each path in A+O comes from exactly 2n - 1 paths in A+, one for each possible value of the cut point U. It follows immediately that, conditionally on A+, the process (Xk : 0 < k < 2n) is a discrete excursion independent of U, and that U is uniformly distributed on {1, 2,.. , 2n - 1}. O Remark. The transformation in the discrete analog of Theorem 2.3 is a close relative of the one which Feller [Fe.1], ex III.10.7, attributes to E. Nelson. Let T = min{k > 0 : Sk = 0}. Since obviously P(T = 2n) = 2P(A+°) and P(T > 2n) = 2P(A+), the transformation implies P(T = 2n) = (2n - 1)P(T > 2n). This yields the distribution of T and hence the fundamental formulas of discrete fluctuation theory, see [Fe.1] III.(3-7) and Lemma II.3.2. As an application of the three preceding theorems, we notice the identity (

)

(-Bu~~~brUbr) d eBxe Uex:) d I

(me/ Ume),

where Ubr is the instant when Bbr attains its minimum on [0,1], uex is a uniform [0,1] variable independent of Bex, and Ure = sup{t < 1 : Bte = -Bmfe}. The law of the first component in (4) is the same as R/2, where R has the Rayleigh distribution P(R E dr)/dr

=

rexp{-r2},

r > 0.

W"Te refer to [K-S] for an explicit description of the joint law in (4).

Futher pairs of random variables associated with the Brownian bridge that have the same distribution as in (4) appear in subsequent identities (9) and (11). 3. ABSOLUTE BRIDGE AND ITS LOCAL TIME Recall Levy's [Le] identity

(5)

(MI,M -B) d (LI JBJ))

where Mt = maxo ,
(6)

(MI 2M -B) d

( J, BES3 ),

where BES3 is the 3-dimensional Bessel process, and Jt = mint<. BES3 its future minimum process. One deduces from (5) and (6) that

(7)

(L, IBI + L)

d

(J,BES3).

6

JEAN BERTOIN

AND JIM PITMAN

Informally, the meander can be viewed as the Bessel(3) process on [0,1] conditioned by BES3 = Ji. More precisely, Imhof [Im.1] showed that the law of the meander is absolutely continuous with respect to the law of the Bessel(3) process on [0, 1], with density f.J/BES . Biane and Yor [B-Y.2] used this relation to obtain a conditional form of (7), which provides a transformation from the absolute bridge to the meander. See Theorem 3.1 below and figure 3. The local time process at 0 of the bridge Bbr, denoted Lbr, is defined by

Lbr =lim 2

1 t

1Ibr 1<,}ds,

where the limit exists a.s. for all t E [0, 1]. We denote by Blbrl the absolute bridge, that is Blbrl d IBbrj. Its local time process at 0 is

Lb =lim J l{Brl

ds.

In particular, if Blbrl = IBbrl, then Llbri - Lbr. Warning: this definition makes Librl equal half the occupation density of Blbri at 0.

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

Theorem 3.1.

lBridgel

-

Meander. (Biane and Yor) The process Bme _ Bibrl + Llbrl

is a meander and

Llbrl

min B".

t<8<1

In particular, Blbrl can be recovered from Bme.

Blbrl

A A 1 ~~~~~~ Figure 3: IBridge I e Meander in Theorem 3.l Theorem 3.1 can also be deduced from elementary time-reversal arguments as follows. Proof of Theorem 8.1. It follows from Levy's identity (5) and (1-me) that

Bme!(d

(Mp

-

B+(I-P)t): 0 < t < 1

where p is the instant when B attains its maximum on [0,1]. Since the reversed Brownian motion (B1 - B t : 0 < t < 1) is again a Brownian motion, we deduce that

(Jme Bmre -_ Jme) d where Jtm as

=

mint<,<,

-

MI(j _t)IMp(l.t) Bp(1it)): 0 < t <. -

By Levy's identity (5), the right-hand side has the same law

(±(L -9

(j_t),

Bg(j_t)j):O
I

7

JEAN BERTOIN

8

AND JIM PITMAN

where g is the last zero of B before 1. According to (1-br), and to the invariance in law under time-reversal for the bridge, the above pair has the same distribution as (Lbr, IBbrI). This establishes the Theorem. 0 The next result transforms an absolute bridge into an excursion (see figure 4). Theorem 3.2. sup{t < 1: Llbri

lBridgel

Llbrl

Kt

Excursion. Notations are as in Theorem 3.1. Let U Then U is uniformly distributed on [0, 1]. Put

*

=

LlbrI

for0
LL~brlI-JLbrI

for U < t<1.

Then K +Blbrl

Bex

is an excursion independent of U. Moreover,

BCex

f mi

Kt

=


min Bea

U
forr 0 < t < U,

forr U < t < 1.

In particular, BlbrI can be recovered from Bex and U.

BeT glbrl|

-

U

1

1

Figum 4: I Brdge I +4 Excursion in heorem 3.2 This result comes from the combination of Lemma 3.3 below and Theorems 3.1 and 2.3.

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER Lemma 3.3.

lBridgel

-

Bridgel.

Notations

are

as

in Theorem 3.2. Put

Bt b for O < t < U, Blbrl for U < t < 1. =t~ t 141-(t-u) Then X is an absolute bridge. Moreover, if Lx stands for its local time process at 0, then U sup{t < 1: Lx= -Lx}, and =

Tx

J'

LlbI Ll +

for O < t < U, ll i-L(ebrl-U)

for U < t < 1.

Proof. The lemma holds in general for any diffusion bridge, and is intuitively obvious. We just sketch the proof and leave details to the reader. First, one observes (by excursion theory) that (8-a)

(Blbrl:

(where U is

as

(8-b)

the processes in (8-a)

< t < U) and

0

(Btlbri:

0

< t < 1-U) have the

same

law

in Theorem 3.2), and that are

independent conditionally

Since the time-reversed bridge is again a bridge,

(BulbIt ° < t < 1-U)

d

we

on

(U, LirI).

deduce from (8-a) that

(B lbrl: O < t < 1-U).

Observe that the two processe above have the same lifetime, 1- U, and the same local time at 0, -LIbrl. Therefore, the preceding identity in law also holds conditionally on (U, Lbrl). Going back to (8-a,b), this establishes the first part of the Lemma. The second follows from the additive property of the local time. O We conclude this section with the observation that the pair

LIbrl ,Ulbrl) can

where

Ubrl

inf{t

LbrI

brl}

be added to the list of identically distributed pairs in (4). 4. REFLECTING THE BRIDGE

In this section, we present three transformations of the bridge by reflection. The first can be viewed as a bridge analogue of Levy's identity (5) (see figure 5).

9

JEAN BERTOIN

10

AND JIM PITMAN

Theorem 4.1. Bridge jBridgel. Let abr be the (a.s. unique) instant when Bbf attains its maximum on [0, 1], and -

{ max Bb a

O
Nbr

max B br

t
for O < t < fo br

<

br abI

t < 1.

Then the process

Bibri

Nbr - Bbr

is an absolute bridge, and its local time process at 0,

Librl

=L{brlI-L

Llbr,j

is specified by the relations

for 0 < t < abrI forbr < t < 1. lbrl

In particular, abr = inf{t < 1 :LbrI = 21 Lbr 1 } and Bbr can be recovered from Bibri

Nbr I 1

abr

BIbri

g br

1

Figure 5:

Bridge

+-

I Bridge I inTheorem 4.1

Proof. First, we observe an identity for the absolute bridge, similar to Lemma 3.3. Put U:-UIbrI inf{t < 1 : Lt I- -Ll }. Then

(BU+

(mod 1): 0

< t < 1) is

an

absolute bridge, and its local time at

(10)

Libri U+t

-LlI for U


O

1U
0

equals

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

The first assertion comes from (8), and the second from the additive property of the local time. We now deduce the Theorem by composition of the successive transformations

Bridge +-. Bridge +-+ Excursion +-4

jBridgel +-+ jBridgel,

where the first consists of taking the opposite, the second is given in Theorem 2.1.i, the third is the inverse transformation described in Theorem 3.2, and the last is given by (10). 0 Combining Theorems 4.1 and 3.2 (respectively 4.1 and 3.1), we deduce the following bridge analogs of Pitman's identity (6). The first transformation is depicted in figure 6. Theorem 4.2. Bridge +-+ Excursion. Notations are as in Theorem 4.1. The process ex

_= 2Nbr - Bbr

is an excursion independent of abr. Moreover,

min Bex

= Nbr _

|

for 0 < t
t<,q
I

min Be

br


for abr < t < 1.

Therefore, Bbr can be recovered from Be: and abr.

Bet

rbr 1

Bbr

abr

FIgure 6: BrIdge +- Excursion in Theorem 4.2

1

JEAN BERTOIN

12

Theorem 4.3. Bridge

+-+

AND JIM PITMAN

Meander. Let

b

b = maxo
Then the process

Bme :. 2Mbr - Bbr

is a meander. Moreover, the instant when Bbr attains its maximum on [0,1] is

abr =sup{t < 1: Btme=-Bme},

and M

=

min Bm'

t
t < br.

Therefore, Bbr can be recovered from Bme. Just as Theorem 3.1, Theorem 4.3 can be viewed as a conditional version of Pitman's identity (6). More precisely, recall that B is a Brownian motion with maximum process M and put BES3:-2M-B and J:= M. Then U:= Ji/BES3 =M /(2Mi-Bi) is a uniform [0, 1] variable independent of the process (BES3: 0 < t < 1). Note that for every e> 0, {B1 e [-e, 6]} {2U - 1 e [-e/BES3, e/BES3]}, and that 2U - 1 has a uniform [-1, 1] distribution. Conditioning by the above event and then letting e go to 0, we deduce that the law of (2Mt - Bt : 0 < t < 1) conditionally on B1 = 0, that is the law of (2Mtbr - B br: 0 < t < 1), is absolutely continuous with respect to the law of (BESt O0 t < 1), with density v/2I/sBES. According to Imhof [Im.1], 2Mbr - Bbr is a meander. Remark. The above argument also shows that if the bridge Bbr is replaced by a Brownian bridge ending at a :A 0, that is (Bt: 0 < t < 11B, = a), then the path transformation of Theorem 4.3 yields a meander conditioned on Bm' > lal. Here is an example of particular interest, due to Aldous [Al], equation (21), of a transformation by reflection for the excursion. Excursion. (Aldous) Let U be a uniform [0,1] variable, Theorem 4.4. Excursion and independent of B", for 0 < t < U min Be -

) t
min Bex

U
for U < t < 1.

Then the process X

=

(Bux + Bust (mod 1)-

(mod

1): 0 < t < 1),

is an excursion independent of U. Moreover, Bex can be recovered from X and U. Aldous discovered this result as a projection of very natural symmetry of his compact continuum random tree. In the present setting, this transformation is identified as follows

Excursion

+-+

Bridge

+-+

Bridge

+

Excursion,

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

where the first transformation is described in Theorem 2.1.ii, the second consists of taking the opposite, and the third is given in Theorem 4.2. To conclude this section, we mention that Biane and Yor [B-Y.1], Theorem 7.1, describe a transformation from the bridge to the meander by an infinite sequence of reflections. This mapping explains the identity due to Kennedy [Ke], that the maximum of the meander, maxo
5. SIGNED EXCURSIONS OF THE BRIDGE

Sparre-Andersen [S-A] discovered the following identity for finite chains with exchangeable increments. The index of the maximum of the chain has the same distribution as the number of steps in the positive half-line. Feller illuminated Sparre-Andersen's identity with a simple chain transformation, see [Fe.2], Lemma 3 in Section XII-8. A continuous time analogue of Feller's transformation for the Brownian bridge was obtained by Karatzas and Shreve [K-S] (see figure 7). To describe their result, let I+ = (O, oo), I_ = (-oo, O), and for ± E {+,-}, let

jt

AtlfB, EI4-}ds

for 0 < t < 1

the time spent by Bbr in Ii before the instant t, and

a± =inf{t < 1 : A± s} =

for 0 < s < A+,

the inverse of A+. The time-substitution by a+ consists of erasing the negative excursions of Bbr and then closing up the gaps. Similarly, a- erases the positive excursions of Bbr and closes up the gaps.

13

JEAN BERTOIN

14

Theorem 5.1. Bridge

4-+

AND JIM PITMAN

Bridge. (Karatzas and Shreve) Let

xt =Lbbr 2

Bbr

+b

-t= -L. +Bb~

for 0< t
Then tbr : X is a bridge that attains its;maximum at time A+. Moreover, for Nbr derived from Br as in Theorem 4.1, Nbr

Lbr

2

t:

2

c(T

for 0
Finally, Bbr can be recovered from Bbr.

~~~br

gbr

I

~

b

br

Fgure 7: Bridge - Bridge in Theorem 5.1

In connection with (4), one deduces the identity in distribution

( )

ju )d(L l21 A+). ( ~~~~Bub

Karatzas and Shreve first noticed the identity (11), and then explained it through Theorem 5.1. In our setting, Theorem 5.1 comes from Lemma 5.2 below, Lemma 3.3 and Theorem 4.1.

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

Lemma 5.2. Bridge

+

Bridgel. Yt

=

Yt+A+

Let

Bbr.

for 0 < t < A+, for 0 < t < ATI.

-ce

Then Bibri :Y is an absolute bridge, and its local time at 0,

LIbr, is given by

for O < t < A+,

Libri - 2L%+ 2 at

lIbr.It+A2 - Lbr ' + ILbr 2 cr

for 0
In particular, A+, = inf { t < 1 : = lLIbrl} Finally, Bbr can be recovered from BIbrI. Proof. The Lemma holds in general for any diffusion bridge which has the same law as its opposite. Here is an elementary proof in the Brownian case that uses the scaling property. Let e be an exponential variable, independent of the Brownian motion B, and g(e) = inf{t < e : B, = 0} be the last zero of B on [O,e]. The excursion process of (Bt: t < g(e)) (in the sense of Ito [It]) is a Poisson point process killed at the independent time L,. Its characteristic measure is clearly invariant under the mapping w >-4 -w. It follows now from the independence of the positive and negative excursions and excursion theory that the process Z given by for 0 < t < A+ for 0 < t < A)

Zt-=Bc+

Z(t + A+g( c))

=

Bcet

has the same law as (IBtI: 0 < t < g(e)). Morover, its local time at 0, LZ, is given by Z 1L +Ae 2 at 1 g( 2 ge

for 0 < t < A+ 1

;-La-

for 0< t.
The first part of the lemma follows now from (1-ex). Finally, Bbr can be recovered from the excursion process of Y in a similar way as described in Pitman and Yor [P-Y], p. 747. U We deduce now from Theorems 5.1 and 4.2 the following (see figure 8). Theorem 5.3. Bridge +-+ Excursion. Let

Yt

=

Yi-t

=

br + Rbr IL 2 at+

for 0 < t < A+,

Lbr- B b

for 0 < t < AT

2 aet

16

JEAN BERTOIN

AND JIM PITMAN

Then BeZ:= Y is an excursion, U :-A+ is a uniform [0, 1] variable, and Bex and U are independent. Moreover (with the same notation as in Theorem 4.4),

for 0
2 at

Iex=2 Lbr

for0
Finally, Bbr can be recovered from U and Bez.

Bbr

FVgure 8:

Bridge

B. x

|

Excursion in Theorem 5.3

+

Theorems 5.3 and 2.1.i yield a transformation from the bridge to itself which is given in Corollary 5 of [Be]. The formulation of this mapping in the present setting is left to the reader. Finally, here is the analogue of Theorem 5.3 for the meander. Theorem 5.4. Bridge +-+ Meander. Let

=Lbr+ Bbr Yt _it 2 c

for 0< t < A+,

+121

Bbr

Y

2

~t

Then Bme := Y is a meander. Moreover, A+

=

for0
sup{t < 1 : Btm

-

.

B1Be},and

for 0
t+A+
2

2

t

PATH TRANSFORMATIONS CONNECTING BROWNIAN BRIDGE, EXCURSION AND MEANDER

Finally, Bbr

can

be recovered from Be.

Proof. The result follows by inspection of the successive transformations provided by Theorems 5.3 and 3.2 (modulo time-reversal and change of sign). El

REFERENCES [Al]

Aldous, D.J., The continuum random tree II: an overview, in: Barlow, M.T. and Bingham, N.H. (eds), Stochastic Analysis, Cambridge University Press (1991), 23-70. [Be] Bertoin, J., De6composition du mouvement brownien avec de'rive en un minimum local par juxtaposition de ses excursions positives et ne'gatives, Seminaire de Probabilites XXV, Lectures Notes in Maths. 1485 (1991), 330-344. [Bi] Biane, P., Relations entre pont brownien et excursion renormalise'e du mouvement brownien, Ann. Inst. Henri Poincare 22 (1986), 1-7. [B-Y.1] Biane, P. and Yor, M., Valeurs principales associe'es aux temps locaux browniens, Bull. Sc. math., 2 eme serie 111 (1987), 23-101. [B-Y.2] Biane, P. and Yor, M., Quelques pre'cisions sur le me'andre brownien, Bull. Sc. math., 2 eme serie 112 (1988), 101-109. [Ch] Chung, K.L., Excursions in Brownian motion, Ark. f6r Math. 14 (1976), 155-177. [D-I] Durrett, R.T. and Iglehart, D.L., Functionals of Brownian meander and Brownian excursion, Ann. Probab. 5 (1977), 130-135. [D-I-M] Durrett, R.T., Iglehart, D.L. and Miller, D.R., Weak convergence to Brownian meander and Brownian excursion, Ann. Probab. 5 (1977), 117-129. [Fe.1] Feller, W.E., An Introduction to Probability Theory and its Applications, vol.I, 3rd edition, Wiley, New-York, 1968. [Fe.2] Feller, W.E., An Introduction to Probability Theory and its Applications, vol.11, 2nd edition, Wiley, New-York, 1971. [Ig] Iglehart, D.L., Functional central limit theorems for random walks conditioned to stay positive, Ann. Probab. 2 (1974), 608-619. [Im.1] Imhof, J.P., Density factorizations for Brownian motion, meander and the three-dimensional Bessel process, and applications, J. Appl. Prob. 3 (1984), 500-510. [Im.2] Imhof, J.P., On Brownian bridge and excursion, Studia Sci. Math. Hungaria 20 (1985), 1-10. [It] It6, K., Poisson point processes attached to Markov processes, Proceedings 6th Berkeley Symposium on Math. Stat. and Prob. vol. III (1970), 225-239. [K-S] Karatzas, I. and Shreve, S.E., A decomposition of the Brownian path, Stat. Probab. Letters 5 (1987), 87-94. [Ke] Kennedy, D., The distribution of the maximum of the Brownian excursion, J. Appl. Prob. 13 (1976), 371-376. [Le] Levy, P, Sur certains processus stochastiques homogenes, Compositio Mathematica 7 (1939), 283-339. [Pi] Pitman, J., One-dimensional Brownian motion and the three-dimensional Bessel process, Adv. Appl. Prob. 7 (1975), 511-526. [P-Y] Pitman, J. and Yor, M., Asymptotic laws for planar Brownian motion, Ann. Probab. 14 (1986), 733-779. [R-Y] Revuz, D. and Yor, M., Continuous Martingales and Brownian Motion, Springer-Verlag, Berlin, Heidelberg, New-York, 1991. [S-A] Sparre-Andersen, E., On sums of symmetrically dependent random variables, Scand. Aktuarietidskr. 26 (1953), 123-138. [Ve] Vervaat, W., A relation between Brownian bridge and Brownian excursion, Ann. Probab. 7 (1979), 141-149.

Path Transformations Connecting Brownian Bridge ...

result, attributed to Vervaat by Imhof [Im.2], and discovered alsoby Biane [Bi], involves additional .... The local time process at 0of the bridge Bbr, denoted Lbr, is.

1MB Sizes 2 Downloads 259 Views

Recommend Documents

Path Transformations Connecting Brownian Bridge ...
plied to deduce the other mappings. The second set of transformations is based on the absolute value of the bridge and its local time at 0 (section 3), the third on ...

Quadratic Transformations
Procedure: This activity is best done by students working in small teams of 2-3 people each. Develop. 1. Group work: Graphing exploration activity. 2.

Fractional Brownian Motion Simulation
Apr 21, 2004 - area of the square, or the volume of the cube. ...... was able to simulate time series that mirrored his observations of natural processes ..... SimFBM displays the plots and the collection of statistics in separate windows. If.

Transformations-HOCLessonPlan.pdf
Page 1 of 4. LESSON OVERVIEW. This activity will allow students to explore, identify, and perform static transformations on. the coordinate plane. LESSON SUMMARY. Duration 45- 60 minutes. GETTING STARTED (​5 - 10 min). ○ Introduce the activity. â

Transformations-HOCLessonPlan.pdf
rotation: ​describes the movement of a figure around a fixed point. Students may ... Activities 13 - 14: Reflection​- Students explore reflection over x or y axis.

Transformations Notes.pdf
Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Transformations Notes.pdf. Transformations Notes.pdf. Open.

Transformations
Ex 3. Write the f(x) form of the function given the following transformations. 1. right 5. 2. H. Exp. by 3. 3. H. flip. 4. V. comp by ½. 5. Down 8. Ex 4. Describe the transformation of ( ). (. ) 1. 2 cos2 ++−. = π x xf to. ( )π−. = x y cos4. E

NONLINEAR SPECTRAL TRANSFORMATIONS ... - Semantic Scholar
noisy speech, these two operations lead to some degrada- tion in recognition performance for clean speech. In this paper, we try to alleviate this problem, first by introducing the energy information back into the PAC based features, and second by st

java custom transformations
number of ERP, CRM, SCM, and Web application implementations. The focus on business ..... Gets the template id for this transformation via templateId. public int getTemplateID(). } ..... Java layer in the form of object of ICTWidgetInstance.

13. Transformations Review.pdf
Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. 13. Transformations Review.pdf. 13. Transformations Review.pdf.

Weak Convergence to Brownian Meander and ...
These results may be found in Belkin (1972),. Iglehart (1974, 1975), and Kaigh (1974, 1975, 1976). Our purpose in this paper is to investigate relationships between Brownian meander, Brownian excursion, Brownian motion and Brownian bridge. In par- ti

Energy Transformations Worksheet.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Energy ...

Brownian aggregation rate of colloid particles with ...
Aug 13, 2014 - fore to derive an analytical solution, which give a simple way of calculating the rate ... perimental data, as well as for the theoretical simulation of.

Connecting Families - Semantic Scholar
School of Interactive Arts and Technology. Simon Fraser University. Surrey, BC, Canada. Steve Harrison. Department of Computer Science and School of Visual ...

Fettuccine Truss Bridge - WordPress.com
Oct 18, 2013 - Building Structures [ARC 2522] Project 1 .... 10. Interior view of the bridge. Span 500m across Klang river,Kota Bridge used to ... Test on glue are done to get the best result on connection, weight it .... [Website] Retrieved 22nd.

Split-Bridge
10, 2010. (54) EXTENDED CARDBUS/PC CARD. CONTROLLER WITH SPLIT-BRIDGE ..... of peripherals devices including notebook computers, stor.

bridge camp.pdf
Enquiries: PO N Johnson. Contact: 049 807 1112. Address: 4 Middle Street. Graaff-Reinet. 6280 ... EC 68/12/17 to EC. 73/12/17. Enquiries: Capt Kemp. Contact: 043 708 7000. Address: Mdantsane SAPS. 2. ND Floor. 1 Mazaule Street. NU1, Mdantsane. 5219.

Bridge Terminology.pdf
Page 1 of 1. Bridge Terminology.pdf. Bridge Terminology.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying Bridge Terminology.pdf.

Fluctuations of Brownian Motion with Drift
FLUCTUATIONS OF BROWNIAN MOTION WITH DRIFT by. Joseph G. Conlon* and. Peder Olsen**. Department of Mathematics. University of Michigan. Ann Arbor, MI 48109-1003. * Research partially supported by the U.S. National Science Foundation under grants. DMS

Brownian aggregation rate of colloid particles with ...
y = C0/C − 1,27 since they are linear in time for the partic- ular case of a .... dantseva, V. P. Maltsev, and A. V. Chernyshev, Colloids Surf., B 32, 245. (2003). 5E.

Brownian motion on the Sierpinski carpet
Co-authors. This is joint work with. Martin Barlow, University of British Columbia. Takashi Kumagai, Kyoto University. Alexander Teplyaev, University of Connecticut. Richard Bass (University of Connecticut). Brownian motion on the Sierpinski carpet.

pdf-1870\brownian-motion-cambridge-series-in-statistical-and ...
Try one of the apps below to open or edit this item. pdf-1870\brownian-motion-cambridge-series-in-statistical-and-probabilistic-mathematics.pdf.