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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the efficiency of adaptive MCMC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ergodicity properties of some adaptive MCMC algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On adaptive Markov chain Monte Carlo algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3017807 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4092750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learn From Thy Neighbor: Parallel-Chain and Regional Adaptive MCMC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delayed rejection in reversible jump Metropolis-Hastings / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive Metropolis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing exponential random graph (p-star) models with missing data using Bayesian data augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metropolis-Hastings algorithms with delayed rejection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordering and improving the performance of Monte Carlo Markov chains. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimum Monte-Carlo sampling using Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of adaptive direction sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak convergence and optimal scaling of random walk Metropolis algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scaling of Discrete Approximations to Langevin Diffusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal scaling for various Metropolis-Hastings algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coupling and Ergodicity of Adaptive Markov Chain Monte Carlo Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains for exploring posterior distributions. (With discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Metropolis-Hastings kernels for general state spaces / rank
 
Normal rank

Latest revision as of 10: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

    Efficient computational strategies for doubly intractable problems with applications to Bayesian social networks (English)
    0 references
    0 references
    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 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references