Floodings of metric graphs

• 成果类型: Article
• 署名作者: Burdzy, Krzysztof; Pal, Soumik
• 署名单位: University of Washington; University of Washington Seattle
• 刊物名称: PROBABILITY THEORY AND RELATED FIELDS
• ISSN/ISSBN: 0178-8051
• DOI: 10.1007/s00440-020-00974-x
• 发表日期: 2020
• 页码: 577-620
• 关键词: peak algebra; permutations; enumeration

摘要

We consider random labelings of finite graphs conditioned on a small fixed number of peaks. We introduce a continuum framework where a combinatorial graph is associated with a metric graph and edges are identified with intervals. Next we consider a sequence of partitions of the edges of the metric graph with the partition size going to zero. As the mesh of the subdivision goes to zero, the conditioned random labelings converge, in a suitable sense, to a deterministic function which evolves as an increasing process of subsets of the metric graph that grows at rate one while maximizing an appropriate notion of entropy. We call such functions floodings. We present a number of qualitative and quantitative properties of floodings and some explicit examples.