University of Cambridge > > Probability > Embeddings, entanglement, and percolation

Embeddings, entanglement, and percolation

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


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