Sampling lattice points in a polytope: a Bayesian biased algorithm with random updates
From MaRDI portal
Publication:6578650
DOI10.2140/astat.2024.15.61MaRDI QIDQ6578650
Sonja Petrović, Miles Bakenhus
Publication date: 25 July 2024
Published in: Algebraic Statistics (Search for Journal in Brave)
Computational methods for problems pertaining to statistics (62-08) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Algebraic statistics (62R01) Statistics on algebraic and topological structures (62Rxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Running Markov chain without Markov basis
- Binomial fibers and indispensable binomials
- New algorithms for generating Poisson variates
- Indispensable monomials of toric ideals and Markov bases
- Lectures on algebraic statistics
- Hybrid schemes for exact conditional inference in discrete exponential families
- Algebraic algorithms for sampling from conditional distributions
- The mixing time of switch Markov chains: a unified approach
- On the toric algebra of graphical models
- A computational study of integer programming algorithms based on Barvinok's rational functions
- Effective lattice point counting in rational convex polytopes
- Rapid mixing and Markov bases
- Algebraic Statistics
- Generalized Monte Carlo significance tests
- Poisson Random Variate Generation
- What is... a Markov Basis?
- Ideals, Varieties, and Algorithms
- Approximate exchangeability and de Finetti priors in 2022
- Markov Bases: A 25 Year Update
- Monte Carlo goodness-of-fit tests for degree corrected and related stochastic blockmodels
Related Items (1)
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)
