University of Cambridge > Talks.cam > Cambridge Analysts' Knowledge Exchange > Asymptotic number of connected components of nodal sets of random functions

Asymptotic number of connected components of nodal sets of random functions

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

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

Abstract. Consider a random smooth (Gaussian) field and associate to it its (zero level) nodal set i.e. all points that map to zero. Many questions can be asked about these nodal sets: total surface measure, number of connected components, percolative properties, etc. The focus of the talk will be to address the second question and explain Nazarov and Sodin’s proof (2016) of a corresponding law of large numbers. I will also (briefly) link the random theory to the deterministic problem of understanding the nodal sets associated to the eigenfunctions of the Laplace operator.

This talk is part of the Cambridge Analysts' Knowledge Exchange series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

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