zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Convergence of coalescing nonsimple random walks to the Brownian web. (English) Zbl 1067.60099
The paper addresses discrete time processes of coalescing (annihilating) random walks. A specific subclass of non-simple random walks allows for multiple intersections before they eventually annihilate. The main goal of the paper is to prove the weak convergence of coalescing non-simple random walks to the so-called Brownian web. The idea of the latter originates from the unpublished {\it R. Arratia}’s thesis (1979), where a process of coalescing Brownian motions on a line, starting from every point on $R$ at time zero, has been constructed. The process of annihilating Brownian motions starting from every point in space and time is called the Brownian web. Major convergence proofs were formulated for the case of simple random walks. Because of multiple crossings presupposed for non-simple walks, the convergence analysis is more subtle. The new convergence criteria for the case of crossing paths are formulated and verified for non-simple random walks satisfying a finite fifth moment condition. Several corollaries pertain to the scaling limit of voter model interfaces, extending results of {\it J. T. Cox} and {\it R. Durrett} [Bernoulli 1, 343-370 (1995; Zbl 0849.60088)].

60K35Interacting random processes; statistical mechanics type models; percolation theory
60J65Brownian motion
60D05Geometric probability and stochastic geometry
82C22Interacting particle systems
Full Text: EMIS EuDML arXiv