Cut vertices in random planar maps (Q6199192): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.37236/11163 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3157135931 / rank | |||
Normal rank | |||
Revision as of 11:04, 30 July 2024
scientific article; zbMATH DE number 7808907
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cut vertices in random planar maps |
scientific article; zbMATH DE number 7808907 |
Statements
Cut vertices in random planar maps (English)
0 references
23 February 2024
0 references
Summary: 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.
0 references
subcritical classes of planar maps
0 references
central limit theorem
0 references
