Svante Janson
-
Plane recursive trees, Stirling permutations and an urn model
dmtcs:3590 -
Discrete Mathematics & Theoretical Computer Science,
January 1, 2008,
DMTCS Proceedings vol. AI, Fifth Colloquium on Mathematics and Computer Science
-
https://doi.org/10.46298/dmtcs.3590
Plane recursive trees, Stirling permutations and an urn model
Authors: Svante Janson 1
NULL
Svante Janson
1 Department of Mathematics [Uppsala]
We exploit a bijection between plane recursive trees and Stirling permutations; this yields the equivalence of some results previously proven separately by different methods for the two types of objects as well as some new results. We also prove results on the joint distribution of the numbers of ascents, descents and plateaux in a random Stirling permutation. The proof uses an interesting generalized Pólya urn.
Embedding of Urn Schemes into Continuous Time Markov Branching Processes and Related Limit Theorems
7 Documents citing this article
Source : OpenCitations
Arcis, Diego; Mรกrquez, Sebastiรกn, 2021, Hopf Algebras On Planar Trees And Permutations, Journal Of Algebra And Its Applications, 21, 11, 10.1142/s0219498822502243.
Bodini, Olivier, 0000-0002-1867-667; Genitrini, Antoine; Naima, Mehdi, 2022, A Combinatorial Link Between Labelled Graphs And Increasingly Labelled Schrรถder Trees, LATIN 2022: Theoretical Informatics, pp. 493-509, 10.1007/978-3-031-20624-5_30.
Haglund, J.; Visontai, Mirkรณ, 2012, Stable Multivariate Eulerian Polynomials And Generalized Stirling Permutations, European Journal Of Combinatorics, 33, 4, pp. 477-487, 10.1016/j.ejc.2011.10.007.
Kuba, Markus; Panholzer, Alois, 2011, Analysis Of Statistics For Generalized Stirling Permutations, Combinatorics, Probability And Computing, 20, 6, pp. 875-910, 10.1017/s0963548311000381.
Kuba, Markus; Panholzer, Alois, 2016, On Moment Sequences And Mixed Poisson Distributions, Probability Surveys, 13, none, 10.1214/14-ps244.
Morcrette, Basile, 2012, Fully Analyzing An Algebraic Pรณlya Urn Model, LATIN 2012: Theoretical Informatics, pp. 568-581, 10.1007/978-3-642-29344-3_48.