On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
From MaRDI portal
Publication:962158
DOI10.1016/j.aim.2009.12.001zbMath1191.15031arXiv0806.1480OpenAlexW2150635973MaRDI QIDQ962158
Publication date: 6 April 2010
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0806.1480
Convex programming (90C25) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Inverse problems in linear algebra (15A29) Random matrices (algebraic aspects) (15B52) Matrices of integers (15B36)
Related Items
Rank relations between a \(\{0, 1\}\)-matrix and its complement, Chains and Antichains in the Bruhat Order for Classes of (0, 1)-Matrices, Estimating parameters of a probabilistic heterogeneous block model via the EM algorithm, Asymptotic properties of random contingency tables with uniform margin, Threshold functions for small subgraphs in simple graphs and multigraphs, Asymptotic enumeration of digraphs and bipartite graphs by degree sequence, Analysis of local search landscapes for \(k\)-SAT instances, On the largest size of an antichain in the Bruhat order for \(\mathcal A (2k,k)\), On the number of contingency tables and the independence heuristic, Block-regularized repeated learning-testing for estimating generalization error, Lower bounds for contingency tables via Lorentzian polynomials, Random graphs with a given degree sequence, Unnamed Item, The maximal length of a chain in the Bruhat order for a class of binary matrices, MAX-plus objects to study the complexity of graphs, Phase transition in random contingency tables with non-uniform margins, Characterizing optimal sampling of binary contingency tables via the configuration model, Limiting properties of an equiprobable sampling scheme for 0-1 matrices, The number of graphs and a random graph with a given degree sequence, Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes, Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications, Bootstrapping on undirected binary networks via statistical mechanics, Matrices with prescribed row and column sums
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The enumeration of arrays and a generalization related to contingency tables
- Entropy bounds for perfect matchings and Hamiltonian cycles
- Asymptotic enumeration of sparse 0--1 matrices with irregular row and column sums
- Fast uniform generation of regular graphs
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Hamiltonian cycles in Dirac graphs
- Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all
- The asymptotic number of non-negative integer matrices with given row and column sums
- Classical complexity and quantum entanglement
- Integration and optimization of multivariate polynomials by restriction onto a random subspace
- Asymptotic enumeration of dense 0-1 matrices with specified line sums
- Asymptotic enumeration of dense 0-1 matrices with equal row sums and equal column sums
- Random dense bipartite graphs and directed graphs with specified degrees
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
- Two Algorithmic Results for the Traveling Salesman Problem
- Asymptotics and random matrices with row-sum and column sum-restrictions
- Sequential Monte Carlo Methods for Statistical Analysis of Tables
- Sampling binary contingency tables with a greedy start
- A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents
