ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
From MaRDI portal
Publication:4918320
DOI10.1017/S1446788712000286zbMATH Open1262.05007arXiv1108.4496OpenAlexW2962925849MaRDI QIDQ4918320FDOQ4918320
Authors: Brendan D. McKay, Jeanette C. McLeod 
Publication date: 24 April 2013
Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)
Abstract: We investigate the number of symmetric matrices of non-negative integers with zero diagonal such that each row sum is the same. Equivalently, these are zero diagonal symmetric contingency tables with uniform margins, or loop-free regular multigraphs. We determine the asymptotic value of this number as the size of the matrix tends to infinity, provided the row sum is large enough. We conjecture that our answer is valid for all row sums.
Full work available at URL: https://arxiv.org/abs/1108.4496
Recommendations
- Asymptotic enumeration of integer matrices with large equal row and column sums
- Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of binary matrices with bounded row and column sums
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- scientific article; zbMATH DE number 3906527
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- scientific article; zbMATH DE number 969973
Cites Work
- Linear homogeneous Diophantine equations and magic labelings of graphs
- The asymptotic number of labeled graphs with given degree sequences
- Asymptotic enumeration by degree sequence of graphs of high degree
- Subgraphs of dense random graphs with specified degrees
- Asymptotic enumeration of integer matrices with large equal row and column sums
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
Cited In (11)
- Degree sequences of sufficiently dense random uniform hypergraphs
- Asymptotics for incidence matrix classes
- Asymptotic enumeration of integer matrices with large equal row and column sums
- Asymptotic enumeration of lonesum matrices
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Asymptotic enumeration of difference matrices over cyclic groups
- Title not available (Why is that?)
- Asymptotics and statistics on Fishburn matrices: Dimension distribution and a conjecture of Stoimenow
- Asymptotics for the number of row-Fishburn matrices
- Title not available (Why is that?)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
Uses Software
This page was built for publication: ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4918320)
