Limit distributions of the number of vertices of a given out-degree in a random forest (Q876846): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Emergence of the giant tree in a random forest / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5512461 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5829358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4076577 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Markov chain intersections and the loop-erased walk / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4004056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limit distributions for the number of leaves in a random forest / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Limit distributions of the number of vertices in strata of a simply generated forest / rank | |||
Normal rank |
Revision as of 16:43, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Limit distributions of the number of vertices of a given out-degree in a random forest |
scientific article |
Statements
Limit distributions of the number of vertices of a given out-degree in a random forest (English)
0 references
19 April 2007
0 references
The authors study a Galton-Watson forest with \(N\) trees and \(n\) nonrooted vertices (or particles). They obtain the limit properties of the number of vertices with a given number out-degree or particles with, say, \(r\) offsprings as \(N\) and \(n\) tend to infinity by different ways.
0 references
random forest
0 references
Galton-Watson process
0 references
limit distribution
0 references