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 26 items.
- Induced subgraphs in sparse random graphs with given degree sequences (Q427801) (← links)
- Expansion of random graphs: new proofs, new results (Q496208) (← links)
- Automorphisms of random graphs with specified vertices (Q760705) (← links)
- Matrices with prescribed row and column sums (Q763065) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← 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)
- On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \) (Q2179619) (← links)
- Exact tests for the Rasch model via sequential importance sampling (Q2260062) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- Ensemble nonequivalence in random graphs with modular structure (Q2965327) (← 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)
- (Q4558517) (← links)
- On the enumeration of rectangular (0, 1)-matrices (Q4869584) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS (Q5413313) (← links)
- Spectral gap in random bipartite biregular graphs and applications (Q5886318) (← links)
- Asymptotic enumeration of digraphs and bipartite graphs by degree sequence (Q6074864) (← links)
- An extension of the Erdős-Ko-Rado theorem to uniform set partitions (Q6158904) (← links)