Lower bounds for contingency tables via Lorentzian polynomials (Q2698417)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Lower bounds for contingency tables via Lorentzian polynomials	scientific article

Statements

scholarly article

0 references

Lower bounds for contingency tables via Lorentzian polynomials (English)

0 references

Petter Brändén

0 references

0 references

0 references

Israel Journal of Mathematics

0 references

publication date

24 April 2023

0 references

full work available at URL

https://arxiv.org/abs/2008.05907

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

A faster FPTAS for counting two-rowed contingency tables

0 references

A generalization of permanent inequalities and applications in counting and optimization

0 references

Log-concave polynomials. I: Entropy and a deterministic approximation algorithm for counting bases of matroids

0 references

Kostant partitions functions and flow polytopes

0 references

Counting integer flows in networks

0 references

Brunn--Minkowski inequalities for contingency tables and integer flows

0 references

Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes

0 references

On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries

0 references

What Does a Random Contingency Table Look Like?

0 references

Matrices with prescribed row and column sums

0 references

Combinatorics and complexity of partition functions

0 references

Counting integer points in higher-dimensional polytopes

0 references

An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums

0 references

The number of graphs and a random graph with a given degree sequence

0 references

An approximation algorithm for counting contingency tables

0 references

The Ehrhart polynomial of the Birkhoff polytope

0 references

An algebraic identity and the Jacobi-Trudi formula

0 references

A combinatorial model for computing volumes of flow polytopes

0 references

Unimodality, log-concavity, real-rootedness and beyond

0 references

Lorentzian polynomials

0 references

The asymptotic volume of the Birkhoff polytope

0 references

Asymptotic enumeration of integer matrices with large equal row and column sums

0 references

On the Volume of the Polytope of Doubly Stochastic Matrices

0 references

Sequential Monte Carlo Methods for Statistical Analysis of Tables

0 references

A practical volume algorithm

0 references

Rapidly Mixing Markov Chains for Sampling Contingency Tables with a Constant Number of Rows

0 references

Approximately Counting Integral Flows and Cell-Bounded Contingency Tables

0 references

Combinatorics and Geometry of Transportation Polytopes: An Update

0 references

The Complexity of Three-Way Statistical Tables

0 references

Random sampling of contingency tables via probabilistic divide-and-conquer

0 references

Testing for independence in a two-way table: New interpretations of the chi-square statistic

0 references

0 references

Algebraic algorithms for sampling from conditional distributions

0 references

Phase transition in random contingency tables with non-uniform margins

0 references

Sampling contingency tables

0 references

0 references

Practical Polytope Volume Approximation

0 references

0 references

Statistical Analysis of Contingency Tables

0 references

Counting the Number of r × c Contingency Tables with Fixed Margins

0 references

On the application of symmetric Dirichlet distributions and their mixtures to contingency tables

0 references

Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums

0 references

Counting matchings via capacity-preserving operators

0 references

Van der Waerden/Schrijver-Valiant like conjectures and stable (aka hyperbolic) homogeneous polynomials: one theorem for all

0 references

On multivariate Newton-like inequalities

0 references

A polynomial-time algorithm to approximate the mixed volume within a simply exponential factor

0 references

Boolean matrices with prescribed row/column sums and stable homogeneous polynomials: combinatorial and algorithmic applications

0 references

A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries

0 references

Contingency tables with variable margins (with an appendix by Pavel Etingof)

0 references

Contingency Table Analysis

0 references

Asymptotic Enumeration of Hypergraphs by Degree Sequence

0 references

On the number of contingency tables and the independence heuristic

0 references

Volumes and Ehrhart polynomials of flow polytopes

0 references

Exact sampling and counting for fixed-margin matrices

0 references

0 references

Four questions on Birkhoff polytopes

0 references

Bounds on Kronecker coefficients via contingency tables

0 references

0 references

Algorithms for Convex Optimization

0 references

Multivariate stable polynomials: theory and applications

0 references

ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE

0 references

Identifiers

10.1007/s11856-022-2364-9

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2698417

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2698417&oldid=37508900"