Algebraic algorithms for sampling from conditional distributions

DOI10.1214/AOS/1030563990zbMath0952.62088OpenAlexW1973128036WikidataQ94168329 ScholiaQ94168329MaRDI QIDQ1807063

Publication date: 9 November 1999

Published in: The Annals of Statistics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/62cb3c9ef826c66e1a2ae5b362a45b1c18cb1fd5

zbMATH Keywords

logistic regression conditional distribution contingency tables Markov basis computational algebra methods Markov chain algorithms for sampling spectral analysis of permutation data

Mathematics Subject Classification ID

Parametric tolerance and confidence regions (62F25) Inference from stochastic processes (62M99) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Contingency tables (62H17)

Related Items (only showing first 100 items - show all)

Analysis of a nonreversible Markov chain sampler. ⋮ Bayesian networks for discrete multivariate data: An algebraic approach to inference ⋮ Analysis of population change and movement using robust design removal data ⋮ The fiber dimension of a graph ⋮ Monomial ideals and the Scarf complex for coherent systems in reliability theory. ⋮ Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions ⋮ Extending the latent multinomial model with complex error processes and dynamic Markov bases ⋮ Staged tree models with toric structure ⋮ Natural gradient flow in the mixture geometry of a discrete exponential family ⋮ Computing generating sets of lattice ideals and Markov bases of lattices ⋮ Toric geometry of cuts and splits ⋮ Gröbner bases and triangulations of the second hypersimplex ⋮ Statistical enumeration of groups by double cosets ⋮ On vector partition functions ⋮ Well-calibrated predictions from on-line compression models ⋮ Bouquet algebra of toric ideals ⋮ A finiteness theorem for Markov bases of hierarchical models ⋮ The circuit ideal of a vector configuration ⋮ Compressed polytopes and statistical disclosure limitation ⋮ Some things we've learned (about Markov chain Monte Carlo) ⋮ Minimal and minimal invariant Markov bases of decomposable models for contingency tables ⋮ Binomial ideals ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Exact sampling algorithms for Latin squares and Sudoku matrices via probabilistic divide-and-conquer ⋮ On maximum entropy and minimum KL-divergence optimization by Gröbner basis methods ⋮ Generalized robust toric ideals ⋮ Markov chain Monte Carlo methods for the regular two-level fractional factorial designs and cut ideals ⋮ Exact inference in contingency tables via stochastic approximation Monte Carlo ⋮ Nearly exact tests of conditional independence and marginal homogeneity for sparse contingency tables ⋮ Commutative algebra of statistical ranking ⋮ Markov bases and generalized Lawrence liftings ⋮ Graver basis for an undirected graph and its application to testing the beta model of random graphs ⋮ The algebra of reversible Markov chains ⋮ Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities ⋮ Markov complexity of monomial curves ⋮ Positive margins and primary decomposition ⋮ A class of statistical models to weaken independence in two-way contingency tables ⋮ Higher Lawrence configurations. ⋮ Neural ideals and stimulus space visualization ⋮ Lifting Markov bases and higher codimension toric fiber products ⋮ Binomial fibers and indispensable binomials ⋮ Computing p-values in conditional independence models for a contingency table ⋮ Conditional exact tests for Markovianity and reversibility in multiple categorical sequences ⋮ Markov basis and Gröbner basis of Segre-Veronese configuration for testing independence in group-wise selections ⋮ Syzygies for Metropolis base chains ⋮ On properties of multi-dimensional statistical tables ⋮ Accurate parametric inference for small samples ⋮ The switch Markov chain for sampling irregular graphs and digraphs ⋮ Ideals of graph homomorphisms ⋮ Gröbner bases of contraction ideals ⋮ Hierarchical subspace models for contingency tables ⋮ Interpreting the phase spectrum in Fourier analysis of partial ranking data ⋮ Markov bases for typical block effect models of two-way contingency tables ⋮ Multicanonical MCMC for sampling rare events: an illustrative review ⋮ Minimal generators of toric ideals of graphs ⋮ A generalization of the integer linear infeasibility problem ⋮ Cut ideals of \(K_{4}\)-minor free graphs are generated by quadrics ⋮ Finite Gröbner bases in infinite dimensional polynomial rings and applications ⋮ Honest exploration of intractable probability distributions via Markov chain Monte Carlo. ⋮ Indispensable monomials of toric ideals and Markov bases ⋮ The three-state toric homogeneous Markov chain model has Markov degree two ⋮ Conditional expectations in network traffic estimation ⋮ Rejection sampling of bipartite graphs with given degree sequence ⋮ Binomial ideals of domino tilings ⋮ Unimodular binary hierarchical models ⋮ Nash inequalities for finite Markov chains ⋮ Markov random fields and iterated toric fibre products ⋮ Testing for positive association in contingency tables with fixed margins ⋮ Splittings of toric ideals ⋮ A Markov basis for conditional test of common diagonal effect in quasi-independence model for square contingency tables ⋮ Estimate-based goodness-of-fit test for large sparse multinomial distributions ⋮ Asymmetry models for square contingency tables: exact tests via algebraic statistics ⋮ On the generalized Scarf complex of lattice ideals ⋮ Synthetic two-way contingency tables that preserve conditional frequencies ⋮ Support sets in exponential families and oriented matroid theory ⋮ Experiments with the site frequency spectrum ⋮ Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables ⋮ A divide-and-conquer algorithm for generating Markov bases of multi-way tables ⋮ Markov bases of binary graph models of \(K_{4}\)-minor free graphs ⋮ Exact test of goodness of fit for binomial distribution ⋮ Hybrid schemes for exact conditional inference in discrete exponential families ⋮ Perturbation method for determining the group of invariance of hierarchical models ⋮ Size estimation of key populations in the HIV epidemic in eSwatini using incomplete and misaligned capture-recapture data ⋮ Finite space Kantorovich problem with an MCMC of table moves ⋮ MCMC methods to approximate conditional predictive distributions ⋮ Convergence and accuracy of Gibbs sampling for conditional distributions in generalized linear models ⋮ A short history of algebraic statistics ⋮ Correction to: ``Speeding up Markov chains with deterministic jumps ⋮ Markov bases for two-way subtable sum problems ⋮ Minimal invariant Markov basis for sampling contingency tables with fixed marginals ⋮ Bowker's test for symmetry and modifications within the algebraic framework ⋮ On the ideals of equivariant tree models ⋮ Low dimensional flow polytopes and their toric ideals ⋮ Markov chain Monte Carlo tests for designed experiments ⋮ Random sampling of contingency tables via probabilistic divide-and-conquer ⋮ On the strongly robust property of toric ideals ⋮ Analysis of the weighted kappa and its maximum with Markov moves ⋮ On atomic density of numerical semigroup algebras ⋮ Gröbner bases and polyhedral geometry of reducible and cyclic models. ⋮ Distance-reducing Markov bases for sampling from a discrete sample space

Uses Software

Cites Work

This page was built for publication: Algebraic algorithms for sampling from conditional distributions