A perfect sampling algorithm of random walks with forbidden arcs

Stéphane Durand 1 Bruno Gaujal 1 Florence Perronnin 1 Jean-Marc Vincent 1
1 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : In this paper we show how to construct an algorithm to sample the stationary distribution of a random walk over ${1,...,N}^d$ with forbidden arcs. This algorithm combines the rejection method and coupling from the past of a set of trajectories of the Markov chain that generalizes the classical sandwich approach. We also provide a complexity analysis of this approach in several cases showing a coupling time in $O(N^2 d log d )$ when no arc is forbidden and an experimental study of its performance.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.inria.fr/hal-01069975
Contributor : Florence Perronnin <>
Submitted on : Tuesday, September 30, 2014 - 11:43:53 AM
Last modification on : Thursday, October 11, 2018 - 8:48:02 AM

Links full text

Identifiers

Citation

Stéphane Durand, Bruno Gaujal, Florence Perronnin, Jean-Marc Vincent. A perfect sampling algorithm of random walks with forbidden arcs. QEST 2014 - 11th International Conference on Quantitative Evaluation of Systems, Sep 2014, Florence, Italy. pp.178-193, ⟨10.1007/978-3-319-10696-0_15⟩. ⟨hal-01069975⟩

Share

Metrics

Record views

210