POSTDOCGrenoble.pdf : Différence entre versions
De MARMOTE
m |
|||
Ligne 1 : | Ligne 1 : | ||
Post doc position in the Mescal team of Inria Grenoble. | Post doc position in the Mescal team of Inria Grenoble. | ||
− | The overall framework is the analysis of Markov | + | The overall framework is the analysis of Markov chains. |
− | More precisely, the post-doc will investigate simulation and sampling of Markov chains , in relation with | + | More precisely, the post-doc will investigate simulation and sampling of Markov chains, in relation with |
one or several of the following points: | one or several of the following points: | ||
− | + | * improvement of perfect sampling algorithms of finite and infinite Markov chains, | |
− | + | * optimal coupling, | |
− | + | * estimations of coupling times and mixing times, | |
− | + | * relations between importance sampling and perfect sampling, | |
− | + | * execution times of Gibbs sampling algorithms. | |
Contacts: | Contacts: | ||
− | Bruno Gaujal (bruno.gaujal@inria.fr) | + | Bruno Gaujal (bruno.gaujal@inria.fr), |
Jean-Marc Vincent (jean-marc.vincent@imag.fr) | Jean-Marc Vincent (jean-marc.vincent@imag.fr) |
Version actuelle datée du 24 mars 2015 à 14:34
Post doc position in the Mescal team of Inria Grenoble.
The overall framework is the analysis of Markov chains. More precisely, the post-doc will investigate simulation and sampling of Markov chains, in relation with one or several of the following points:
- improvement of perfect sampling algorithms of finite and infinite Markov chains,
- optimal coupling,
- estimations of coupling times and mixing times,
- relations between importance sampling and perfect sampling,
- execution times of Gibbs sampling algorithms.
Contacts:
Bruno Gaujal (bruno.gaujal@inria.fr),
Jean-Marc Vincent (jean-marc.vincent@imag.fr)