scientific article; zbMATH DE number 7799693

arXiv2002.12559MaRDI QIDQ6146337

Da Wu

Publication date: 5 February 2024

Full work available at URL: https://arxiv.org/abs/2002.12559

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

maximum entropy principlebinary contingency tablerandom contingency table

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• The enumeration of arrays and a generalization related to contingency tables
• Matrices with prescribed row and column sums
• On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Asymptotic enumeration of integer matrices with large equal row and column sums
• Random doubly stochastic matrices: the circular law
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• On the Eigenvalues of Random Matrices
• Solution of Shannon’s problem on the monotonicity of entropy
• What Does a Random Contingency Table Look Like?
• Phase transition in random contingency tables with non-uniform margins
• Maximum Entropy for Hypothesis Formulation, Especially for Multidimensional Contingency Tables
• Asymptotic properties of random contingency tables with uniform margin
• Asymptotic enumeration of binary contingency tables and comparison with independence heuristic
• On the number of contingency tables and the independence heuristic

This page was built for publication: