General state space Markov chains and MCMC algorithms.
Roberts, Gareth O., Rosenthal, Jeffrey S. (2004)
Probability Surveys [electronic only]
Similarity:
Roberts, Gareth O., Rosenthal, Jeffrey S. (2004)
Probability Surveys [electronic only]
Similarity:
Kovchegov, Yevgeniy V. (2010)
Electronic Communications in Probability [electronic only]
Similarity:
Jȩdrzejowski, Mieczysław (2005)
Zeszyty Naukowe Uniwersytetu Jagiellońskiego. Universitatis Iagellonicae Acta Mathematica
Similarity:
Anja Voss-Böhme (2011)
Kybernetika
Similarity:
For general interacting particle systems in the sense of Liggett, it is proven that the class of cylinder functions forms a core for the associated Markov generator. It is argued that this result cannot be concluded by straightforwardly generalizing the standard proof technique that is applied when constructing interacting particle systems from their Markov pregenerators.
Ganapathy, Murali (2007)
Electronic Journal of Probability [electronic only]
Similarity:
Su, Joseph C. (2007)
Journal of Integer Sequences [electronic only]
Similarity:
Chigansky, Pavel, Liptser, Robert (2006)
Electronic Communications in Probability [electronic only]
Similarity:
Behrouz Kheirfam, Nezam Mahdavi-Amiri (2013)
Kybernetika
Similarity:
A full Nesterov-Todd step infeasible interior-point algorithm is proposed for solving linear programming problems over symmetric cones by using the Euclidean Jordan algebra. Using a new approach, we also provide a search direction and show that the iteration bound coincides with the best known bound for infeasible interior-point methods.
Nagahata, Yukio, Yoshida, Nobuo (2010)
Electronic Communications in Probability [electronic only]
Similarity: