University of Cambridge > Talks.cam > Probability > Embeddings, entanglement, and percolation

  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

Embeddings, entanglement, and percolation

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.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Museum of Archaeology & Anthropology All transferable skills in the university: computing Average on weekdays: 8947.04296875 kWh

Other talks

Feedback and the circumgalactic medium  Life, death, and the discovery of PDAR: the Pol II Degradation-dependent Apoptotic Response  Precarity and the economy of makeshifts: A novel argument from the census of England, 1851-1911 Geometry and Generalization: The case of Grokking Peri-Operative Medicine, and Obstetrics and Gynaecology Morning Tea and Coffee
 

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