A perfect sampling algorithm of random walks with forbidden arcs - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A perfect sampling algorithm of random walks with forbidden arcs

Stéphane Durand
Bruno Gaujal
Florence Perronnin
Jean-Marc Vincent

Résumé

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.
Fichier non déposé

Dates et versions

hal-01069975 , version 1 (30-09-2014)

Identifiants

Citer

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⟩
110 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More