Markov Bases: A 25 Year Update
From MaRDI portal
Publication:6567960
DOI10.1080/01621459.2024.2310181MaRDI QIDQ6567960FDOQ6567960
Authors: Félix Almendra-Hernández, Jesús A. De Loera, Sonja Petrović 
Publication date: 5 July 2024
Published in: Journal of the American Statistical Association (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A survey of statistical network models
- Ideals, Varieties, and Algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the toric algebra of graphical models
- Sampling from a Manifold
- Title not available (Why is that?)
- Maximum likelihood estimation in the \(\beta\)-model
- Title not available (Why is that?)
- The Graver complexity of integer programming
- A finiteness theorem for Markov bases of hierarchical models
- \(N\)-fold integer programming
- Algebraic algorithms for sampling from conditional distributions
- All Linear and Integer Programs Are Slim 3‐Way Transportation Programs
- Markov bases for decomposable graphical models
- Graver basis for an undirected graph and its application to testing the beta model of random graphs
- Connecting tables with zero-one entries by a subset of a Markov basis
- Algebraic statistics for a directed random graph model with reciprocation
- Markov bases and subbases for bounded contingency tables
- Markov bases of binary graph models of \(K_{4}\)-minor free graphs
- Markov bases of three-way tables are arbitrarily complicated
- Markov bases for noncommutative Fourier analysis of ranked data
- Minimal Basis for a Connected Markov Chain over 3 x 3 x K Contingency Tables with Fixed Two-Dimensional Marginals
- Multigraded commutative algebra of graph decompositions
- Positive margins and primary decomposition
- De Finetti priors using Markov chain Monte Carlo computations
- Hit and run as a unifying device
- A divide-and-conquer algorithm for generating Markov bases of multi-way tables
- Algebraic statistics and contingency table problems: log-linear models, likelihood estimatio, and disclosure limitation
- Generalized Monte Carlo significance tests
- Unimodular binary hierarchical models
- Lifting Markov bases and higher codimension toric fiber products
- Indispensable monomials of toric ideals and Markov bases
- Betti numbers of Stanley-Reisner rings determine hierarchical Markov degrees
- Sampling for conditional inference on network data
- Tight complexity lower bounds for integer linear programming with few constraints
- Discussion of ``Coauthorship and citation networks for statisticians
- Hybrid schemes for exact conditional inference in discrete exponential families
- Exact goodness-of-fit tests for Markov chains
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Rapid mixing and Markov bases
- Goodness of fit for log-linear network models: dynamic Markov bases using hypergraphs
- Exact Goodness‐of‐Fit Testing for the Ising Model
- Heat-bath random walks with Markov bases
- Markov bases of toric ideals: connecting commutative algebra and statistics
- Open problems on connectivity of fibers with positive margins in multi-dimensional contingency tables
- Unimodular hierarchical models and their Graver bases
- Geometrically aware dynamic Markov bases for statistical linear inverse problems
- On the relative size of toric bases
- Approximate exchangeability and de Finetti priors in 2022
- Title not available (Why is that?)
- Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
Cited In (1)
This page was built for publication: Markov Bases: A 25 Year Update
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567960)
