Brownian snake

From testwiki
Jump to navigation Jump to search

Template:Short description

A Brownian snake is a stochastic Markov process on the space of stopped paths. It has been extensively studied.,[1][2] and was in particular successfully used as a representation of superprocesses.

Informally, superprocesses are the scaling limit of branching processes, except each particle splits and dies at infinite rates. The Brownian snake is a stochastic object that enables the representation of the genealogy of a superprocess, providing a link between super-Brownian motion and Brownian trees. In other words, even though infinitely many particles are constantly born, we can still keep track of individual trajectories in space, or of when two given present-day particles have split from a common ancestor in the past.

History

The Brownian snake approach was originally developed by Jean-François Le Gall.[2][3] It has since been applied in fragmentation theory,[4] partial differential equation[5] or planar map[6][7]

The simplest setting

Let D(+,) be the space of càdlàg functions from + to , equipped with a metric d compatible with the Skorokhod topology. We define a stopped path as a couple (w,z) where wD(+,) and z+ are such that w(t)=w(tz). In other words, w is constant after z.

Now, we consider a jump process (JsN)s0 with states {+1,1} and jump rate N, such that J0N=+1. We set:β^sN:=0sJsNdsand then βsN:=|β^sN| to be the process reflected on 0.

In words, βsN increases with speed 1, until JsN jumps, in which case it decreases with speed 1, and so on. We define the stopping time σN to be the N-th hitting time of 0 by βN. We now define a stochastic process (ηsN,βsN)s+ on the set of stopped paths as follows:

  • η0N=0
  • if JsN=+1 for s[s1,s2] then:
    • ηs1(t)=ηs2(t) for tβs1
    • (ηs2(tβs1)ηs1(βs1))0tβs2βs1 is distributed as a Brownian motion independent from ηs1
  • if JsN=1 for s[s1,s2] then ηs1(t)=ηs2(t) for tβs2

See animation for an illustration. We call this process a snake and βsN the head of the snake. This process is not yet the Brownian snake, but a good introduction. The path is erased when the snake head moves backwards, and is created anew when it moves forward.

Template:Hide

Duality with a branching Brownian motion

We now consider a measure-valued branching process (XtN)t0 starting with N particles, such that each particle dies with rate N, and upon its death gives birth to two offspring with probability 1/2.

On the other hand, we may define from our process (ηsN,βsN)0sσN a measure-valued random process X^t as follows: note that for any t+, there will almost surely be finitely many times s1,s2,,sn[0,σN] such that βsi=t. We then set for any measurable function f:

X^tN(f):=i=1nf(ηsN(t))

Then X and X^ are equal in distribution.

The Brownian snake

We take the limit of the previous system as N. In this setting, the head of the snake keeps jittering. In fact, the process βsN tends towards a reflected Brownian motion βs. The definitions are no longer valid for a number of reasons, in particular because βs is almost surely never monotonous on any interval.

However, we may define a probability Ra,b((u,y),d(w,z)) on stopped paths such that:

  • Ra,b-almost surely z=b and w(t)=u(t) for 0ta
  • The law of (w(a+t))0tba is the law of a standard Brownian motion.

We may also define γsy(da,db) to be the distribution of (inf0rsβr,βs) if β0=y. Finally, define the transition semigroup on the set of stopped paths:

Qs((u,y),d(w,z))=γsy(da,db)Ra,b((u,y),d(w,z))

A stochastic process with this semigroup is called a Brownian snake.

We may again find a duality between this process and a branching process. Here the branching process will be a super-Brownian motion (Xt)t+ with branching mechanism ϕ(z)=z2, started on a Dirac in 0.

However, unlike the previous case, we must be more careful in the definition of the process X^. Indeed, for t+ we cannot just list the times s1,s2, such that βs=t. Instead we use the local time ls(t) associated with βs: we first define the stopping time σ=inf{s0,ls(0)u}. Then we define for any measurable f:X^t(f):=0σf(ηs(t))dls(t) Then, as before, we obtain that X and X^ are equal in distribution. See the animation for the construction of the branching process from the Brownian snake. Template:Hide

Generalisation

The previous example can be generalized in many ways:

  • We may consider D(+,E) where (E,d) is a complete separable metric space.
  • Instead of a Brownian motion, the underlying movement of the snake can be very general class of Markov processes (see Superprocess).

The Brownian snake can be seen as a way to represent the genealogy of a superprocess, the same way a Galton-Watson tree may encode the hidden genealogy of a Galton–Watson process.[2] Indeed, for two points of the Brownian snake, their common ancestor will be the infimum of the snake's head position between them.

If we take a Brownian snake and construct a real tree from it, we obtain a Brownian tree.[2]

References

Template:Reflist