Pages that link to "Item:Q4803313"
From MaRDI portal
The following pages link to Improved bounds for sampling contingency tables (Q4803313):
Displaying 22 items.
- Rapid calculation of exact cell bounds for contingency tables from conditional frequencies (Q337192) (← links)
- Exact sampling and counting for fixed-margin matrices (Q366999) (← links)
- On the Diaconis-Gangolli Markov chain for sampling contingency tables with cell-bounded entries (Q652625) (← links)
- Random sampling of contingency tables via probabilistic divide-and-conquer (Q782654) (← links)
- Asymptotic enumeration of sparse nonnegative integer matrices with specified row and column sums (Q953898) (← links)
- Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
- Sampling contingency tables (Q1713620) (← links)
- Asymptotic enumeration of integer matrices with large equal row and column sums (Q1945291) (← links)
- Resampling for statistical confidentiality in contingency tables (Q1975684) (← links)
- Analysis of convergence rates of some Gibbs samplers on continuous state spaces (Q2447735) (← links)
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums (Q2841356) (← links)
- An approximation algorithm for counting contingency tables (Q3057067) (← links)
- Polynomial time perfect sampling algorithm for two-rowed contingency tables (Q3419592) (← links)
- Improved Estimation in a Contingency Table: Independence Structure (Q4207486) (← links)
- Sampling contingency tables (Q4345364) (← links)
- Random generation of 2�n contingency tables (Q4705324) (← links)
- On sampling with Markov chains (Q4894601) (← links)
- Characterizing optimal sampling of binary contingency tables via the configuration model (Q4909199) (← links)
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded Entries (Q5323079) (← links)
- Enumerating Contingency Tables via Random Permanents (Q5448988) (← links)
- Sampling binary contingency tables with a greedy start (Q5898351) (← links)
- Linear-time uniform generation of random sparse contingency tables with specified marginals (Q6590451) (← links)
