Pages that link to "Item:Q2571271"

The following pages link to Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums (Q2571271):

Displaying 7 items.

• On the singularity of adjacency matrices for random regular digraphs (Q510262) (← links)
• A Fourier-analytic approach to counting partial Hadamard matrices (Q601111) (← links)
• The maximal length of a chain in the Bruhat order for a class of binary matrices (Q649577) (← links)
• Counting loopy graphs with given degrees (Q763074) (← links)
• Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums (Q817603) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)