Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (Q5963546): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s11222-014-9516-7 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S11222-014-9516-7 / rank | |||
Normal rank | |||
Revision as of 15:03, 8 December 2024
scientific article; zbMATH DE number 6543336
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
