Simulated annealing
Robert Azencott (1987-1988)
Séminaire Bourbaki
Similarity:
Robert Azencott (1987-1988)
Séminaire Bourbaki
Similarity:
Cohn, Harry (1979)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bernard Ycart (1999)
ESAIM: Probability and Statistics
Similarity:
Olivier Catoni, Raphaël Cerf (1997)
ESAIM: Probability and Statistics
Similarity:
Piotr Pokarowski (1999)
Applicationes Mathematicae
Similarity:
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Kalashnikov, Vladimir V. (1994)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Gani, J. (1998)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Bandyopadhyay, Antar, Aldous, David J. (2001)
Electronic Communications in Probability [electronic only]
Similarity:
Vincent Vigon (2011)
Annales de l'I.H.P. Probabilités et statistiques
Similarity:
(Homogeneous) Markov bridges are (time homogeneous) Markov chains which begin at a given point and end at a given point. The price to pay for preserving the homogeneity is to work with processes with a random life-span. Bridges are studied both for themselves and for their use in describing the transformations of Markov chains: restriction on a random interval, time reversal, time change, various conditionings comprising the confinement in some part of the state space. These bridges...
Rosenthal, Jeffrey S. (2002)
Electronic Communications in Probability [electronic only]
Similarity: