Most transient random walks have infinitely many cut times (Q6142953)
From MaRDI portal
scientific article; zbMATH DE number 7793395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Most transient random walks have infinitely many cut times |
scientific article; zbMATH DE number 7793395 |
Statements
Most transient random walks have infinitely many cut times (English)
0 references
23 January 2024
0 references
cut times
0 references
Markov chains
0 references
random walks
0 references
0 references
0 references
