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

三角格图的抽样欧拉方向

Sampling Eulerian orientations of triangular lattice graphs

Paidi Creed

摘要:

本文研究了三角格子图欧拉方向集上的均匀分布的抽样问题。虽然它是已知的,这可以实现在多项式时间的任何图形,这里研究的算法是更自然的上下文中的平面欧拉图。我们分析了一个平面图的欧拉方向上的马尔可夫链的混合时间,该平面图通过反转有向面的边在方向之间移动。利用路径耦合和比较方法,我们得到了一个多项式上界的混合时间的链的任何固体子图的三角格。通过考虑链的电导,我们表明,存在的子图与孔链将始终采取指数量的时间来收敛。最后,作为一个额外的理由研究马尔可夫链的欧拉方向的平面图的集合,我们发现,计数欧拉方向的问题仍然是P-完全时,限制到平面图。这项工作的初步版本作为扩展摘要出现在达勒姆研讨会的第二次算法和复杂性。

英文摘要:

We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm studied here is more natural in the context of planar Eulerian graphs. We analyse the mixing time of a Markov chain on the Eulerian orientations of a planar graph which moves between orientations by reversing the edges of directed faces. Using path coupling and the comparison method we obtain a polynomial upper bound on the mixing time of this chain for any solid subgraph of the triangular lattice. By considering the conductance of the chain we show that there exist subgraphs with holes for which the chain will always take an exponential amount of time to converge. Finally, as an additional justification for studying a Markov chain on the set of Eulerian orientations of planar graphs, we show that the problem of counting Eulerian orientations remains #P-complete when restricted to planar graphs. A preliminary version of this work appeared as an extended abstract in the 2nd Algorithms and Complexity in Durham workshop.

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

↑