When lattice bases are Markov bases
From MaRDI portal
Publication:6569438
DOI10.1016/J.SPL.2024.110106MaRDI QIDQ6569438FDOQ6569438
Authors: Martin L. Hazelton, Masoud Karimi 
Publication date: 9 July 2024
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Bayesian inference (62F15) Inference from stochastic processes (62M99) Applications of statistics to biology and medical sciences; meta analysis (62P10)
Cites Work
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Bayesian Inference on Network Traffic Using Link Count Data
- Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
- Algebraic algorithms for sampling from conditional distributions
- Connecting the latent multinomial
- Mixed matrices and binomial ideals
- Running Markov chain without Markov basis
- Mixed dominating matrices
- Estimation of Origin–Destination Trip Rates in Leicester
- Network tomography for integer-valued traffic
- Heat-bath random walks with Markov bases
- Multi‐List Methods Using Incomplete Lists in Closed Populations
- Geometrically aware dynamic Markov bases for statistical linear inverse problems
- Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems
This page was built for publication: When lattice bases are Markov bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6569438)
