Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
From MaRDI portal
Publication:6578650
Cites work
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 835749 (Why is no real title available?)
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Algebraic algorithms for sampling from conditional distributions
- Algebraic and geometric ideas in the theory of discrete optimization
- Algebraic statistics
- Algebraic statistics and contingency table problems: log-linear models, likelihood estimatio, and disclosure limitation
- Approximate exchangeability and de Finetti priors in 2022
- Binomial fibers and indispensable binomials
- Effective lattice point counting in rational convex polytopes
- Generalized Monte Carlo significance tests
- Hybrid schemes for exact conditional inference in discrete exponential families
- Ideals, Varieties, and Algorithms
- Indispensable monomials of toric ideals and Markov bases
- Lectures on algebraic statistics
- Markov Bases: A 25 Year Update
- Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels
- New algorithms for generating Poisson variates
- On the toric algebra of graphical models
- Poisson Random Variate Generation
- Rapid mixing and Markov bases
- The mixing time of switch Markov chains: a unified approach
- What is... a Markov Basis?
This page was built for publication: Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6578650)
