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 条
  • [21] On the queue-number of graphs with bounded tree-width
    Wiechert, Veit
    ELECTRONIC JOURNAL OF COMBINATORICS, 2017, 24 (01):
  • [22] Optimal parametric search on graphs of bounded tree-width
    FernandezBaca, D
    Slutzki, G
    JOURNAL OF ALGORITHMS, 1997, 22 (02) : 212 - 240
  • [23] Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
    Calinescu, G
    Fernandes, CG
    Reed, B
    JOURNAL OF ALGORITHMS, 2003, 48 (02) : 333 - 359
  • [24] Homomorphism-Distinguishing Closedness for Graphs of Bounded Tree-Width
    Neuen, Daniel
    41ST INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, STACS 2024, 2024, 289
  • [25] BOUNDED TREE-WIDTH AND LOGCFL
    WANKE, E
    JOURNAL OF ALGORITHMS, 1994, 16 (03) : 470 - 491
  • [26] On the complexity of the multicut problem in bounded tree-width graphs and digraphs
    Bentz, Cedric
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (10) : 1908 - 1917
  • [27] On the k-rainbow domination in graphs with bounded tree-width
    Meybodi, M. Alambardar
    Hooshmandasl, M. R.
    Sharifani, P.
    Shakiba, Ali
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2021, 9 (02) : 277 - 300
  • [28] Learning Markov networks: Maximum bounded tree-width graphs
    Karger, D
    Srebro, N
    PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 392 - 401
  • [29] H-Free Coloring on Graphs with Bounded Tree-Width
    Aravind, N. R.
    Kalyanasundaram, Subrahmanyam
    Kare, Anjeneya Swami
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2019, 2019, 11394 : 231 - 244
  • [30] Evaluating a Weighted Graph Polynomial for Graphs of Bounded Tree-Width
    Noble, S. D.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
12345