M. Drmota and B. Gittenberger, The width of Galton-Watson trees, J. Combinat. Theory, submitted. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parking Functions, Empirical Processes, and the Width of.. - Chassaing, Marckert (Correct)
....the electronic journal of combinatorics 8 (2001) #R14 16 asymptotics of the maximum of the the BFS random walk for general simple trees with nite degree. Together with Proposition 2.1, it gives asymptotics for moments of the width of general simple trees with nite degree. In a recent paper [10], Drmota and Gittenberger derived asymptotics of all moments (without rate) of width of general simple trees. In [7] the results of Subsections 4.3 and 4.5 are generalized to study the emergence of a giant block of consecutive cars for a parking function. An interesting phenomenon of ....
M. Drmota & B. Gittenberger, (2001) The width of Galton-Watson trees. Available at: http://www.geometrie.tuwien.ac.at/drmota/
Parking Functions, Empirical Processes, and the Width of.. - Chassaing, Marckert (Correct)
....the electronic journal of combinatorics 8 (2001) #R14 16 asymptotics of the maximum of the the BFS random walk for general simple trees with finite degree. Together with Proposition 2.1, it gives asymptotics for moments of the width of general simple trees with finite degree. In a recent paper [10], Drmota and Gittenberger derived asymptotics of all moments (without rate) of width of general simple trees. In [7] the results of Subsections 4.3 and 4.5 are generalized to study the emergence of a giant block of consecutive cars for a parking function. An interesting phenomenon of ....
M. Drmota & B. Gittenberger, (2001) The width of Galton-Watson trees. Available at: http://www.geometrie.tuwien.ac.at/drmota/
Stochastic Analysis Of Tree-Like Data Structures - Drmota (2002) Self-citation (Drmota) (Correct)
No context found.
M. Drmota and B. Gittenberger, The width of Galton-Watson trees, J. Combinat. Theory, submitted.
Reinforced Weak Convergence of Stochastic Processes - Michael Drmota And (2001) (1 citation) Self-citation (Drmota) (Correct)
No context found.
M. Drmota and G. Gittenberger, The width of Galton-Watson trees, J. Combinat. Theory, submitted.
Reinforced Weak Convergence of Stochastic Processes - Drmota, Marckert (2001) (1 citation) Self-citation (Drmota) (Correct)
....of Fuk Nagaev [10] 4 Applications to Trees and Excursions It is well known that a lot of processes associated to simple trees by traversal algorithms (depth rst search, breadth rst search. converges weakly to the Brownian excursion (or to Brownian excursion local time) see for example [1, 8, 12]. It was one motivation of this paper to show that the convergence of these processes to Brownian excursion is not only weak, but polynomially. Section 4 is organized as follows: in Subsection 4.1 we show that Theorem 1 applies to the contour of simple trees (that is the process of the height of ....
....trees) The sequence of processes e n converges polynomially to 2 e: For this purpose we apply Theorem 1, i.e. we have to prove (4) and (5) 4) is trivially satis ed since Xn (0) 0. In order to show (5) we use the following estimate which is already contained in [11] compare also with [8]. Lemma 4 There exist constants C; D 0 such that for all s; t 2 [0; 1] and 0, Prfj e n (s) e n (t)j g C 4 js tj exp D p js tj : Now (5) follows from the following property. Lemma 5 Suppose that a sequence of processes Xn n on C[0; 1] satis es PrfjXn (s) Xn ....
M. Drmota and G. Gittenberger, The width of Galton-Watson trees, J. Combinat. Theory, submitted.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC