Add to ORKGSIGLEAvailable from British Library Document Supply Centre- DSC:5186.0913(ECS-LFCS--91-178) / BLDSC - British Library Document Supply CentreGBUnited Kingdo
Theme 4 - Simulation et optimisation de systemes complexes. Projet ASSIGLEAvailable at INIST (FR), D...
We establish sub-exponential bounds for the β-mixing rate and for the rate of convergence to invaria...
We survey possible strategies to improve the performance of Markov chain Monte Carlo methods either ...
A variety of paradigms have been proposed to speed up Markov chain mixing, ranging from non-backtrac...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
This thesis is concerned with isoperimetric methods for studying the rate at which Markov chains app...
AbstractMixing time quantifies the convergence speed of a Markov chain to the stationary distributio...
V práci se zabýváme rychlostí konvergence ireducibilních a aperiodických homogenních markovských řet...
We establish sub-exponential bounds for the β-mixing rate and for the rate of con-vergence to invari...
These are the notes for the minicourse on Markov chains delivered at the Saint Petersburg Summer Sch...
AbstractIf a Markov chain satisfies a certain condition that is slightly weaker than Ψ-mixing, then ...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
This is a preprint of an article published in the journal Random Structures & Algorithms, 18(2), 101...
International audienceWe establish a link between the maximization of Kolmogorov Sinai entropy (KSE)...
Theme 4 - Simulation et optimisation de systemes complexes. Projet ASSIGLEAvailable at INIST (FR), D...
We establish sub-exponential bounds for the β-mixing rate and for the rate of convergence to invaria...
We survey possible strategies to improve the performance of Markov chain Monte Carlo methods either ...
A variety of paradigms have been proposed to speed up Markov chain mixing, ranging from non-backtrac...
In the past few years we have seen a surge in the theory of finite Markov chains, by way of new tech...
This thesis is concerned with isoperimetric methods for studying the rate at which Markov chains app...
AbstractMixing time quantifies the convergence speed of a Markov chain to the stationary distributio...
V práci se zabýváme rychlostí konvergence ireducibilních a aperiodických homogenních markovských řet...
We establish sub-exponential bounds for the β-mixing rate and for the rate of con-vergence to invari...
These are the notes for the minicourse on Markov chains delivered at the Saint Petersburg Summer Sch...
AbstractIf a Markov chain satisfies a certain condition that is slightly weaker than Ψ-mixing, then ...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
This is a preprint of an article published in the journal Random Structures & Algorithms, 18(2), 101...
International audienceWe establish a link between the maximization of Kolmogorov Sinai entropy (KSE)...
Theme 4 - Simulation et optimisation de systemes complexes. Projet ASSIGLEAvailable at INIST (FR), D...
We establish sub-exponential bounds for the β-mixing rate and for the rate of convergence to invaria...
We survey possible strategies to improve the performance of Markov chain Monte Carlo methods either ...