Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (Q5963546): Difference between revisions

Latest revision as of 11:56, 11 July 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

instance of

scholarly article

0 references

title

Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (English)

0 references

zbMATH Open document ID

1331.62127

0 references

DOI

10.1007/s11222-014-9516-7

0 references

0 references

0 references

Statistics and Computing

0 references

publication date

22 February 2016

0 references

full work available at URL

https://arxiv.org/abs/1403.4402

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

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

describes a project that uses

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

0 references

0 references

On the efficiency of adaptive MCMC algorithms

0 references

On the ergodicity properties of some adaptive MCMC algorithms

0 references

On adaptive Markov chain Monte Carlo algorithms

0 references

Q3017807

0 references

Q4092750

0 references

Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC

0 references

Delayed rejection in reversible jump Metropolis-Hastings

0 references

An adaptive Metropolis algorithm

0 references

Analysing exponential random graph (p-star) models with missing data using Bayesian data augmentation

0 references

On Metropolis-Hastings algorithms with delayed rejection

0 references

Ordering and improving the performance of Monte Carlo Markov chains.

0 references

Optimum Monte-Carlo sampling using Markov chains

0 references

Convergence of adaptive direction sampling

0 references

Weak convergence and optimal scaling of random walk Metropolis algorithms

0 references

Optimal Scaling of Discrete Approximations to Langevin Diffusions

0 references

Optimal scaling for various Metropolis-Hastings algorithms.

0 references

Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms

0 references

Markov chains for exploring posterior distributions. (With discussion)

0 references

A note on Metropolis-Hastings kernels for general state spaces

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5963546

@@ Property / describes a project that uses @@
+ergm
@@ Property / describes a project that uses: ergm / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+statnet
@@ Property / describes a project that uses: statnet / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1983981363
@@ Property / OpenAlex ID: W1983981363 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4402
@@ Property / arXiv ID: 1403.4402 / rank @@
+Normal rank
@@ Property / cites work @@
+On the efficiency of adaptive MCMC algorithms
@@ Property / cites work: On the efficiency of adaptive MCMC algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+On the ergodicity properties of some adaptive MCMC algorithms
+Normal rank
@@ Property / cites work @@
+On adaptive Markov chain Monte Carlo algorithms
@@ Property / cites work: On adaptive Markov chain Monte Carlo algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Q3017807
@@ Property / cites work: Q3017807 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4092750
@@ Property / cites work: Q4092750 / rank @@
+Normal rank
@@ Property / cites work @@
+Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC
+Normal rank
@@ Property / cites work @@
+Delayed rejection in reversible jump Metropolis-Hastings
+Normal rank
@@ Property / cites work @@
+An adaptive Metropolis algorithm
@@ Property / cites work: An adaptive Metropolis algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Analysing exponential random graph (p-star) models with missing data using Bayesian data augmentation
+Normal rank
@@ Property / cites work @@
+On Metropolis-Hastings algorithms with delayed rejection
+Normal rank
@@ Property / cites work @@
+Ordering and improving the performance of Monte Carlo Markov chains.
+Normal rank
@@ Property / cites work @@
+Optimum Monte-Carlo sampling using Markov chains
@@ Property / cites work: Optimum Monte-Carlo sampling using Markov chains / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence of adaptive direction sampling
@@ Property / cites work: Convergence of adaptive direction sampling / rank @@
+Normal rank
@@ Property / cites work @@
+Weak convergence and optimal scaling of random walk Metropolis algorithms
+Normal rank
@@ Property / cites work @@
+Optimal Scaling of Discrete Approximations to Langevin Diffusions
+Normal rank
@@ Property / cites work @@
+Optimal scaling for various Metropolis-Hastings algorithms.
+Normal rank
@@ Property / cites work @@
+Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms
+Normal rank
@@ Property / cites work @@
+Markov chains for exploring posterior distributions. (With discussion)
+Normal rank
@@ Property / cites work @@
+A note on Metropolis-Hastings kernels for general state spaces
+Normal rank