 | This article provides insufficient context for those unfamiliar with the subject.(September 2015) |
In probability theory, the Brownian web is an uncountable collection of one-dimensional coalescing Brownian motions, starting from every point in space and time. It arises as the diffusive space-time scaling limit of a collection of coalescing random walks, with one walk starting from each point of the integer lattice Z at each time.
![Graphical construction of the voter model with configuration
e
t
:=
(
e
t
(
x
)
)
x
[?]
Z
[?]
{
0
,
1
}
Z
{\displaystyle \eta _{t}:=(\eta _{t}(x))_{x\in \mathbb {Z} }\in \{0,1\}^{\mathbb {Z} }}
. The arrows determine when a voter changes its opinion to that of the neighbor pointed to by the arrow. The genealogies are obtained by following the arrows backwards in time, which are distributed as coalescing random walks. Voter model graphical construction.png](http://upload.wikimedia.org/wikipedia/en/thumb/f/f6/Voter_model_graphical_construction.png/350px-Voter_model_graphical_construction.png)
What is now known as the Brownian web was first conceived by Arratia in his Ph.D. thesis [1] and a subsequent incomplete and unpublished manuscript. [2] Arratia studied the voter model, an interacting particle system that models the evolution of a population's political opinions. The individuals of the population are represented by the vertices of a graph, and each individual carries one of two possible opinions, represented as either 0 or 1. Independently at rate 1, each individual changes its opinion to that of a randomly chosen neighbor. The voter model is known to be dual to coalescing random walks (i.e., the random walks move independently when they are apart, and move as a single walk once they meet) in the sense that: each individual's opinion at any time can be traced backwards in time to an ancestor at time 0, and the joint genealogies of the opinions of different individuals at different times is a collection of coalescing random walks evolving backwards in time. In spatial dimension 1, coalescing random walks starting from a finite number of space-time points converge to a finite number of coalescing Brownian motions, if space-time is rescaled diffusively (i.e., each space-time point (x,t) gets mapped to (εx,ε^2t), with ε↓0). This is a consequence of Donsker's invariance principle. The less obvious question is:
![Coalescing random walks on the discrete space-time lattice
Z
e
v
e
n
2
:=
{
(
x
,
n
)
[?]
Z
2
:
x
+
n
is even
}
.
{\displaystyle \mathbb {Z} _{\rm {even}}^{2}:=\{(x,n)\in \mathbb {Z} ^{2}:x+n{\mbox{ is even}}\}.}
From each lattice point, an arrow is drawn either up-right or up-left with probability 1/2 each. The random walks move upward in time by following the arrows, and different random walks coalesce once they meet. Coalescing random walks.png](http://upload.wikimedia.org/wikipedia/commons/thumb/f/fb/Coalescing_random_walks.png/350px-Coalescing_random_walks.png)
What is the diffusive scaling limit of the joint collection of one-dimensional coalescing random walks starting fromeverypoint in space-time?
Arratia set out to construct this limit, which is what we now call the Brownian web. Formally speaking, it is a collection of one-dimensional coalescing Brownian motions starting from every space-time point in . The fact that the Brownian web consists of an uncountable number of Brownian motions is what makes the construction highly non-trivial. Arratia gave a construction but was unable to prove convergence of coalescing random walks to a limiting object and characterize such a limiting object.
Tóth and Werner in their study of the true self-repelling motion [3] obtained many detailed properties of this limiting object and its dual but did not prove convergence of coalescing walks to this limiting object or characterize it. The main difficulty in proving convergence stems from the existence of random points from which the limiting object can have multiple paths. Arratia and Tóth and Werner were aware of the existence of such points and they provided different conventions to avoid such multiplicity. Fontes, Isopi, Newman and Ravishankar [4] introduced a topology for the limiting object so that it is realized as a random variable taking values in a Polish space, in this case, the space of compact sets of paths. This choice allows for the limiting object to have multiple paths from a random space time point. The introduction of this topology allowed them to prove the convergence of the coalescing random walks to a unique limiting object and characterize it. They named this limiting object Brownian web.
An extension of the Brownian web, called the Brownian net, has been introduced by Sun and Swart [5] by allowing the coalescing Brownian motions to undergo branching. An alternative construction of the Brownian net was given by Newman, Ravishankar and Schertzer. [6]
For a recent survey, see Schertzer, Sun and Swart. [7]
Brownian motion is the random motion of particles suspended in a medium.
In probability theory and related fields, a stochastic or random process is a mathematical object usually defined as a sequence of random variables, where the index of the sequence has the interpretation of time. Stochastic processes are widely used as mathematical models of systems and phenomena that appear to vary in a random manner. Examples include the growth of a bacterial population, an electrical current fluctuating due to thermal noise, or the movement of a gas molecule. Stochastic processes have applications in many disciplines such as biology, chemistry, ecology, neuroscience, physics, image processing, signal processing, control theory, information theory, computer science, and telecommunications. Furthermore, seemingly random changes in financial markets have motivated the extensive use of stochastic processes in finance.
In mathematics, a random walk, sometimes known as a drunkard's walk, is a random process that describes a path that consists of a succession of random steps on some mathematical space.
In statistics, Markov chain Monte Carlo (MCMC) methods comprise a class of algorithms for sampling from a probability distribution. By constructing a Markov chain that has the desired distribution as its equilibrium distribution, one can obtain a sample of the desired distribution by recording states from the chain. The more steps that are included, the more closely the distribution of the sample matches the actual desired distribution. Various algorithms exist for constructing chains, including the Metropolis–Hastings algorithm.
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 mathematics, loop-erased random walk is a model for a random simple path with important applications in combinatorics, physics and quantum field theory. It is intimately connected to the uniform spanning tree, a model for a random tree. See also random walk for more general treatment of this topic.
In probability theory, an empirical process is a stochastic process that describes the proportion of objects in a system in a given state. For a process in a discrete state space a population continuous time Markov chain or Markov population model is a process which counts the number of objects in a given state . In mean field theory, limit theorems are considered and generalise the central limit theorem for empirical measures. Applications of the theory of empirical processes arise in non-parametric statistics.
In probability theory, Donsker's theorem, named after Monroe D. Donsker, is a functional extension of the central limit theorem.
In probability theory, the Schramm–Loewner evolution with parameter κ, also known as stochastic Loewner evolution (SLEκ), is a family of random planar curves that have been proven to be the scaling limit of a variety of two-dimensional lattice models in statistical mechanics. Given a parameter κ and a domain in the complex plane U, it gives a family of random curves in U, with κ controlling how much the curve turns. There are two main variants of SLE, chordal SLE which gives a family of random curves from two fixed boundary points, and radial SLE, which gives a family of random curves from a fixed boundary point to a fixed interior point. These curves are defined to satisfy conformal invariance and a domain Markov property.
In probability theory and statistical mechanics, the Gaussian free field (GFF) is a Gaussian random field, a central model of random surfaces. Sheffield (2007) gives a mathematical survey of the Gaussian free field.
Gregory Francis Lawler is an American mathematician working in probability theory and best known for his work since 2000 on the Schramm–Loewner evolution.
Bálint Tόth is a Hungarian mathematician whose work concerns probability theory, stochastic process and probabilistic aspects of mathematical physics. He obtained PhD in 1988 from the Hungarian Academy of Sciences, worked as senior researcher at the Institute of Mathematics of the HAS and as professor of mathematics at TU Budapest. He holds the Chair of Probability at the University of Bristol and is a research professor at the Alfréd Rényi Institute of Mathematics, Budapest.
Moshe Zakai was a Distinguished Professor at the Technion, Israel in electrical engineering, member of the Israel Academy of Sciences and Humanities and Rothschild Prize winner.
In probability theory a Brownian excursion process is a stochastic process that is closely related to a Wiener process. 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.
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.
Richard Alejandro Arratia is a mathematician noted for his work in combinatorics and probability theory.
Gady Kozma is an Israeli mathematician. Kozma obtained his PhD in 2001 at the University of Tel Aviv with Alexander Olevskii. He is a scientist at the Weizmann Institute. In 2005, he demonstrated the existence of the scaling limit value of the loop-erased random walk in three dimensions and its invariance under rotations and dilations.
Vladas Sidoravicius was a Lithuanian-Brazilian mathematician, specializing in probability theory.
Jason Peter Miller is an American mathematician, specializing in probability theory.
