University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Edge-reinforced random walk on a two-dimensional graph

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Edge-reinforced random walk on a two-dimensional graph

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.

Other lists

Lecture Room 1, Institute for Manufacturing, West Cambridge LT2, Department of Chemical Engineering and Biotechnology Lloyd Room, Christ’s College

Other talks

Title to be confirmed Title to be confirmed Kirk Public Lecture | A proxy window into the beautiful and challenging world of causal attribution Semiconductor-based neutron detector development at QMUL Illegal trade in the North Atlantic title and abstract tba (joint seminar with Spectral Geometry in the Clouds)
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity