On the size of a maximal induced tree in a random graph
Michał Karoński, Zbigniew Palka (1980)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Michał Karoński, Zbigniew Palka (1980)
Mathematica Slovaca
Similarity:
Zhan Shi (2011)
ESAIM: Proceedings
Similarity:
These notes provide an elementary and self-contained introduction to branching random walks. Section 1 gives a brief overview of Galton–Watson trees, whereas Section 2 presents the classical law of large numbers for branching random walks. These two short sections are not exactly indispensable, but they introduce the idea of using size-biased trees, thus giving motivations and an avant-goût to the main part, Section 3, where branching...
Michał Karoński, Zbigniew Palka (1981)
Mathematica Slovaca
Similarity:
A. Meir, J.W. Moon (1981)
Aequationes mathematicae
Similarity:
Zbigniew Pałka (1982)
Colloquium Mathematicae
Similarity:
Takács, Lajos (1993)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Takacs, Christiane (1997)
Electronic Journal of Probability [electronic only]
Similarity: