Doob-Martin boundary of Rémy's tree growth chain (Q516121)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Doob-Martin boundary of Rémy's tree growth chain |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Doob-Martin boundary of Rémy's tree growth chain |
scientific article |
Statements
Doob-Martin boundary of Rémy's tree growth chain (English)
0 references
22 March 2017
0 references
The present paper is an extended study of the Doob-Martin boundary of \textit{J.-L. Rémy}'s tree growth chain [RAIRO, Inf. Théor. 19, 179--195 (1985; Zbl 0565.05037)] in the spirit of the identification of graphons as limit objects in the theory of graph limits. Rémy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a manner that the \(n\)th tree is uniformly distributed over the set of rooted, planar binary trees with \(2n+1\) vertices.
0 references
Doob-Martin boundary
0 references
Rémy's tree
0 references
0.7599806785583496
0 references
0.7238922715187073
0 references
0.7237788438796997
0 references
0.7216413021087646
0 references
0.7195862531661987
0 references
