Pages that link to "Item:Q817603"

The following pages link to Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums (Q817603):

Displaying 36 items.

• Asymptotic enumeration of sparse uniform linear hypergraphs with given degrees (Q311513) (← links)
• Exact sampling and counting for fixed-margin matrices (Q366999) (← links)
• Asymptotic enumeration of sparse uniform hypergraphs with given degrees (Q499481) (← links)
• The maximal length of a chain in the Bruhat order for a class of binary matrices (Q649577) (← links)
• Counting unlabeled bipartite graphs using Polya's theorem (Q668962) (← links)
• Matrices with prescribed row and column sums (Q763065) (← links)
• Most binary matrices have no small defining set (Q785838) (← links)
• Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898) (← links)
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries (Q962158) (← links)
• Asymptotic enumeration of 0-1 matrices with equal row sums and equal column sums (Q1414144) (← links)
• Cooperation in partly observable networked markets (Q1691363) (← 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)
• Sampling hypergraphs with given degrees (Q1981695) (← links)
• On the number of linear multipartite hypergraphs with given size (Q2053710) (← links)
• Asymptotic enumeration of non-uniform linear hypergraphs (Q2062682) (← links)
• Antichains of \((0, 1)\)-matrices through inversions (Q2250943) (← links)
• Exchangeable pairs, switchings, and random regular graphs (Q2256130) (← links)
• Asymptotic enumeration of linear hypergraphs with given number of vertices and edges (Q2300585) (← links)
• Efficient importance sampling for binary contingency tables (Q2389598) (← links)
• Asymptotic enumeration of dense 0-1 matrices with specified line sums (Q2469197) (← links)
• Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications (Q2514145) (← links)
• Factorisation of the complete graph into spanning regular factors (Q2689165) (← links)
• Ensemble nonequivalence in random graphs with modular structure (Q2965327) (← links)
• Subgraphs of Dense Random Graphs with Specified Degrees (Q2998852) (← links)
• Random dense bipartite graphs and directed graphs with specified degrees (Q3055774) (← links)
• Counting and selecting at random bipartite graphs with fixed degrees (Q3495378) (← links)
• Subgraphs of Random<i>k</i>-Edge-Coloured<i>k</i>-Regular Graphs (Q3552512) (← links)
• (Q3684147) (← links)
• Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices (Q4554532) (← links)
• Characterizing optimal sampling of binary contingency tables via the configuration model (Q4909199) (← links)
• ASYMPTOTIC ENUMERATION OF SYMMETRIC INTEGER MATRICES WITH UNIFORM ROW SUMS (Q4918320) (← links)
• The probability that a random multigraph is simple. II (Q5245618) (← links)
• Structure of eigenvectors of random regular digraphs (Q5380492) (← links)
• Factorisation of the complete bipartite graph into spanning semiregular factors (Q6065686) (← links)
• Asymptotic enumeration of digraphs and bipartite graphs by degree sequence (Q6074864) (← links)