Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (Q5963546): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Bergm / rank | |||
Normal rank | |||
Revision as of 01:42, 29 February 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
