How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph (Q4216134)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph |
scientific article; zbMATH DE number 1213746
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph |
scientific article; zbMATH DE number 1213746 |
Statements
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph (English)
0 references
23 August 1999
0 references
computational probability theory
0 references
