随机图的加权控制与着色
Weighted Domination and Colouring in Random Graphs
摘要:
在本文的第一部分中,我们考虑了完全图在~ \(n\)顶点上的顶点具有独立同分布(i.i.d.)权重我们使用概率迭代来确定最大化加权控制概率的充分条件。在第二部分中,我们研究了色数的加权推广,并估计了当权本身是随机的时,满足约束所需的最小颜色数。我们表明,“额外的”成本加权着色是小的,如果权重有足够大的时刻。我们还考虑非齐次随机图的边缘概率不一定都是相同的,并获得其平均边缘概率的色数的界限。
英文摘要:
In the first part of this paper, we consider weighted domination in the case where the vertices of the complete graph on~\(n\) vertices are equipped with independent and identically distributed (i.i.d.) weights. We use the probabilistic iteration to determine sufficient conditions for maximizing the weighted domination probability. In the second part, we study a weighted generalization of the chromatic number and estimate the minimum number of colours needed to satisfy the constraints when the weights themselves are random. We show that the "extra" cost incurred for weighted colouring is small if the weights have sufficiently large moments. We also consider inhomogenous random graphs where the edge probabilities are not necessarily all same and obtain bounds for the chromatic number in terms of its averaged edge probabilities.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。