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

We present a new approach for random sampling of contingency tables of any size and constraints based on a recently introduced probabilistic divide-and-conquer (PDC) technique. Our first application is a recursive PDC: it samples the least significant bit of each entry in the table, motivated by the...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computational statistics Ročník 35; číslo 2; s. 837 - 869
Hlavní autori:	DeSalvo, Stephen, Zhao, James
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2020 Springer Nature B.V
Predmet:	Algorithms Contingency Contingency tables Economic Theory/Quantitative Economics/Mathematical Methods Mathematics and Statistics Monte Carlo simulation Original Paper Probability and Statistics in Computer Science Probability theory Probability Theory and Stochastic Processes Random sampling Random variables Sampling techniques Statistics Exact sampling Boltzmann sampler Transportation polytope Approximate sampling
ISSN:	0943-4062, 1613-9658
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!