## New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling

- PÃ©ter L. ErdÃ¶s, IstvÃ¡n MiklÃ³s, ZoltÃ¡n Toroczkai
- Combinatorics, Probability & Computing
- 2018

@article{Cryan2005ApproximatelyCI, title={Approximately counting integral flows and cell-bounded contingency tables}, author={Mary Cryan and Martin E. Dyer and Dana Randall}, journal={SIAM J. Comput.}, year={2005}, volume={39}, pages={2683-2703} }

- Published 2005 in STOC
DOI:10.1145/1060590.1060652

We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, generalising a result of Dyer, Kannan and Mount (1997). We apply this to approximating the number of contingency tables with prescribed cell bounds when the number of rows isâ€¦Â CONTINUE READING

### Presentations referencing similar topics