Remarks on the recurrence and transience of non-backtracking random walks (Q2188745)
From MaRDI portal
!
WARNING
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 7211440
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Remarks on the recurrence and transience of non-backtracking random walks |
scientific article; zbMATH DE number 7211440 |
Statements
Remarks on the recurrence and transience of non-backtracking random walks (English)
0 references
11 June 2020
0 references
The setting of the article is a given regular infinite graph with transition probabilities (a graph is regular if and only if all the vertex degrees are the same). Non-backtracking random walks are random processes defined on such graphs. Recurrences of these random walks are compared with simple random walks and it is shown that they are equivalent. Moreover, the article shows how to generalize the proof to certain non-regular graphs.
0 references
non-backtracking random walk
0 references
Pólya's theorem
0 references
0.8318734765052795
0 references
0.7938717007637024
0 references
0.7911720275878906
0 references
0.7882719039916992
0 references
0.7695915699005127
0 references
