{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T03:46:52Z","timestamp":1759117612701},"reference-count":16,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T00:00:00Z","timestamp":1549238400000},"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":[[2019,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We prove a generalmulti-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers<jats:italic>D<\/jats:italic>. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with refined analytic tools to deal with the systems of equations on infinite variables that arise. We also discuss possible extensions to maps of higher genus and to weighted maps.<\/jats:p>","DOI":"10.1017\/s0963548318000573","type":"journal-article","created":{"date-parts":[[2019,2,4]],"date-time":"2019-02-04T07:44:57Z","timestamp":1549266297000},"page":"519-541","source":"Crossref","is-referenced-by-count":2,"title":["Limit laws of planar maps with prescribed vertex degrees"],"prefix":"10.1017","volume":"28","author":[{"given":"G.","family":"Collet","sequence":"first","affiliation":[]},{"given":"M.","family":"Drmota","sequence":"additional","affiliation":[]},{"given":"L. D.","family":"Klausner","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2019,2,4]]},"reference":[{"key":"S0963548318000573_ref15","doi-asserted-by":"publisher","DOI":"10.1214\/EJP.v13-478"},{"key":"S0963548318000573_ref14","doi-asserted-by":"publisher","DOI":"10.1214\/009117906000000908"},{"key":"S0963548318000573_ref13","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1007\/s00453-013-9751-x","article-title":"A central limit theorem for the number of degree-k vertices in random maps","volume":"66","author":"Drmota","year":"2013","journal-title":"Algorithmica"},{"key":"S0963548318000573_ref12","first-page":"453","volume-title":"23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods in the Analysis of Algorithms (AofA \u201912)","author":"Drmota","year":"2012"},{"key":"S0963548318000573_ref9","doi-asserted-by":"publisher","DOI":"10.1137\/080720097"},{"key":"S0963548318000573_ref4","first-page":"227","volume-title":"28th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2016)","author":"Bettinelli","year":"2016"},{"key":"S0963548318000573_ref5","doi-asserted-by":"crossref","first-page":"R69","DOI":"10.37236\/1822","article-title":"Planar maps as labeled mobiles","volume":"11","author":"Bouttier","year":"2004","journal-title":"Electron. J. Combin"},{"key":"S0963548318000573_ref8","doi-asserted-by":"crossref","first-page":"R148","DOI":"10.37236\/872","article-title":"A complete grammar for decomposing a family of graphs into 3-connected components","volume":"15","author":"Chapuy","year":"2008","journal-title":"Electron. J. Combin"},{"key":"S0963548318000573_ref1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0963548314000728","article-title":"Formulae and asymptotics for coefficients of algebraic functions","volume":"24","author":"Banderier","year":"2015","journal-title":"Combin. Probab. Comput."},{"key":"S0963548318000573_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2016.08.001"},{"key":"S0963548318000573_ref16","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1963-029-x"},{"key":"S0963548318000573_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548309009808"},{"key":"S0963548318000573_ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(86)90065-8"},{"key":"S0963548318000573_ref3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1090\/dimacs\/009\/03","volume-title":"Planar Graphs","author":"Bender","year":"1993"},{"key":"S0963548318000573_ref10","first-page":"607","volume-title":"24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2012)","author":"Collet","year":"2012"},{"key":"S0963548318000573_ref11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-211-75357-6","volume-title":"Random Trees: An Interplay Between Combinatorics and Probability","author":"Drmota","year":"2009"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548318000573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T06:26:57Z","timestamp":1606372017000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548318000573\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,4]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,7]]}},"alternative-id":["S0963548318000573"],"URL":"https:\/\/doi.org\/10.1017\/s0963548318000573","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,2,4]]}}}