What happens to a random walk of chained particles when the chain forms a loop or is very long?
- 👤 Speaker: Professor Serge Cohen, Institut Mathematique de Toulouse
- 📅 Date & Time: Thursday 12 June 2014, 15:30 - 16:30
- 📍 Venue: MR13, CMS, Wilberforce Road, Cambridge, CB3 0WB
Abstract
Consider a random walk of a chain of K+1 particles at integer sites, where the chaining keeps each particle at distance 1 from its immediate neighbours. In dimension 1, we showed with Boissard, Espinasse and Norris that the effect of chaining is to slow down the walk by a factor of 2/(K+2). In this talk I will make some remarks for the cases when K is infinite and when the ends of the chain are joined.
Series This talk is part of the Probability series.
Included in Lists
- All CMS events
- All Talks (aka the CURE list)
- bld31
- CMS Events
- DPMMS info aggregator
- DPMMS lists
- DPMMS Lists
- Hanchen DaDaDash
- Interested Talks
- MR13, CMS, Wilberforce Road, Cambridge, CB3 0WB
- Probability
- School of Physical Sciences
- Statistical Laboratory info aggregator
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Professor Serge Cohen, Institut Mathematique de Toulouse
Thursday 12 June 2014, 15:30-16:30