Pages that link to "Item:Q953898"
From MaRDI portal
The following pages link to Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898):
Displaying 21 items.
- The maximal length of a chain in the Bruhat order for a class of binary matrices (Q649577) (← links)
- Matrices with prescribed row and column sums (Q763065) (← 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 largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\) (Q1943693) (← 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)
- Exchangeable pairs, switchings, and random regular graphs (Q2256130) (← links)
- Asymptotic enumeration of linear hypergraphs with given number of vertices and edges (Q2300585) (← links)
- Lower bounds for contingency tables via Lorentzian polynomials (Q2698417) (← links)
- Asymptotic distribution of the numbers of vertices and arcs of the giant strong component in sparse random digraphs (Q2818275) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Regularity in Weighted Graphs: A Symmetric Function Approach (Q3120646) (← links)
- Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices (Q4554532) (← links)
- ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS (Q4918320) (← links)
- What Does a Random Contingency Table Look Like? (Q4933598) (← links)
- Phase transition in random contingency tables with non-uniform margins (Q5147423) (← links)
- ASYMPTOTIC EVALUATION OF BOSONIC PROBABILITY AMPLITUDES IN LINEAR UNITARY NETWORKS IN THE CASE OF LARGE NUMBER OF BOSONS (Q5413313) (← links)
- (Q5688090) (← links)
- On the number of contingency tables and the independence heuristic (Q6175406) (← links)