非齐次随机图的强匹配与加权匹配
Strong and Weighted Matchings in Inhomogenous Random Graphs
摘要:
我们配备了独立的,但不一定相同分布的权重的确定性图$H$的边缘和研究的广义版本的匹配(即一组顶点不相交的边缘)在$H$满足的性质,任何两个不同的边缘的端顶点至少是一个最小的距离。我们称这种匹配为强匹配,并确定最大强匹配的最小权重的期望和方差的界限。接下来,我们考虑一个非齐次随机图的边缘概率不一定相同,并确定边界上的最大尺寸的强匹配的平均边缘概率。我们使用局部顶点邻域,鞅差方法和迭代探索技术,以获得我们想要的估计。
英文摘要:
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that end-vertices of any two distinct edges are at least a minimum distance apart. We call such matchings as strong matchings and determine bounds on the expectation and variance of the minimum weight of a maximum strong matching. Next, we consider an inhomogenous random graph whose edge probabilities are not necessarily the same and determine bounds on the maximum size of a strong matching in terms of the averaged edge probability. We use local vertex neighbourhoods, the martingale difference method and iterative exploration techniques to obtain our desired estimates.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。