












Abstract:We study preferential attachment trees with general attachment rules. A natural intuition is that rewarding high-degree vertices more strongly should make the tree shallower. We test this intuition for the logarithmic growth constants of insertion depth and tree height. We show by an explicit counterexample that growth-ratio dominance alone does not guarantee either monotonicity. We identify additional tail-order conditions, arising from the branching-process representation of the tree, under which both expected comparisons hold.
From: Christian Mönch [view email]
[v1]
Mon, 16 Feb 2026 13:36:08 UTC (28 KB)
[v2]
Thu, 21 May 2026 11:42:11 UTC (35 KB)
[v3]
Mon, 24 Aug 2026 21:54:41 UTC (38 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。