scientific article; zbMATH DE number 795108
From MaRDI portal
zbMath0839.05005MaRDI QIDQ4845257
Publication date: 18 June 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
marginscomputational complexityMarkov chainsYoung tableauxsymmetric functionscontingency tablesMonte Carlo techniquesKostka numbersrectangular arraysenumeration of permutationsarray numbersmagical squares
Monte Carlo methods (65C05) Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Combinatorial probability (60C05) Orthogonal arrays, Latin squares, Room squares (05B15) Asymptotic enumeration (05A16) Contingency tables (62H17)
Related Items
Analysis of a nonreversible Markov chain sampler., The Dirichlet Markov ensemble, Statistical enumeration of groups by double cosets, On vector partition functions, Effective lattice point counting in rational convex polytopes, On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries, Orthogonal bases for transportation polytopes applied to Latin squares, magic squares and sudoku boards, Exact sampling and counting for fixed-margin matrices, Brunn--Minkowski inequalities for contingency tables and integer flows, Some things we've learned (about Markov chain Monte Carlo), A sequential algorithm for generating random graphs, On uniform generation of two-way tables with fixed margins and the conditional volume test of Diaconis and Efron, On the mixing time of the Diaconis-Gangolli random walk on contingency tables over \(\mathbb{Z}/q\mathbb{Z} \), A fast MCMC algorithm for the uniform sampling of binary matrices with fixed margins, Bounds on Kronecker coefficients via contingency tables, Hit and run as a unifying device, On the number of contingency tables and the independence heuristic, Asymptotic enumeration of integer matrices with large equal row and column sums, Parabolic double cosets in Coxeter groups, Counting Integral Points in Polytopes via Numerical Analysis of Contour Integration, Lower bounds for contingency tables via Lorentzian polynomials, Sampling contingency tables, The Ehrhart polynomial of the Birkhoff polytope, Unnamed Item, On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries, Markov bases of three-way tables are arbitrarily complicated, Phase transition in random contingency tables with non-uniform margins, A two-sided analogue of the Coxeter complex, Rejection sampling of bipartite graphs with given degree sequence, Sampling hypergraphs with given degrees, A class of random walks on the hypercube, Configuring Random Graph Models with Fixed Degree Sequences, New Classes of Degree Sequences with Fast Mixing Swap Markov Chain Sampling, Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Pseudomoments of the Riemann zeta-function and pseudomagic squares, Random generation of \(2 \times 2 \times\dots \times 2 \times J\) contingency tables, On the complexity of computing Kronecker coefficients, The many aspects of counting lattice points in polytopes, A divide-and-conquer algorithm for generating Markov bases of multi-way tables, A polynomial-time algorithm to approximately count contingency tables when the number of rows is constant, Gelfand-Tsetlin polytopes and the integer decomposition property, A generating function for all semi-magic squares and the volume of the Birkhoff polytope, Unnamed Item, Unnamed Item, Algebraic algorithms for sampling from conditional distributions, Counting parabolic double cosets in symmetric groups, Randomization methods for assessing data analysis results on real‐valued matrices, Friends and strangers walking on graphs, Sampling binary contingency tables with a greedy start, Faces of Birkhoff Polytopes, An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums, Graphs of transportation polytopes, Parabolic induction and perverse sheaves on \(W \backslash \mathfrak{h} \), Sampling \(k\)-partite graphs with a given degree sequence, Random sampling of contingency tables via probabilistic divide-and-conquer, On the number of faces of certain transportation polytopes, Contingency tables with variable margins (with an appendix by Pavel Etingof), Polynomial-time counting and sampling of two-rowed contingency tables, A Decomposition Based Proof for Fast Mixing of a Markov Chain over Balanced Realizations of a Joint Degree Matrix
