Rapid Mixing and Markov Bases
From MaRDI portal
Publication:2835838
DOI10.1137/15M1022045zbMath1351.05209arXiv1505.03018OpenAlexW2963739814MaRDI QIDQ2835838
Publication date: 30 November 2016
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1505.03018
Random walks on graphs (05C81) Applications of commutative algebra (e.g., to statistics, control theory, optimization, etc.) (13P25)
Related Items
The norm of the saturation of a binomial ideal, with applications to Markov bases ⋮ Heat-bath random walks with Markov bases ⋮ A survey of discrete methods in (algebraic) statistics for networks ⋮ Analysis of the weighted kappa and its maximum with Markov moves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Positive margins and primary decomposition
- Nash inequalities for finite Markov chains
- Generating a random linear extension of a partial order
- Lectures on algebraic statistics
- A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables
- Markov chain comparison
- Counting integer points in parametric polytopes using Barvinok's rational functions
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Trailing the dovetail shuffle to its lair
- Polynômes arithmétiques et méthode des polyedres en combinatoire
- Random walks on finite convex sets of lattice points
- Higher Lawrence configurations.
- Markov bases of binary graph models
- Algebraic algorithms for sampling from conditional distributions
- Heat-bath random walks with Markov bases
- Markov bases of three-way tables are arbitrarily complicated
- Symmetric groups and expander graphs.
- Toric fiber products
- Isoperimetric numbers of graphs
- Higher Connectivity of Fiber Graphs of Gröbner Bases
- On the Connectivity of Fiber Graphs
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Computing the Continuous Discretely
- Expander graphs and their applications
- Generating a random permutation with random transpositions
- Fastest Mixing Markov Chain on a Graph
- Small Contingency Tables with Large Gaps
- Rapid mixing of Swendsen–Wang dynamics in two dimensions
