The scaling limit of the root component in the Wired Minimal Spanning Forest of the Poisson Weighted Infinite Tree

• 成果类型: Article
• 署名作者: Angel, Omer; Senizergues, Delphin
• 署名单位: University of British Columbia; Centre National de la Recherche Scientifique (CNRS)
• 刊物名称: PROBABILITY THEORY AND RELATED FIELDS
• ISSN/ISSBN: 0178-8051; 1432-2064
• DOI: 10.1007/s00440-025-01444-y
• 发表日期: 2026-06
• 页码: 133-209
• 关键词: invasion percolation

摘要

In this paper we prove a scaling limit result for the component of the root in the Wired Minimal Spanning Forest (WMSF) of the Poisson-Weighted Infinite Tree (PWIT), where the latter tree arises as the local weak limit of the Minimal Spanning Tree (MST) on the complete graph endowed with i.i.d. weights on its edges. The limiting object M infinity\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {M}<^>\infty $$\end{document} can be obtained by aggregating independent Brownian trees using two types of gluing procedures: one that we call the Brownian tree aggregation process and resembles the so-called stick-breaking construction of the Brownian tree; and another one that we call the chain construction, which simply corresponds to gluing a sequence of metric spaces along a line.