PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
September 19, 20240 citationsOpen Access

Scaling limit of trees with vertices of fixed degrees and heights

View Full Paper
ABArthur Blanc-RenaudieEKEmmanuel Kammerer

Key Points

Key points are not available for this paper at this time.

Abstract

We consider large uniform random trees where we fix for each vertex its degree and height. We prove, under natural conditions of convergence for the profile, that those trees properly renormalized converge. To this end, we study the paths from random vertices to the root using coalescent processes. As an application, we obtain scaling limits of Bienaym\'e-Galton-Watson trees in varying environment.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Blanc-Renaudie et al. (2024) studied this question.

synapsesocial.com/papers/68e580d4b6db64358751e820https://doi.org/10.48550/arxiv.2409.12897
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Scaling Limits of Multitype Bienaymé Trees2025
  2. 2On the scaling of random Tamari intervals and Schnyder woods of random triangulations (with an asymptotic D-finite trick)2024
  3. 3On the maximal size of tree in a random forest2024 · 1 citations
  4. 4The GHP scaling limit of uniform spanning trees of dense graphs2024 · 2 citations
  5. 5Fringe Trees for Random Trees with Given Vertex Degrees2024