Brownian excursion

Last updated
A realization of Brownian Excursion. BrownExcursion1D.svg
A realization of Brownian Excursion.

In probability theory a Brownian excursion process is a stochastic process that is closely related to a Wiener process (or Brownian motion). Realisations of Brownian excursion processes are essentially just realizations of a Wiener process selected to satisfy certain conditions. In particular, a Brownian excursion process is a Wiener process conditioned to be positive and to take the value 0 at time 1. Alternatively, it is a Brownian bridge process conditioned to be positive. BEPs are important because, among other reasons, they naturally arise as the limit process of a number of conditional functional central limit theorems. [1]

Contents

Definition

A Brownian excursion process, , is a Wiener process (or Brownian motion) conditioned to be positive and to take the value 0 at time 1. Alternatively, it is a Brownian bridge process conditioned to be positive.

Another representation of a Brownian excursion in terms of a Brownian motion process W (due to Paul Lévy and noted by Kiyosi Itô and Henry P. McKean, Jr. [2] ) is in terms of the last time that W hits zero before time 1 and the first time that Brownian motion hits zero after time 1: [2]

Let be the time that a Brownian bridge process achieves its minimum on [0, 1]. Vervaat (1979) shows that

Properties

Vervaat's representation of a Brownian excursion has several consequences for various functions of . In particular:

(this can also be derived by explicit calculations [3] [4] ) and

The following result holds: [5]

and the following values for the second moment and variance can be calculated by the exact form of the distribution and density: [5]

Groeneboom (1989), Lemma 4.2 gives an expression for the Laplace transform of (the density) of . A formula for a certain double transform of the distribution of this area integral is given by Louchard (1984).

Groeneboom (1983) and Pitman (1983) give decompositions of Brownian motion in terms of i.i.d Brownian excursions and the least concave majorant (or greatest convex minorant) of .

For an introduction to Itô's general theory of Brownian excursions and the Itô Poisson process of excursions, see Revuz and Yor (1994), chapter XII.

Connections and applications

The Brownian excursion area

arises in connection with the enumeration of connected graphs, many other problems in combinatorial theory; see e.g. [6] [7] [8] [9] [10] and the limit distribution of the Betti numbers of certain varieties in cohomology theory. [11] Takacs (1991a) shows that has density

where are the zeros of the Airy function and is the confluent hypergeometric function. Janson and Louchard (2007) show that

and

They also give higher-order expansions in both cases.

Janson (2007) gives moments of and many other area functionals. In particular,

Brownian excursions also arise in connection with queuing problems, [12] railway traffic, [13] [14] and the heights of random rooted binary trees. [15]

Notes

  1. Durrett, Iglehart: Functionals of Brownian Meander and Brownian Excursion, (1975)
  2. 1 2 Itô and McKean (1974, page 75)
  3. Chung (1976)
  4. Kennedy (1976)
  5. 1 2 Durrett and Iglehart (1977)
  6. Wright, E. M. (1977). "The number of connected sparsely edged graphs". Journal of Graph Theory . 1 (4): 317–330. doi:10.1002/jgt.3190010407.
  7. Wright, E. M. (1980). "The number of connected sparsely edged graphs. III. Asymptotic results". Journal of Graph Theory . 4 (4): 393–407. doi:10.1002/jgt.3190040409.
  8. Spencer J (1997). "Enumerating graphs and Brownian motion". Communications on Pure and Applied Mathematics. 50 (3): 291–294. doi:10.1002/(sici)1097-0312(199703)50:3<291::aid-cpa4>3.0.co;2-6.
  9. Janson, Svante (2007). "Brownian excursion area, Wright's constants in graph enumeration, and other Brownian areas". Probability Surveys. 4: 80–145. arXiv: 0704.2289 . Bibcode:2007arXiv0704.2289J. doi:10.1214/07-PS104. S2CID   14563292.
  10. Flajolet, P.; Louchard, G. (2001). "Analytic variations on the Airy distribution". Algorithmica. 31 (3): 361–377. CiteSeerX   10.1.1.27.3450 . doi:10.1007/s00453-001-0056-0. S2CID   6522038.
  11. Reineke M (2005). "Cohomology of noncommutative Hilbert schemes". Algebras and Representation Theory. 8 (4): 541–561. arXiv: math/0306185 . doi:10.1007/s10468-005-8762-y. S2CID   116587916.
  12. Iglehart D. L. (1974). "Functional central limit theorems for random walks conditioned to stay positive". The Annals of Probability. 2 (4): 608–619. doi: 10.1214/aop/1176996607 .
  13. Takacs L (1991a). "A Bernoulli excursion and its various applications". Advances in Applied Probability. 23 (3): 557–585. doi:10.1017/s0001867800023739.
  14. Takacs L (1991b). "On a probability problem connected with railway traffic". Journal of Applied Mathematics and Stochastic Analysis. 4: 263–292. doi: 10.1155/S1048953391000011 .
  15. Takacs L (1994). "On the Total Heights of Random Rooted Binary Trees". Journal of Combinatorial Theory, Series B. 61 (2): 155–166. doi: 10.1006/jctb.1994.1041 .

Related Research Articles

<span class="mw-page-title-main">Brownian motion</span> Random motion of particles suspended in a fluid

Brownian motion is the random motion of particles suspended in a medium.

<span class="mw-page-title-main">Wiener process</span> Stochastic process generalizing Brownian motion

In mathematics, the Wiener process is a real-valued continuous-time stochastic process named in honor of American mathematician Norbert Wiener for his investigations on the mathematical properties of the one-dimensional Brownian motion. It is often also called Brownian motion due to its historical connection with the physical process of the same name originally observed by Scottish botanist Robert Brown. It is one of the best known Lévy processes and occurs frequently in pure and applied mathematics, economics, quantitative finance, evolutionary biology, and physics.

In physics, a Langevin equation is a stochastic differential equation describing how a system evolves when subjected to a combination of deterministic and fluctuating ("random") forces. The dependent variables in a Langevin equation typically are collective (macroscopic) variables changing only slowly in comparison to the other (microscopic) variables of the system. The fast (microscopic) variables are responsible for the stochastic nature of the Langevin equation. One application is to Brownian motion, which models the fluctuating motion of a small particle in a fluid.

<span class="mw-page-title-main">Fokker–Planck equation</span> Partial differential equation

In statistical mechanics and information theory, the Fokker–Planck equation is a partial differential equation that describes the time evolution of the probability density function of the velocity of a particle under the influence of drag forces and random forces, as in Brownian motion. The equation can be generalized to other observables as well. The Fokker-Planck equation has multiple applications in information theory, graph theory, data science, finance, economics etc.

In probability theory, the Brownian tree, or Aldous tree, or Continuum Random Tree (CRT) is a random real tree that can be defined from a Brownian excursion. The Brownian tree was defined and studied by David Aldous in three articles published in 1991 and 1993. This tree has since then been generalized.

In probability theory, the central limit theorem says that, under certain conditions, the sum of many independent identically-distributed random variables, when scaled appropriately, converges in distribution to a standard normal distribution. The martingale central limit theorem generalizes this result for random variables to martingales, which are stochastic processes where the change in the value of the process from time t to time t + 1 has expectation zero, even conditioned on previous outcomes.

In mathematics, the Milstein method is a technique for the approximate numerical solution of a stochastic differential equation. It is named after Grigori N. Milstein who first published it in 1974.

In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order to maximise an expected reward or minimise an expected cost. Optimal stopping problems can be found in areas of statistics, economics, and mathematical finance. A key example of an optimal stopping problem is the secretary problem. Optimal stopping problems can often be written in the form of a Bellman equation, and are therefore often solved using dynamic programming.

In mathematics, a local martingale is a type of stochastic process, satisfying the localized version of the martingale property. Every martingale is a local martingale; every bounded local martingale is a martingale; in particular, every local martingale that is bounded from below is a supermartingale, and every local martingale that is bounded from above is a submartingale; however, in general a local martingale is not a martingale, because its expectation can be distorted by large values of small probability. In particular, a driftless diffusion process is a local martingale, but not necessarily a martingale.

In mathematics – specifically, in stochastic analysis – an Itô diffusion is a solution to a specific type of stochastic differential equation. That equation is similar to the Langevin equation used in physics to describe the Brownian motion of a particle subjected to a potential in a viscous fluid. Itô diffusions are named after the Japanese mathematician Kiyosi Itô.

In actuarial science and applied probability, ruin theory uses mathematical models to describe an insurer's vulnerability to insolvency/ruin. In such models key quantities of interest are the probability of ruin, distribution of surplus immediately prior to ruin and deficit at time of ruin.

The narrow escape problem is a ubiquitous problem in biology, biophysics and cellular biology.

<span class="mw-page-title-main">Reflection principle (Wiener process)</span>

In the theory of probability for stochastic processes, the reflection principle for a Wiener process states that if the path of a Wiener process f(t) reaches a value f(s) = a at time t = s, then the subsequent path after time s has the same distribution as the reflection of the subsequent path about the value a. More formally, the reflection principle refers to a lemma concerning the distribution of the supremum of the Wiener process, or Brownian motion. The result relates the distribution of the supremum of Brownian motion up to time t to the distribution of the process at time t. It is a corollary of the strong Markov property of Brownian motion.

In probability theory, reflected Brownian motion is a Wiener process in a space with reflecting boundaries. In the physical literature, this process describes diffusion in a confined space and it is often called confined Brownian motion. For example it can describe the motion of hard spheres in water confined between two walls.

In queueing theory, a discipline within the mathematical theory of probability, a heavy traffic approximation is the matching of a queueing model with a diffusion process under some limiting conditions on the model's parameters. The first such result was published by John Kingman who showed that when the utilisation parameter of an M/M/1 queue is near 1 a scaled version of the queue length process can be accurately approximated by a reflected Brownian motion.

In the mathematical theory of probability, Brownian meander is a continuous non-homogeneous Markov process defined as follows:

In mathematics, the walk-on-spheres method (WoS) is a numerical probabilistic algorithm, or Monte-Carlo method, used mainly in order to approximate the solutions of some specific boundary value problem for partial differential equations (PDEs). The WoS method was first introduced by Mervin E. Muller in 1956 to solve Laplace's equation, and was since then generalized to other problems.

In computational statistics, the Metropolis-adjusted Langevin algorithm (MALA) or Langevin Monte Carlo (LMC) is a Markov chain Monte Carlo (MCMC) method for obtaining random samples – sequences of random observations – from a probability distribution for which direct sampling is difficult. As the name suggests, MALA uses a combination of two mechanisms to generate the states of a random walk that has the target probability distribution as an invariant measure:

The redundancy principle in biology expresses the need of many copies of the same entity to fulfill a biological function. Examples are numerous: disproportionate numbers of spermatozoa during fertilization compared to one egg, large number of neurotransmitters released during neuronal communication compared to the number of receptors, large numbers of released calcium ions during transient in cells, and many more in molecular and cellular transduction or gene activation and cell signaling. This redundancy is particularly relevant when the sites of activation are physically separated from the initial position of the molecular messengers. The redundancy is often generated for the purpose of resolving the time constraint of fast-activating pathways. It can be expressed in terms of the theory of extreme statistics to determine its laws and quantify how the shortest paths are selected. The main goal is to estimate these large numbers from physical principles and mathematical derivations.

In the mathematical theory of probability, Lenglart's inequality was proved by Èrik Lenglart in 1977. Later slight modifications are also called Lenglart's inequality.

References