The uncover process for random labeled trees

DOI10.1007/s44007-023-00060-3zbMath1529.05140arXiv2301.00664MaRDI QIDQ6140883

No author found.

Publication date: 2 January 2024

Published in: La Matematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.00664

zbMATH Keywords

functional central limit theorem; phase transition; limiting distribution; labeled tree; uncover process

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

05C05: Trees

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

60F17: Functional limit theorems; invariance principles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cutting down trees with a Markov chainsaw
• Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence
• Higher dimensional quasi-power theorem and Berry-Esseen inequality
• Spanning trees and function classes
• Destruction of very simple trees
• Isolating a leaf in rooted trees via random cuttings
• The coalescent
• The standard additive coalescent
• Factorizations of some weighted spanning tree enumerators
• Coalescents with multiple collisions
• Self-similar fragmentations derived from the stable tree. II: Splitting at nodes
• On Ramanujan's \(Q\)-function
• A geometric representation of fragmentation processes on stable trees
• Phase transition for Parking blocks, Brownian excursion and coalescence
• Random cutting and records in deterministic and random trees
• Random Fragmentation and Coagulation Processes
• Cutting down random trees
• Probability theory. A comprehensive course