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 条
  • [1] Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
    Bordewich, Magnus
    Kang, Ross J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2014, 21 (04):
  • [2] Chordal graphs with bounded tree-width
    Castellvi, Jordi
    Drmota, Michael
    Noy, Marc
    Requile, Clement
    ADVANCES IN APPLIED MATHEMATICS, 2024, 157
  • [3] Partitioning graphs of bounded tree-width
    Ding, GL
    Oporowski, B
    Sanders, DP
    Vertigan, D
    COMBINATORICA, 1998, 18 (01) : 1 - 12
  • [4] Layout of graphs with bounded tree-width
    Dujmovic, V
    Morin, P
    Wood, DR
    SIAM JOURNAL ON COMPUTING, 2005, 34 (03) : 553 - 579
  • [5] Partitioning Graphs of Bounded Tree-Width
    Guoli Ding
    Bogdan Oporowski
    Daniel P. Sanders
    Dirk Vertigan
    Combinatorica, 1998, 18 : 1 - 12
  • [6] Nonrepetitive colorings of graphs of bounded tree-width
    Kuendgen, Andre
    Pelsmajer, Michael J.
    DISCRETE MATHEMATICS, 2008, 308 (19) : 4473 - 4478
  • [7] Limits of Chordal Graphs With Bounded Tree-Width
    Castellvi, Jordi
    Stufler, Benedikt
    RANDOM STRUCTURES & ALGORITHMS, 2025, 66 (01)
  • [8] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 304 - 316
  • [9] Tree-width and optimization in bounded degree graphs
    Lozin, Vadim
    Milanic, Martin
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 45 - +
  • [10] PARAMETRIC PROBLEMS ON GRAPHS OF BOUNDED TREE-WIDTH
    FERNANDEZBACA, D
    SLUTZKI, G
    JOURNAL OF ALGORITHMS, 1994, 16 (03) : 408 - 430
12345