zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Depth-first search of random trees, and Poisson point processes. (English) Zbl 0867.60061
Athreya, Krishna B. (ed.) et al., Classical and modern branching processes. Proceedings of the IMA workshop, Minneapolis, MN, USA, June 13–17, 1994. New York, NY: Springer. IMA Vol. Math. Appl. 84, 111-126 (1997).
Summary: Random planar trees can be represented by point processes in the upper positive quadrant of the plane. This proves helpful in studying the distance-from-the-root process of the depth-first search: For certain splitting trees this so-called contour process is seen to be Markovian and its jump intensities can be explicitly calculated. The representation via point processes also allows to construct locally infinite splitting trees. Moreover we show how to generate Galton-Watson branching trees with possibly infinite offspring variance out of Poisson point processes.
MSC:
60J80Branching processes
60G55Point processes
60J25Continuous-time Markov processes on general state spaces