Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
zbMath1298.05284MaRDI QIDQ463068
Magnus Bordewich, Ross J. Kang
Publication date: 23 October 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p19
Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Enumeration in graph theory (05C30) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A counterexample to rapid mixing of the Ge-Stefankovic process
- A two-variable interlace polynomial
- Fast evaluation of interlace polynomials on graphs of bounded treewidth
- On multivariate chromatic polynomials of hypergraphs and hyperedge elimination
- Geometric bounds for eigenvalues of Markov chains
- Matroid tree-width
- Ising models on locally tree-like graphs
- Mixing time of critical Ising model on trees is polynomial in the height
- A multivariate interlace polynomial and its computation for graphs of bounded clique-width
- From a zoo to a zoology: Towards a general theory of graph polynomials
- Evaluating a weighted graph polynomial for graphs of bounded tree-width
- Graphs with small bandwidth and cutwidth
- Generalized activities and the Tutte polynomial
- The vertex separation number of a graph equals its path-width
- A weighted graph polynomial from chromatic invariants of knots
- Farrell polynomials on graphs of bounded tree width
- Interlace polynomials
- An algorithm for the Tutte polynomials of graphs of bounded treewidth
- Glauber dynamics on trees and hyperbolic graphs
- Tree-width, path-width, and cutwidth
- Simulation reductions for the Ising model
- The Potts model and the Tutte polynomial
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- A Graph Polynomial for Independent Sets of Bipartite Graphs
- Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width
- The mixing time of Glauber dynamics for coloring regular trees
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Graph Polynomials and Their Applications II: Interrelations and Interpretations
- Polynomial-Time Approximation Algorithms for the Ising Model
- Path coupling using stopping times and counting independent sets and colorings in hypergraphs
- Treewidth: Characterizations, Applications, and Computations
- Approximating the Partition Function of the Ferromagnetic Potts Model
- Stopping Times, Metrics and Approximate Counting
- Matroid Pathwidth and Code Trellis Complexity
- A polynomial invariant for knots via von Neumann algebras
- Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- On the computational complexity of the Jones and Tutte polynomials
- Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
- Polynomial time randomized approximation schemes for Tutte–Gröthendieck invariants: The dense case
- On the Complexity of the Interlace Polynomial
- On Markov Chains for Independent Sets
- Beitrag zur Theorie des Ferromagnetismus
- Fast mixing for independent sets, colorings, and other models on trees
- The Tutte Polynomial for Matroids of Bounded Branch-Width
- The Random-Cluster Model
- Time-Dependent Statistics of the Ising Model
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A Contribution to the Theory of Chromatic Polynomials
- A 3-approximation for the pathwidth of Halin graphs
This page was built for publication: Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
