On the enumeration of rectangular (0, 1)-matrices

DOI10.1080/00949659508811639zbMath0840.05031OpenAlexW1965765795MaRDI QIDQ4869584

John A. Jun. Hendrickson

Publication date: 26 March 1996

Published in: Journal of Statistical Computation and Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00949659508811639

zbMATH Keywords

random graphssimilarityapproximationsenumerationbipartite graphscluster analysis\((0,1)\)-matricesstatistical ecologyRasch modelsemi-regular bipartite graphs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Enumeration in graph theory (05C30)

Related Items (2)

On combinatorial rectangles with minimum ∞−discrepancy ⋮ Constructing fullerene graphs from their eigenvalues and angles

Cites Work

• Unnamed Item
• Unnamed Item
• The enumeration of arrays and a generalization related to contingency tables
• On some significance tests in cluster analysis
• Matrices of zeros and ones with fixed row and column sum vectors
• The class A(R,S) of (0,1)-matrices
• The asymptotic number of non-negative integer matrices with given row and column sums
• Combinatorial Properties of Matrices of Zeros and Ones
• Counting the Number of r × c Contingency Tables with Fixed Margins
• A Matrix Occupancy Problem
• Generalized Monte Carlo significance tests
• The Enumeration of Locally Restricted Graphs (II)
• Asymptotics and random matrices with row-sum and column sum-restrictions
• Some Tests Based on Dichotomization

This page was built for publication: On the enumeration of rectangular (0, 1)-matrices