How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
type: Item
instance of: scholarly article
title: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
zbMATH Open document ID: 0919.68092
author: James Propp
author: David B. Wilson
published in: Journal of Algorithms
publication date: 1999-08-23T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1213746
zbMATH Keywords: computational probability theory
MaRDI profile type: Publication
OpenAlex ID: W2035402840
DOI: 10.1006/JAGM.1997.0917
description: scientific article; zbMATH DE number 1213746