Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width

被引：0
|
作者：
Bordewich, Magnus [1 ]
Kang, Ross J. [1 ]
机构：
[1] Univ Durham, Durham, England
来源：
AUTOMATA, LANGUAGES AND PROGRAMMING, ICALP, PT I | 2011年 / 6755卷
基金：
英国工程与自然科学研究理事会;
关键词：
Markov chain Monte Carlo; graph polynomials; subset expansion; tree-width; canonical paths; randomised approximation schemes; rapid mixing; MARKOV-CHAINS; TIME; POLYNOMIALS; INVARIANTS; MODELS; NUMBER;
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
Motivated by the 'subgraphs world' view of the ferromagnetic Ising model, we develop a general approach to studying mixing times of Glauber dynamics based on subset expansion expressions for a class of graph polynomials. With a canonical paths argument, we demonstrate that the chains defined within this framework mix rapidly upon graphs of bounded tree-width. This extends known results on rapid mixing for the Tutte polynomial, the adjacency-rank (R-2-)polynomial and the interlace polynomial.
引用
收藏
页码：533 / 544
页数：12
相关论文
共 50 条
  • [41] K6 minors in 6-connected graphs of bounded tree-width
    Kawarabayashi, Ken-ichi
    Norine, Serguei
    Thomas, Robin
    Wollan, Paul
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2019, 136 : 1 - 32
  • [42] kappa-channel connectivity in cognitive radio networks for bounded tree-width graphs
    Yadav, Ram Narayan
    Misra, Rajiv
    INTERNATIONAL JOURNAL OF COMMUNICATION SYSTEMS, 2017, 30 (16)
  • [43] On fixed-parameter tractability of the mixed domination problem for graphs with bounded tree-width
    Olyaei, Meysam Rajaati Bavil
    Hooshmandasl, Mohammad Reza
    Dinneen, Michael J.
    Shakiba, Ali
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2018, 20 (02):
  • [44] A simpler linear time algorithm for embedding graphs into an arbitrary surface and the genus of graphs of bounded tree-width
    Kawarabayashi, Ken-ichi
    Mohar, Bojan
    Reed, Bruce
    PROCEEDINGS OF THE 49TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2008, : 771 - +
  • [45] Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
    Fernandes, Cristina G.
    Lee, Orlando
    Wakabayashi, Yoshiko
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (02) : 272 - 279
  • [46] Parity Games on Graphs with Medium Tree-Width
    Fearnley, John
    Lachish, Oded
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2011, 2011, 6907 : 303 - 314
  • [47] A Bi-Criteria FPTAS for Scheduling with Memory Constraints on Graphs with Bounded Tree-Width
    Angel, Eric
    Morais, Sebastien
    Regnault, Damien
    EURO-PAR 2022: PARALLEL PROCESSING, 2022, 13440 : 136 - 151
  • [48] On zeros of the characteristic polynomial of matroids of bounded tree-width
    Chun, Carolyn
    Hall, Rhiannon
    Merino, Criel
    Noble, Steven
    EUROPEAN JOURNAL OF COMBINATORICS, 2017, 60 : 10 - 20
  • [49] On the tree-depth and tree-width in heterogeneous random graphs
    Shang, Yilun
    PROCEEDINGS OF THE JAPAN ACADEMY SERIES A-MATHEMATICAL SCIENCES, 2022, 98 (09) : 78 - 83
  • [50] Bounded tree-width and CSP-related problems
    Faernqvist, Tommy
    Jonsson, Peter
    ALGORITHMS AND COMPUTATION, 2007, 4835 : 632 - 643
12345