Efficient importance sampling for binary contingency tables (Q2389598): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3099324675 / rank | |||
Normal rank | |||
Latest revision as of 10:50, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient importance sampling for binary contingency tables |
scientific article |
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
