Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

DOI10.1137/060650544zbMath1217.68245OpenAlexW2013303543WikidataQ56323829 ScholiaQ56323829MaRDI QIDQ5390574

Martin Dyer, Dana Randall, Mary Cryan

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/060650544

zbMATH Keywords

samplinglattice pointspolytopeapproximate countingcell-bounded contingency tables

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Contingency tables (62H17) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (5)

Rapid calculation of exact cell bounds for contingency tables from conditional frequencies ⋮ On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) ⋮ Lower bounds for contingency tables via Lorentzian polynomials ⋮ New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling ⋮ A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix

This page was built for publication: Approximately Counting Integral Flows and Cell-Bounded Contingency Tables