How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph (Q4216134): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1006/jagm.1997.0917 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035402840 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JAGM.1997.0917 / rank | |||
Normal rank | |||
Latest revision as of 12:27, 29 December 2024
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
