Sampling Edge Covers in 3-Regular Graphs
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009（2009）
摘要
An edge cover C of an undirected graph is a set of edges such that every vertex has an adjacent edge in C. We show that a Glauber dynamics Markov chain for edge covers mixes rapidly for graphs with degrees at most three. Glauber dynamics have been studied extensively in the statistical physics community, with special emphasis on lattice graphs. Our results apply, for example, to the hexagonal lattice. Our proof of rapid mixing introduces a new cycle/path decomposition for the canonical flow argument.
更多查看译文
关键词
special emphasis,new cycle,path decomposition,adjacent edge,glauber dynamic,3-regular graphs,canonical flow argument,lattice graph,sampling edge covers,markov chain,statistical physics community,hexagonal lattice,regular graph,statistical physics
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要