Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width

Electronic Journal Of Combinatorics

Magnus Bordewich¹ 

关键词: Markov chain Monte Carlo;    graph polynomials;    tree-width;    canonical paths;    approximate counting;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Motivated by the 'subgraphs world' view of the ferromagnetic Ising model, we analyse the mixing times of Glauber dynamics based on subset expansion expressions for classes of graph, hypergraph and matroid polynomials. With a canonical paths argument, we d

【 授权许可】

Others