Efficiency of finite state space Monte Carlo Markov chains (Q5953883): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q127255307, #quickstatements; #temporary_batch_1730405394555
 
(2 intermediate revisions by 2 users not shown)
Property / cites work
 
Property / cites work: Q4272783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a nonreversible Markov chain sampler. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal spectral structure of reversible stochastic matrices, Monte Carlo methods and the simulation of Markov random fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Gaussian diffusions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217795 / 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: 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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-7152(01)00115-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088129467 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127255307 / rank
 
Normal rank

Latest revision as of 21:11, 31 October 2024

scientific article; zbMATH DE number 1697559
Language Label Description Also known as
English
Efficiency of finite state space Monte Carlo Markov chains
scientific article; zbMATH DE number 1697559

    Statements

    Efficiency of finite state space Monte Carlo Markov chains (English)
    0 references
    0 references
    29 July 2002
    0 references
    efficiency ordering
    0 references
    Markov chain Monte Carlo
    0 references
    Metropolis-Hastings algorithm
    0 references
    Peskun ordering
    0 references
    stationarity preserving and efficiency increasing probability mass transfers
    0 references

    Identifiers