Recurrence of edge-reinforced random walk on a two-dimensional graph (Q1035859): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: math/0703027 / rank | |||
Normal rank | |||
Revision as of 18:46, 18 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Recurrence of edge-reinforced random walk on a two-dimensional graph |
scientific article |
Statements
Recurrence of edge-reinforced random walk on a two-dimensional graph (English)
0 references
4 November 2009
0 references
The paper deals with a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant weights. Here one discusses some questions related to a reinforced random walk on non-tree graphs. One proves that the linearly edge-reinforced random walk on these graphs is recurrent. To this end one uses the concept of a \(r\)-diluted version of a given graph which is obtained by replacing every edge by \(r\) edges. By this way, the recurrence is simpler to be proven.
0 references
reinforced random walk
0 references
recurence
0 references
hitting probabilities
0 references
