Javascript must be enabled

Duncan Dauvergne : Random planar geometry and the Kardar-Parisi-Zhang universality class

Consider the lattice Z^2, and assign length 1 or 2 to every edge by flipping a series of independent fair coins. This gives a random weighted graph, and looking at distances in this graph gives a random planar metric. This model is expected to have a continuum scaling limit as we decrease the spacing between lattice points. Moreover, most natural models of random planar metrics and random interface growth (the so-called `KPZ universality class') are expected to converge to the same limiting geometry. The goal of this talk is to introduce this limit, known as the directed landscape, and describe at least one model where we can actually prove convergence.

Please select playlist name from following

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.


Comments Disabled For This Video