Some rapidly mixing hit-and-run samplers for latent counts in linear inverse problems

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Running Markov chain without Markov basis
Computing generating sets of lattice ideals and Markov bases of lattices
Markov bases for decomposable graphical models
Statistical and computational inverse problems.
Algebraic algorithms for sampling from conditional distributions
Some characterizations of minimal Markov basis for sampling from discrete conditional distribu\-tions
Network tomography for integer-valued traffic
Heat-bath random walks with Markov bases
Sequential importance sampling for multiway tables
Network tomography: recent developments
Connecting the latent multinomial
Rapid mixing and Markov bases
Discrete Hit-and-Run for Sampling Points from Arbitrary Distributions Over Subsets of Integer Hyperrectangles
Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions
On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
Uncovering a Latent Multinomial: Analysis of Mark-Recapture Data with Misidentification
Bayesian Inference on Network Traffic Using Link Count Data
Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
Polytope samplers for network tomography
Algebraic Markov Bases and MCMC for Two‐Way Contingency Tables
Estimating Latent Processes on a Network From Indirect Measurements
Geometrically aware dynamic Markov bases for statistical linear inverse problems