{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T08:53:18Z","timestamp":1772268798399,"version":"3.50.1"},"reference-count":39,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T00:00:00Z","timestamp":1318291200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2011,11]]},"abstract":"<jats:p>In this work we give a study of generalizations of Stirling permutations, a restricted class of permutations of multisets introduced by Gessel and Stanley [15]. First we give several bijections between such generalized Stirling permutations and various families of increasing trees extending the known correspondences of [20, 21]. Then we consider several permutation statistics of interest for generalized Stirling permutations as the number of left-to-right minima, the number of left-to-right maxima, the number of blocks of specified sizes, the distance between occurrences of elements, and the number of inversions. For all these quantities we give a distributional study, where the established connections to increasing trees turn out to be very useful. To obtain the exact and limiting distribution results we use several techniques ranging from generating functions, connections to urn models, martingales and Stein's method.<\/jats:p>","DOI":"10.1017\/s0963548311000381","type":"journal-article","created":{"date-parts":[[2011,10,11]],"date-time":"2011-10-11T07:51:16Z","timestamp":1318319476000},"page":"875-910","source":"Crossref","is-referenced-by-count":9,"title":["Analysis of Statistics for Generalized Stirling Permutations"],"prefix":"10.1017","volume":"20","author":[{"given":"MARKUS","family":"KUBA","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALOIS","family":"PANHOLZER","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2011,10,11]]},"reference":[{"key":"S0963548311000381_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801655"},{"key":"S0963548311000381_ref8","article-title":"Unimodal, log-concave, and P\u00f3lya frequency sequences in combinatorics","volume":"81","author":"Brenti","year":"1989","journal-title":"Mem. Amer. Math. Soc."},{"key":"S0963548311000381_ref39","volume-title":"Generatingfunctionology","author":"Wilf","year":"1994"},{"key":"S0963548311000381_ref35","first-page":"117","article-title":"Sur quelques points de la th\u00e9orie des probabilit\u00e9s","volume":"1","author":"P\u00f3lya","year":"1931","journal-title":"Ann. Inst. Poincar\u00e9"},{"key":"S0963548311000381_ref33","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(94)90239-9"},{"key":"S0963548311000381_ref24","doi-asserted-by":"crossref","unstructured":"[24] Kuba M. and Panholzer A. (2007) Limiting distributions for a class of diminishing urn models. Manuscript, (submitted).","DOI":"10.46298\/dmtcs.3519"},{"key":"S0963548311000381_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S0001867800014701"},{"key":"S0963548311000381_ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070702254"},{"key":"S0963548311000381_ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90003-5"},{"key":"S0963548311000381_ref22","volume-title":"Urn Models and their Application","author":"Johnson","year":"1977"},{"key":"S0963548311000381_ref28","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1177005874"},{"key":"S0963548311000381_ref6","doi-asserted-by":"publisher","DOI":"10.1201\/9780203494370"},{"key":"S0963548311000381_ref13","first-page":"59","volume-title":"Discrete Mathematics and Computer Science: Proc. Fourth Colloquium on Mathematics and Computer Science","author":"Flajolet","year":"2006"},{"key":"S0963548311000381_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90014-2"},{"key":"S0963548311000381_ref4","first-page":"24","volume-title":"CAAP'1992: Proc. 17th Colloquium on Trees in Algebra and Programming","author":"Bergeron","year":"1992"},{"key":"S0963548311000381_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.spa.2003.12.002"},{"key":"S0963548311000381_ref16","doi-asserted-by":"publisher","DOI":"10.1006\/eujc.1997.0179"},{"key":"S0963548311000381_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/zamm.19230030407"},{"key":"S0963548311000381_ref18","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20046"},{"key":"S0963548311000381_ref38","first-page":"431","volume-title":"Handbook of Theoretical Computer Science","author":"Vitter","year":"1990"},{"key":"S0963548311000381_ref23","doi-asserted-by":"crossref","DOI":"10.37236\/1034","article-title":"Descendants in increasing trees","volume":"13","author":"Kuba","year":"2006","journal-title":"Electron. J. Combin."},{"key":"S0963548311000381_ref5","first-page":"1","volume-title":"Handbook of Graphs and Networks","author":"Bollob\u00e1s","year":"2003"},{"key":"S0963548311000381_ref36","doi-asserted-by":"crossref","DOI":"10.37236\/1253","article-title":"Descendants in heap ordered trees, or, A triumph of computer algebra","volume":"3","author":"Prodinger","year":"1996","journal-title":"Electron. J. Combin."},{"key":"S0963548311000381_ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511666193"},{"key":"S0963548311000381_ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008656320759"},{"key":"S0963548311000381_ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90090-6"},{"key":"S0963548311000381_ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.066124"},{"key":"S0963548311000381_ref26","article-title":"Inversions in permutations: A saddle point approach","volume":"6","author":"Louchard","year":"2003","journal-title":"J. Integers Sequences"},{"key":"S0963548311000381_ref20","doi-asserted-by":"crossref","unstructured":"[20] Janson S. (2008) Plane recursive trees, Stirling permutations and an urn model. DMTCS: Proc. Fifth Colloquium on Mathematics and Computer Science Algorithms, Trees, Combinatorics and Probabilities, pp. 541\u2013548.","DOI":"10.46298\/dmtcs.3590"},{"key":"S0963548311000381_ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(73)90038-1"},{"key":"S0963548311000381_ref31","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20161"},{"key":"S0963548311000381_ref25","volume-title":"Probability Theory I","author":"Lo\u00e8ve","year":"1977"},{"key":"S0963548311000381_ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-005-0442-7"},{"key":"S0963548311000381_ref27","first-page":"53","article-title":"Urn models and connections to random trees: A review","volume":"2","author":"Mahmoud","year":"2003","journal-title":"J. Iranian Math. Soc."},{"key":"S0963548311000381_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90042-0"},{"key":"S0963548311000381_ref10","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20202"},{"key":"S0963548311000381_ref29","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240040204"},{"key":"S0963548311000381_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2009.11.006"},{"key":"S0963548311000381_ref30","first-page":"1","article-title":"Permutations with inversions","volume":"4","author":"Margolius","year":"2001","journal-title":"J. Integer Sequences"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548311000381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,10]],"date-time":"2021-12-10T00:44:35Z","timestamp":1639097075000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548311000381\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,11]]},"references-count":39,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["S0963548311000381"],"URL":"https:\/\/doi.org\/10.1017\/s0963548311000381","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,11]]}}}