Most transient random walks have infinitely many cut times (Q6142953)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7793395
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8321267366409302
0 references
0.8055281639099121
0 references
0.7954815030097961
0 references
0.7919290065765381
0 references
0.7666054368019104
0 references
