Efficient importance sampling for binary contingency tables (Q2389598)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5580229
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient importance sampling for binary contingency tables |
scientific article; zbMATH DE number 5580229 |
Statements
Efficient importance sampling for binary contingency tables (English)
0 references
17 July 2009
0 references
approximate counting
0 references
bipartite graphs
0 references
binary tables
0 references
importance sampling
0 references
Markov processes
0 references
Doob \(h\)-transform
0 references
changes-of-measure
0 references
rare-event simulation
0 references
0 references
0.8138101100921631
0 references
0.8046810626983643
0 references
0.8046810626983643
0 references
