跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.21540 · v1

The Sum of Leaf Weights in the Minimum Spanning Tree of the Complete Graph

完全图最小生成树中叶子权重之和

首次提交 2026-11-17 02:26
版本更新 2026-11-17 02:26
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

Let GnG_n be a random weighted complete graph on nn vertices, where edges have i.i.d. Unif(0,1)\text{Unif}(0,1) weights. Let TnT_n be the Minimum Spanning Tree (MST) of GnG_n. The expected weight of TnT_n is known to converge to ζ(3)=∑k=1∞1k3ζ(3) = \sum_{k=1}^{\infty} \frac{1}{k^3} (Frieze 1985). We investigate the sum of weights of edges incident to the leaves of TnT_n, denoting this quantity by LnL_n. We give tight upper and lower bounds on E[Ln]\mathbb{E}[L_n] and determine its limit as nn diverges, leveraging typical behavior of sparse Erdős--Rényi random graphs. We also establish concentration of LnL_n around E[Ln]\mathbb{E}[L_n] and almost sure convergence to this value. These results directly yield substantial improvements to state-of-the-art bounds for two important variants of the MST problem: (1) an improved upper bound on the weight of the optimal random instance Steiner tree, as studied by Bollobás, Gamarnik, Riordan, and Sudakov (2004); and (2) an improvement over the upper bound for the Probabilistic Minimum Spanning Tree, introduced by Bertsimas (1988).

AI 论文解读

基于摘要 · 非全文审阅

研究随机加权完全图的最小生成树中与叶子关联的边权重之和,确定其期望极限并证明集中性,进而改进Steiner树和概率最小生成树问题的上界。

正在读取账号与研究记录…

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 02:26 · 最新观测版本

The Sum of Leaf Weights in the Minimum Spanning Tree of the Complete Graph

Let GnG_n be a random weighted complete graph on nn vertices, where edges have i.i.d. Unif(0,1)\text{Unif}(0,1) weights. Let TnT_n be the Minimum Spanning Tree (MST) of GnG_n. The expected weight of TnT_n is known to converge to ζ(3)=∑k=1∞1k3ζ(3) = \sum_{k=1}^{\infty} \frac{1}{k^3} (Frieze 1985). We investigate the sum of weights of edges incident to the leaves of TnT_n, denoting this quantity by LnL_n. We give tight upper and lower bounds on E[Ln]\mathbb{E}[L_n] and determine its limit as nn diverges, leveraging typical behavior of sparse Erdős--Rényi random graphs. We also establish concentration of LnL_n around E[Ln]\mathbb{E}[L_n] and almost sure convergence to this value. These results directly yield substantial improvements to state-of-the-art bounds for two important variants of the MST problem: (1) an improved upper bound on the weight of the optimal random instance Steiner tree, as studied by Bollobás, Gamarnik, Riordan, and Sudakov (2004); and (2) an improvement over the upper bound for the Probabilistic Minimum Spanning Tree, introduced by Bertsimas (1988).

查看此版本解读 →查看此版本原文 ↗