arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.03351cs.DS
收藏

稀疏随机图的几乎一致采样着色

Sampling colorings almost uniformly in sparse random graphs

Yitong Yin, Chihao Zhang

摘要:

从均匀分布中抽取适当的$q$ -着色的问题已被广泛研究。现有的大多数采样器都要求对某些常数$α$和$β$使用$q\ge αΔ+β$,其中$Δ$是图的最大度。当底层图具有无界度时,问题变得更具挑战性,因为在这种情况下,甚至$q$ -可着色性的判定也变得非平凡。Erdens-Rényi随机图$\mathcal{G}(n,d/n)$是一类典型的随机图,近年来受到了广泛的关注.在这种情况下,采样器的性能通常通过$q$和平均度$d$之间的关系来测量。我们感兴趣的是完全多项式时间几乎均匀采样器(FPAUS)和国家的最先进的采样器,这样的适当的$q$着色$\mathcal{G}(n,d/n)$要求$q\ge 5.5d$。在本文中,我们设计了一个FPAUS适当的$q$ -着色$\mathcal{G}(n,d/n)$通过要求,$q\ge 3d+O(1)$,这提高了迄今为止的最佳界的问题。我们的采样器是基于随机图上的$q$ -着色的空间混合性质。采样器的核心是一个确定性算法来估计块上的边际概率,这是由一个新的块版本的递归$q$ -染色无界度图计算。

英文摘要:

The problem of sampling proper $q$-colorings from uniform distribution has been extensively studied. Most of existing samplers require $q\ge αΔ+β$ for some constants $α$ and $β$, where $Δ$ is the maximum degree of the graph. The problem becomes more challenging when the underlying graph has unbounded degree since even the decision of $q$-colorability becomes nontrivial in this situation. The Erdős-Rényi random graph $\mathcal{G}(n,d/n)$ is a typical class of such graphs and has received a lot of recent attention. In this case, the performance of a sampler is usually measured by the relation between $q$ and the average degree $d$. We are interested in the fully polynomial-time almost uniform sampler (FPAUS) and the state-of-the-art with such sampler for proper $q$-coloring on $\mathcal{G}(n,d/n)$ requires that $q\ge 5.5d$. In this paper, we design an FPAUS for proper $q$-colorings on $\mathcal{G}(n,d/n)$ by requiring that $q\ge 3d+O(1)$, which improves the best bound for the problem so far. Our sampler is based on the spatial mixing property of $q$-coloring on random graphs. The core of the sampler is a deterministic algorithm to estimate the marginal probability on blocks, which is computed by a novel block version of recursion for $q$-coloring on unbounded degree graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑