在随机平面图中切割顶点

IF 0.7 4区数学 Q2 MATHEMATICS

Electronic Journal of Combinatorics Pub Date : 2023-09-22 DOI:10.37236/11163

Michael Drmota, Marc Noy, Benedikt Stufler

{"title":"在随机平面图中切割顶点","authors":"Michael Drmota, Marc Noy, Benedikt Stufler","doi":"10.37236/11163","DOIUrl":null,"url":null,"abstract":"The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \\to c$ in probability (for some explicit $c>0$). For so-called subcritical classes of planar maps (like outerplanar maps) we obtain a central limit theorem, too. Interestingly the combinatorics behind this seemingly simple problem is quite involved.","PeriodicalId":11515,"journal":{"name":"Electronic Journal of Combinatorics","volume":"74 1","pages":"0"},"PeriodicalIF":0.7000,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Cut Vertices in Random Planar Maps\",\"authors\":\"Michael Drmota, Marc Noy, Benedikt Stufler\",\"doi\":\"10.37236/11163\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \\\\to c$ in probability (for some explicit $c>0$). For so-called subcritical classes of planar maps (like outerplanar maps) we obtain a central limit theorem, too. Interestingly the combinatorics behind this seemingly simple problem is quite involved.\",\"PeriodicalId\":11515,\"journal\":{\"name\":\"Electronic Journal of Combinatorics\",\"volume\":\"74 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-09-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronic Journal of Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37236/11163\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronic Journal of Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37236/11163","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}

引用次数: 0

摘要

本文的主要目的是确定具有$n$条边的随机平面映射中切割顶点数目$X_n$的渐近行为。它显示了$X_n/n \到c$的概率(对于一些显式的$c>0$)。对于所谓的次临界类的平面映射(如外平面映射)，我们也得到了一个中心极限定理。有趣的是，这个看似简单的问题背后的组合学是相当复杂的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Cut Vertices in Random Planar Maps

The main goal of this paper is to determine the asymptotic behavior of the number $X_n$ of cut-vertices in random planar maps with $n$ edges. It is shown that $X_n/n \to c$ in probability (for some explicit $c>0$). For so-called subcritical classes of planar maps (like outerplanar maps) we obtain a central limit theorem, too. Interestingly the combinatorics behind this seemingly simple problem is quite involved.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronic Journal of Combinatorics 数学-数学

CiteScore

1.30

自引率

14.30%

发文量

212

审稿时长

3-6 weeks

期刊介绍： The Electronic Journal of Combinatorics (E-JC) is a fully-refereed electronic journal with very high standards, publishing papers of substantial content and interest in all branches of discrete mathematics, including combinatorics, graph theory, and algorithms for combinatorial problems.