Pages that link to "Item:Q1211987"
From MaRDI portal
The following pages link to The asymptotic number of non-negative integer matrices with given row and column sums (Q1211987):
Displayed 15 items.
- Induced subgraphs in sparse random graphs with given degree sequences (Q427801) (← links)
- Automorphisms of random graphs with specified vertices (Q760705) (← links)
- Matrices with prescribed row and column sums (Q763065) (← links)
- Brunn--Minkowski inequalities for contingency tables and integer flows (Q876322) (← links)
- On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
- Enumeration and simulation methods for 0-1 matrices with given marginals (Q1205742) (← links)
- The asymptotic number of labeled graphs with given degree sequences (Q1255501) (← links)
- Combinatorial analysis. (Matrix problems, choice theory) (Q1837183) (← links)
- Asymptotic enumeration of integer matrices with large equal row and column sums (Q1945291) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- Random dense bipartite graphs and directed graphs with specified degrees (Q3055774) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Control landscapes for observable preparation with open quantum systems (Q3544608) (← links)
- Almost all regular graphs are hamiltonian (Q4286301) (← links)
- On the enumeration of rectangular (0, 1)-matrices (Q4869584) (← links)