Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
Pitman, Jim (2001)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Displaying similar documents to “Average execution times of series-parallel networks.”
Random mappings, forests, and subsets associated with Abel-Cayley-Hurwitz multinomial expansions.
A new family of Markov branching trees: the alpha-gamma model.
Chen, Bo, Ford, Daniel, Winkel, Matthias (2009)
Electronic Journal of Probability [electronic only]
Similarity:
Random perturbations of stochastic processes with unbounded variable length memory.
Collet, Pierre, Galves, Antonio, Leonardi, Florencia (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Existence of multi-dimensional infinite volume self-organized critical forest-fire models.
Dürre, Maximilian (2006)
Electronic Journal of Probability [electronic only]
Similarity:
A note on bisexual Galton-Watson branching processes with immigration.
M. González, M. Molina, M. Mota (2001)
Extracta Mathematicae
Similarity:
The combinatorics of evolutionary trees---a survey.
Székely, Laszlo A., Erdős, Péter L., Steel, M.A. (1992)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Radius and profile of random planar maps with faces of arbitrary degrees.
Miermont, Grégory, Weill, Mathilde (2008)
Electronic Journal of Probability [electronic only]
Similarity:
Arbology: Trees and pushdown automata
Bořivoj Melichar, Jan Janoušek, Tomas Flouri (2012)
Kybernetika
Similarity:
We present a unified and systematic approach to basic principles of Arbology, a new algorithmic discipline focusing on algorithms on trees. Stringology, a highly developed algorithmic discipline in the area of string processing, can use finite automata as its basic model of computation. For various kinds of linear notations of ranked and unranked ordered trees it holds that subtrees of a tree in a linear notation are substrings of the tree in the linear notation. Arbology uses pushdown...