Sampling Edge Covers in 3-Regular Graphs
نویسندگان
چکیده
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.
منابع مشابه
CERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملArc-transitive regular cyclic covers of the complete bipartite graph
Characterizing regular covers of edge-transitive or arc-transitive graphs is currently a hot topic in algebraic graph theory. In this paper, we will classify arctransitive regular cyclic covers of the complete bipartite graph Kp,p for each odd prime p. The classification consists of four infinite families of graphs. In particular, such covers exist for each odd prime p. The regular elementary a...
متن کاملOn Approximating Restricted Cycle Covers
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set L. A special case of L-cycle covers are k-cycle covers for k ∈ N, where the length of each cycle must be at least k. The weight of a cycle cover of an edge-weighted graph is the sum of the weights of its edges. We com...
متن کاملA Simple FPTAS for Counting Edge Covers
An edge cover of a graph is a set of edges such that every vertex has at least an adjacent edge in it. We design a very simple deterministic fully polynomial-time approximation scheme (FPTAS) for counting the number of edge covers for any graph. Previously, approximation algorithm is only known for 3 regular graphs and it is randomized. Our main technique is correlation decay, which is a powerf...
متن کاملThe vertex-transitive and edge-transitive tetravalent graphs of square-free order
In this paper, a classification is given for tetravalent graphs of square-free order which are vertex-transitive and edge-transitive. It is shown that such graphs are Cayley graphs, edge-regular metacirculants and covers of some graphs arisen from simple groups A7, J1 and PSL(2, p).
متن کامل