When lattice bases are Markov bases

DOI10.1016/J.SPL.2024.110106MaRDI QIDQ6569438zbMATH OpenFDO

Authors Martin L. Hazelton, Masoud Karimi

Publication date 9 July 2024

Published in Statistics \& Probability Letters (Search for Journal in Brave)

zbMATH Keywords

MCMClinear inverse problemmixed matrixhit-and-run algorithmMarkov chain mixing

Mathematics Subject Classification ID

Bayesian inference (62F15) Inference from stochastic processes (62M99) Applications of statistics to biology and medical sciences; meta analysis (62P10)

Cites work

• Algebraic algorithms for sampling from conditional distributions
• Bayesian Inference on Network Traffic Using Link Count Data
• Connecting the latent multinomial
• Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
• Estimation of Origin–Destination Trip Rates in Leicester
• Geometrically aware dynamic Markov bases for statistical linear inverse problems
• Heat-bath random walks with Markov bases
• Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
• Mixed dominating matrices
• Mixed matrices and binomial ideals
• Multi‐List Methods Using Incomplete Lists in Closed Populations
• Network tomography for integer-valued traffic
• 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)