Reflected Brownian motion

Last updated

In probability theory, reflected Brownian motion (or regulated Brownian motion, [1] [2] both with the acronym RBM) is a Wiener process in a space with reflecting boundaries. [3] 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. [4]

Contents

RBMs have been shown to describe queueing models experiencing heavy traffic [2] as first proposed by Kingman [5] and proven by Iglehart and Whitt. [6] [7]

Definition

A d–dimensional reflected Brownian motion Z is a stochastic process on uniquely defined by

where X(t) is an unconstrained Brownian motion and [9]

with Y(t) a d–dimensional vector where

The reflection matrix describes boundary behaviour. In the interior of the process behaves like a Wiener process; on the boundary "roughly speaking, Z is pushed in direction Rj whenever the boundary surface is hit, where Rj is the jth column of the matrix R." [9]

Stability conditions

Stability conditions are known for RBMs in 1, 2, and 3 dimensions. "The problem of recurrence classification for SRBMs in four and higher dimensions remains open." [9] In the special case where R is an M-matrix then necessary and sufficient conditions for stability are [9]

  1. R is a non-singular matrix and
  2. R−1μ < 0.

Marginal and stationary distribution

One dimension

The marginal distribution (transient distribution) of a one-dimensional Brownian motion starting at 0 restricted to positive values (a single reflecting barrier at 0) with drift μ and variance σ2 is

for all t  0, (with Φ the cumulative distribution function of the normal distribution) which yields (for μ < 0) when taking t  ∞ an exponential distribution [2]

For fixed t, the distribution of Z(t) coincides with the distribution of the running maximum M(t) of the Brownian motion,

But be aware that the distributions of the processes as a whole are very different. In particular, M(t) is increasing in t, which is not the case for Z(t).

The heat kernel for reflected Brownian motion at :

For the plane above

Multiple dimensions

The stationary distribution of a reflected Brownian motion in multiple dimensions is tractable analytically when there is a product form stationary distribution, [10] which occurs when the process is stable and [11]

where D =  diag(Σ). In this case the probability density function is [8]

where ηk = 2μkγk/Σkk and γ = R−1μ. Closed-form expressions for situations where the product form condition does not hold can be computed numerically as described below in the simulation section.

Simulation

One dimension

In one dimension the simulated process is the absolute value of a Wiener process. The following MATLAB program creates a sample path. [12]

% rbm.mn=10^4;h=10^(-3);t=h.*(0:n);mu=-1;X=zeros(1,n+1);M=X;B=X;B(1)=3;X(1)=3;fork=2:n+1Y=sqrt(h)*randn;U=rand(1);B(k)=B(k-1)+mu*h-Y;M=(Y+sqrt(Y^2-2*h*log(U)))/2;X(k)=max(M-Y,X(k-1)+h*mu-Y);endsubplot(2,1,1)plot(t,X,'k-');subplot(2,1,2)plot(t,X-B,'k-');

The error involved in discrete simulations has been quantified. [13]

Multiple dimensions

QNET allows simulation of steady state RBMs. [14] [15] [16]

Other boundary conditions

Feller described possible boundary condition for the process [17] [18] [19]

See also

Related Research Articles

Brownian motion Random motion of particles suspended in a fluid

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

In probability theory, the central limit theorem (CLT) establishes that, in many situations, when independent random variables are summed up, their properly normalized sum tends toward a normal distribution even if the original variables themselves are not normally distributed. The theorem is a key concept in probability theory because it implies that probabilistic and statistical methods that work for normal distributions can be applicable to many problems involving other types of distributions. This theorem has seen many changes during the formal development of probability theory. Previous versions of the theorem date back to 1811, but in its modern general form, this fundamental result in probability theory was precisely stated as late as 1920, thereby serving as a bridge between classical and modern probability theory.

Multivariate normal distribution Generalization of the one-dimensional normal distribution to higher dimensions

In probability theory and statistics, the multivariate normal distribution, multivariate Gaussian distribution, or joint normal distribution is a generalization of the one-dimensional (univariate) normal distribution to higher dimensions. One definition is that a random vector is said to be k-variate normally distributed if every linear combination of its k components has a univariate normal distribution. Its importance derives mainly from the multivariate central limit theorem. The multivariate normal distribution is often used to describe, at least approximately, any set of (possibly) correlated real-valued random variables each of which clusters around a mean value.

Log-normal distribution Probability distribution

In probability theory, a log-normal distribution is a continuous probability distribution of a random variable whose logarithm is normally distributed. Thus, if the random variable X is log-normally distributed, then Y = ln(X) has a normal distribution. Equivalently, if Y has a normal distribution, then the exponential function of Y, X = exp(Y), has a log-normal distribution. A random variable which is log-normally distributed takes only positive real values. It is a convenient and useful model for measurements in exact and engineering sciences, as well as medicine, economics and other topics.

Fokker–Planck equation Partial differential equation

In statistical mechanics, 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.

Random walk Mathematical formalization of a path that consists of a succession of random steps

In mathematics, a random walk is a mathematical object, known as a stochastic or random process, that describes a path that consists of a succession of random steps on some mathematical space such as the integers.

In probability theory, a Lévy process, named after the French mathematician Paul Lévy, is a stochastic process with independent, stationary increments: it represents the motion of a point whose successive displacements are random, in which displacements in pairwise disjoint time intervals are independent, and displacements in different time intervals of the same length have identical probability distributions. A Lévy process may thus be viewed as the continuous-time analog of a random walk.

Stochastic differential equation differential equations involving stochastic processes

A stochastic differential equation (SDE) is a differential equation in which one or more of the terms is a stochastic process, resulting in a solution which is also a stochastic process. SDEs are used to model various phenomena such as unstable stock prices or physical systems subject to thermal fluctuations. Typically, SDEs contain a variable which represents random white noise calculated as the derivative of Brownian motion or the Wiener process. However, other types of random behaviour are possible, such as jump processes. Random differential equations are conjugate to stochastic differential equations.

Itô calculus Calculus of stochastic differential equations

Itô calculus, named after Kiyosi Itô, extends the methods of calculus to stochastic processes such as Brownian motion. It has important applications in mathematical finance and stochastic differential equations.

Ornstein–Uhlenbeck process Stochastic process modeling random walk with friction

In mathematics, the Ornstein–Uhlenbeck process is a stochastic process with applications in financial mathematics and the physical sciences. Its original application in physics was as a model for the velocity of a massive Brownian particle under the influence of friction. It is named after Leonard Ornstein and George Eugene Uhlenbeck.

In queueing theory, a discipline within the mathematical theory of probability, a Jackson network is a class of queueing network where the equilibrium distribution is particularly simple to compute as the network has a product-form solution. It was the first significant development in the theory of networks of queues, and generalising and applying the ideas of the theorem to search for similar product-form solutions in other networks has been the subject of much research, including ideas used in the development of the Internet. The networks were first identified by James R. Jackson and his paper was re-printed in the journal Management Science’s ‘Ten Most Influential Titles of Management Sciences First Fifty Years.’

Inverse Gaussian distribution

In probability theory, the inverse Gaussian distribution is a two-parameter family of continuous probability distributions with support on (0,∞).

In mathematics, ergodicity expresses the idea that a point of a moving system, either a dynamical system or a stochastic process, will eventually visit all parts of the space that the system moves in, in a uniform and random sense. This implies that the average behavior of the system can be deduced from the trajectory of a "typical" point. Equivalently, a sufficiently large collection of random samples from a process can represent the average statistical properties of the entire process. Ergodicity is a property of the system; it is a statement that the system cannot be reduced or factored into smaller components. Ergodic theory is the study of systems possessing ergodicity.

In mathematics, Gaussian measure is a Borel measure on finite-dimensional Euclidean space Rn, closely related to the normal distribution in statistics. There is also a generalization to infinite-dimensional spaces. Gaussian measures are named after the German mathematician Carl Friedrich Gauss. One reason why Gaussian measures are so ubiquitous in probability theory is the central limit theorem. Loosely speaking, it states that if a random variable X is obtained by summing a large number N of independent random variables of order 1, then X is of order and its law is approximately Gaussian.

The concept of an abstract Wiener space is a mathematical construction developed by Leonard Gross to understand the structure of Gaussian measures on infinite-dimensional spaces. The construction emphasizes the fundamental role played by the Cameron–Martin space. The classical Wiener space is the prototypical example.

M/M/1 queue Queue with Markov (Poisson) arrival process, exponential service time distribution and one server

In queueing theory, a discipline within the mathematical theory of probability, an M/M/1 queue represents the queue length in a system having a single server, where arrivals are determined by a Poisson process and job service times have an exponential distribution. The model name is written in Kendall's notation. The model is the most elementary of queueing models and an attractive object of study as closed-form expressions can be obtained for many metrics of interest in this model. An extension of this model with more than one server is the M/M/c queue.

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.

In queueing theory, a discipline within the mathematical theory of probability, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The model has been used to approximate discrete models, model the spread of wildfires, in ruin theory and to model high speed data networks. The model applies the leaky bucket algorithm to a stochastic source.

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.

Exponential Tilting (ET), Exponential Twisting, or Exponential Change of Measure (ECM) is a distribution shifting technique used in many parts of mathematics. The different exponential tiltings of a random variable is known as the natural exponential family of .

References

  1. Dieker, A. B. (2011). "Reflected Brownian Motion". Wiley Encyclopedia of Operations Research and Management Science. doi:10.1002/9780470400531.eorms0711. ISBN   9780470400531.
  2. 1 2 3 Harrison, J. Michael (1985). Brownian Motion and Stochastic Flow Systems (PDF). John Wiley & Sons. ISBN   978-0471819394.
  3. Veestraeten, D. (2004). "The Conditional Probability Density Function for a Reflected Brownian Motion". Computational Economics. 24 (2): 185–207. doi:10.1023/B:CSEM.0000049491.13935.af. S2CID   121673717.
  4. Faucheux, Luc P.; Libchaber, Albert J. (1994-06-01). "Confined Brownian motion". Physical Review E. 49 (6): 5158–5163. doi:10.1103/PhysRevE.49.5158. ISSN   1063-651X.
  5. Kingman, J. F. C. (1962). "On Queues in Heavy Traffic". Journal of the Royal Statistical Society. Series B (Methodological). 24 (2): 383–392. doi:10.1111/j.2517-6161.1962.tb00465.x. JSTOR   2984229.
  6. Iglehart, Donald L.; Whitt, Ward (1970). "Multiple Channel Queues in Heavy Traffic. I". Advances in Applied Probability. 2 (1): 150–177. doi:10.2307/3518347. JSTOR   3518347. S2CID   202104090.
  7. Iglehart, Donald L.; Ward, Whitt (1970). "Multiple Channel Queues in Heavy Traffic. II: Sequences, Networks, and Batches" (PDF). Advances in Applied Probability. 2 (2): 355–369. doi:10.2307/1426324. JSTOR   1426324. S2CID   120281300 . Retrieved 30 Nov 2012.
  8. 1 2 Harrison, J. M.; Williams, R. J. (1987). "Brownian models of open queueing networks with homogeneous customer populations" (PDF). Stochastics. 22 (2): 77. doi:10.1080/17442508708833469.
  9. 1 2 3 4 Bramson, M.; Dai, J. G.; Harrison, J. M. (2010). "Positive recurrence of reflecting Brownian motion in three dimensions" (PDF). The Annals of Applied Probability. 20 (2): 753. arXiv: 1009.5746 . doi:10.1214/09-AAP631. S2CID   2251853.
  10. Harrison, J. M.; Williams, R. J. (1992). "Brownian Models of Feedforward Queueing Networks: Quasireversibility and Product Form Solutions". The Annals of Applied Probability. 2 (2): 263. doi: 10.1214/aoap/1177005704 . JSTOR   2959751.
  11. Harrison, J. M.; Reiman, M. I. (1981). "On the Distribution of Multidimensional Reflected Brownian Motion". SIAM Journal on Applied Mathematics. 41 (2): 345–361. doi:10.1137/0141030.
  12. Kroese, Dirk P.; Taimre, Thomas; Botev, Zdravko I. (2011). Handbook of Monte Carlo Methods . John Wiley & Sons. p.  202. ISBN   978-1118014950.
  13. Asmussen, S.; Glynn, P.; Pitman, J. (1995). "Discretization Error in Simulation of One-Dimensional Reflecting Brownian Motion". The Annals of Applied Probability. 5 (4): 875. doi: 10.1214/aoap/1177004597 . JSTOR   2245096.
  14. Dai, Jim G.; Harrison, J. Michael (1991). "Steady-State Analysis of RBM in a Rectangle: Numerical Methods and A Queueing Application". The Annals of Applied Probability. 1 (1): 16–35. CiteSeerX   10.1.1.44.5520 . doi:10.1214/aoap/1177005979. JSTOR   2959623.
  15. Dai, Jiangang "Jim" (1990). "Section A.5 (code for BNET)" (PDF). Steady-state analysis of reflected Brownian motions: characterization, numerical methods and queueing applications (Ph. D. thesis) (Thesis). Stanford University. Dept. of Mathematics. Retrieved 5 December 2012.
  16. Dai, J. G.; Harrison, J. M. (1992). "Reflected Brownian Motion in an Orthant: Numerical Methods for Steady-State Analysis" (PDF). The Annals of Applied Probability. 2 (1): 65–86. doi: 10.1214/aoap/1177005771 . JSTOR   2959654.
  17. 1 2 3 4 5 Skorokhod, A. V. (1962). "Stochastic Equations for Diffusion Processes in a Bounded Region. II". Theory of Probability and Its Applications. 7: 3–23. doi:10.1137/1107002.
  18. Feller, W. (1954). "Diffusion processes in one dimension". Transactions of the American Mathematical Society. 77: 1–31. doi: 10.1090/S0002-9947-1954-0063607-6 . MR   0063607.
  19. Engelbert, H. J.; Peskir, G. (2012). "Stochastic Differential Equations for Sticky Brownian Motion" (PDF). Probab. Statist. Group Manchester Research Report (5).
  20. Chung, K. L.; Zhao, Z. (1995). "Killed Brownian Motion". From Brownian Motion to Schrödinger's Equation. Grundlehren der mathematischen Wissenschaften. Vol. 312. p. 31. doi:10.1007/978-3-642-57856-4_2. ISBN   978-3-642-63381-2.
  21. Itō, K.; McKean, H. P. (1996). "Time changes and killing". Diffusion Processes and their Sample Paths . pp.  164. doi:10.1007/978-3-642-62025-6_6. ISBN   978-3-540-60629-1.