The asymptotic number of integer stochastic matrices

DOI10.1016/0012-365X(71)90007-0zbMATH Open0217.01901MaRDI QIDQ2546201FDOQ2546201

Authors: C. J. Everett, Paul R. Stein 

Publication date: 1971

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Asymptotic enumeration (05A16) Stochastic matrices (15B51)

Cites Work

• A combinatorial distribution problem
• Group Characters and the Structure of Groups
• Title not available (Why is that?)
• Asymptotics in Random (0, 1)-Matrices

Cited In (13)

• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums
• Antichains of \((0, 1)\)-matrices through inversions
• Asymptotic enumeration of integer matrices with large equal row and column sums
• Symmetric functions and P-recursiveness
• Chains and antichains in the Bruhat order for classes of \((0,1)\)-matrices
• The enumeration of arrays and a generalization related to contingency tables
• Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications
• The asymptotic number of non-negative integer matrices with given row and column sums
• Title not available (Why is that?)
• Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
• Asymptotic enumeration of digraphs and bipartite graphs by degree sequence
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums
• Combinatorial analysis. (Matrix problems, choice theory)

This page was built for publication: The asymptotic number of integer stochastic matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2546201)