Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums

Electronic Journal of Combinatorics

Volumn 12, Issue 1 R, 2005, Pages

  Canfield, E Rodney ^a   McKay, Brendan D ^b  

^a University of Georgia ^*  (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344445019     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1926     Document Type: Article

References (20)

1. A. Békéssy, P. Békéssy and J. Komlós, Asymptotic enumeration of regular matrices, Studia Sci. Math. Hungar., 7 (1972) 343-353.
2. E. A. Bender, The asymptotic number of nonnegative integer matrices with given row and column sums, Discrete Math., 10 (1974) 345-353.
3. R. N. Bhattacharya and R. R. Rao, Normal Approximation and Asymptotic Expansions, John Wiley & Sons (NY, 1976).
4. B. Bollobás and B.D. McKay, The number of matchings in random regular graphs and bipartite graphs, J. Combinatorial Theory (Series B), 41 (1986) 80-91.
5. E. R. Canfield and B. D. McKay, Table of the numbers of semiregular 0-1 matrices of order m × n for m, n ≤ 30, and a related Maple program. Available at http://cs.anu.edu.au/~bdm/data/semiregular.html
6. Y. Chen, P. Diaconis, S.P. Holmes and J.S. Liu, Sequential Monte Carlo methods for statistical analysis of tables, J. Amer. Statist. Assoc., 100 (2005) 109-120.
7. S. X. Chen and J. S. Liu, Statistical Applications of the Poisson-Binomial and conditional Bernoulli distributions, Statistics Sinica, 7 (1997) 875-892.
8. C. J. Everett, Jr., and P. R. Stein, The asymptotic number of integer stochastic matrices, Discrete Math., 1 (1971) 33-72.
9. I. J. Good and J. F. Crook, The enumeration of arrays and a generalization related to contingency tables, Discrete Math., 19 (1977) 23-45.
10. C. S. Greenhill, B. D. McKay and X. Wang, Asymptotic enumeration of sparse irregular bipartite graphs, J. Combinatorial Theory, Ser. A, to appear.
11. S. Litsyn and A. Shpunt, On the capacity of two-dimensional weight-constrained memories, to appear in "Algebraic Coding Theory and Information Theory", DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Amer. Math. Soc., 2005.
12. B.D. McKay, Applications of a technique for labelled enumeration, Congressus Numerantium, 40 (1983) 207-221.
13. B.D. McKay, Asymptotics for 0-1 matrices with prescribed line sums, in Enumeration and Design, (Academic Press, 1984) 225-238.
14. B. D. McKay and X. Wang, Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums, Linear Alg. Appl., 373 (2003) 273-288.
15. B.D. McKay and N. C. Wormald, Asymptotic enumeration by degree sequence of graphs of high degree. European J. Combinatorics, 11 (1990) 565-580.
16. 1/2), Combinatorica, 11 (1991) 369-382.
17. M. P. Mineev and A. I. Pavlov, On the number of (0,1)-matrices with prescribed sums of rows and columns, Doc. Akad. Nauk SSSR 230, 2 (1976) 1276-1282.
18. P.E. O'Neil, Asymptotics and random matrices with row-sum and column-sum restrictions, Bull. Amer. Math. Soc., 75 (1969) 1276-1282.
19. E. Ordentlich and R. M. Roth, Two-dimensional weight-constrained codes through enumeration bounds, IEEE Trans. Inf. Theory, 46 (2000) 1292-1301.
20. R. C. Read, Some enumeration problems in graph theory, Doctoral Thesis, London University, (1958).