A concentration inequality for the maximum vertex degree in random dissections
Probability
2022-04-05 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2204.01687,
title = {A concentration inequality for the maximum vertex degree in random dissections},
author = {Kelvin Rivera-Lopez and Douglas Rizzolo},
journal= {arXiv preprint arXiv:2204.01687},
year = {2022}
}