IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v22y2011i3d10.1007_s10878-010-9323-9.html
   My bibliography  Save this article

On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries

Author

Listed:
  • Ivona Bezáková

    (Rochester Institute of Technology)

  • Nayantara Bhatnagar

    (University of California)

  • Dana Randall

    (Georgia Institute of Technology)

Abstract

The problems of uniformly sampling and approximately counting contingency tables have been widely studied, but efficient solutions are only known in special cases. One appealing approach is the Diaconis and Gangolli Markov chain which updates the entries of a random 2×2 submatrix. This chain is known to be rapidly mixing for cell-bounded tables only when the cell bounds are all 1 and the row and column sums are regular. We demonstrate that the chain can require exponential time to mix in the cell-bounded case, even if we restrict to instances for which the state space is connected. Moreover, we show the chain can be slowly mixing even if we restrict to natural classes of problem instances, including regular instances with cell bounds of either 0 or 1 everywhere, and dense instances where at least a linear number of cells in each row or column have non-zero cell-bounds.

Suggested Citation

  • Ivona Bezáková & Nayantara Bhatnagar & Dana Randall, 2011. "On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries," Journal of Combinatorial Optimization, Springer, vol. 22(3), pages 457-468, October.
    • Handle: RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-010-9323-9
    DOI: 10.1007/s10878-010-9323-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-010-9323-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-010-9323-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:22:y:2011:i:3:d:10.1007_s10878-010-9323-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.