Embeddings, entanglement, and percolation

Add to your list(s) Download to your calendar using vCal

• Geoffrey Grimmett (Cambridge)
• Tuesday 16 February 2010, 16:30-17:30
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB.

If you have a question about this talk, please contact Berestycki.

Can there exist a monotone embedding of one infinite random word inside another, with bounded gaps? What can be said about the critical point for the existence of an infinite `entangled’ set of open edges in the percolation model on the cubic lattice? These two questions are connected through a new type of percolation process, called `Lipschitz percolation’. It will be shown how to embed higher-dimensional words, and to obtain the best (so far) lower bound for the entanglement critical point.

This talk is part of the Probability series.

This talk is included in these lists:

• All CMS events
• All Talks (aka the CURE list)
• CMS Events
• DPMMS Lists
• DPMMS info aggregator
• DPMMS lists
• Hanchen DaDaDash
• Interested Talks
• MR12, CMS, Wilberforce Road, Cambridge, CB3 0WB
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.