带边约束的最小权随机图
Minimum Weight Random Graphs with Edge Constraints
摘要:
本文研究了两个带边约束的最小权随机图的例子。首先考虑完全图上的${n}$顶点配备一致重的边权,并使用迭代法得到偏差估计的最小重量的子树与给定的边数。其次,我们分析了整数格${\mathbb{Z}^d}$中的边约束最小权路径,并采用鞅差技术来描述边约束下的缩放最小权的行为。
英文摘要:
In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation estimates for the minimum weight of subtrees with a given number of edges. Next we analyze edge constrained minimum weight paths in the integer lattice ${\mathbb{Z}^d}$ and employ martingale difference techniques to describe the behaviour of the scaled minimum weight in terms of the edge constraint.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。