A concentration inequality for the maximum vertex degree in random dissections

Autor:	Rivera-Lopez, Kelvin, Rizzolo, Douglas
Rok vydání:	2022
Předmět:	Mathematics - Probability 60C05
Druh dokumentu:	Working Paper
Popis:	We obtain a concentration inequality for the maximum degree of a vertex in a uniformly random dissection of a polygon. This resolves a conjecture posed by Curien and Kortchemski in 2012. Our approach is based on a bijection with dual trees and the tools of analytic combinatorics.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2204.01687 Zobrazit plný text záznamu View this record from Arxiv