Abstract
AbstractA binary contingency table is an m × n array of binary entries with row sums r = (r1, …, rm) and column sums c = (c1, …, cn). The configuration model generates a contingency table by considering ri tokens of type 1 for each row i and cj tokens of type 2 for each column j, and then taking a uniformly random pairing between type‐1 and type‐2 tokens. We give a necessary and sufficient condition so that the probability that the configuration model outputs a binary contingency table remains bounded away from 0 as \documentclass{article} \usepackage{mathrsfs} \usepackage{amsmath} \pagestyle{empty} \begin{document} \begin{align*}N=\sum_{i=1}^m r_i=\sum_{j=1}^n c_j\end{align*} \end{document} goes to ∞. Our finding shows surprising differences from recent results for binary symmetric contingency tables. © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 2012
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
