Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (Q5963546)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
scientific article; zbMATH DE number 6543336
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks |
scientific article; zbMATH DE number 6543336 |
Statements
Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (English)
0 references
22 February 2016
0 references
adaptive Metropolis-Hastings proposal
0 references
delayed rejection
0 references
doubly-intractable target
0 references
intractable likelihoods
0 references
Markov chain Monte Carlo
0 references
exponential random graphs
0 references
0 references
0.7985413670539856
0 references
0.7965823411941528
0 references
0.7617307901382446
0 references
0.7540966868400574
0 references
0.7457755208015442
0 references
