Sampling Edge Covers in 3-Regular Graphs

被引：0
|
作者：
Bezakova, Ivona [1 ]
Rummler, William A. [1 ]
机构：
[1] Rochester Inst Technol, Rochester, NY 14623 USA
来源：
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2009 | 2009年 / 5734卷
关键词：
MARKOV-CHAIN ALGORITHMS; PERMANENT;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
An edge cover 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 oil 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.
引用
收藏
页码：137 / 148
页数：12
相关论文
共 50 条
  • [21] Largest 2-Regular Subgraphs in 3-Regular Graphs
    Ilkyoo Choi
    Ringi Kim
    Alexandr V. Kostochka
    Boram Park
    Douglas B. West
    Graphs and Combinatorics, 2019, 35 : 805 - 813
  • [22] On a class of Hamiltonian laceable 3-regular graphs
    Alspach, B
    Chen, CC
    McAvaney, K
    DISCRETE MATHEMATICS, 1996, 151 (1-3) : 19 - 38
  • [23] Extensions on 2-edge connected 3-regular up-embeddable graphs
    Huang Yuanqiu
    Liu Yanpei
    Acta Mathematicae Applicatae Sinica, 1998, 14 (4) : 337 - 346
  • [24] On a class of Hamiltonian laceable 3-regular graphs
    Alspach, Brian
    Chen, C.C.
    McAvaney, Kevin
    1996, Elsevier (151) : 1 - 3
  • [25] On 3-regular 4-ordered graphs
    Meszaros, Karola
    DISCRETE MATHEMATICS, 2008, 308 (11) : 2149 - 2155
  • [26] 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
    Kochol, Martin
    GRAPH DRAWING, 2009, 5417 : 319 - 323
  • [27] Random railways modeled as random 3-regular graphs
    Garmo, H
    RANDOM STRUCTURES & ALGORITHMS, 1996, 9 (1-2) : 113 - 136
  • [28] Codes for distributed storage from 3-regular graphs
    Gao, Shuhong
    Knoll, Fiona
    Manganiello, Felice
    Matthews, Gretchen
    DISCRETE APPLIED MATHEMATICS, 2017, 229 : 82 - 89
  • [29] The computational complexity of Holant problems on 3-regular graphs
    Yang, Peng
    Huang, Yuan
    Fu, Zhiguo
    THEORETICAL COMPUTER SCIENCE, 2024, 982
  • [30] SYMMETRIES OF 3-REGULAR 3-CONNECTED PLANAR GRAPHS
    MOORE, EF
    NOTICES OF THE AMERICAN MATHEMATICAL SOCIETY, 1973, 20 (03): : A400 - A400
12345