Edge-reinforced random walk on a two-dimensional graph
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Mustapha Amrani.
Mathematics and Physics of Anderson localization: 50 Years After
We consider linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from Z^2 by replacing every edge by a sufficiently large, but fixed number of edges in series. We prove that linearly edge-reinforced random walk on these graphs is recurrent.
This talk is part of the Isaac Newton Institute Seminar Series series.
This talk is included in these lists:
Note that ex-directory lists are not shown.
|