Determinants of Laplacians of converging surfaces

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

• Renan Gross (Tel Aviv)
• Tuesday 24 October 2023, 14:00-15:00
• MR12.

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

The “tree entropy” of a converging sequence of graphs roughly counts how many spanning trees per vertex each graph has, and can be calculated using the Laplacian of the graph.

In this talk, we will discuss a similar quantity for compact hyperbolic surfaces. We show that, under some assumptions on the eigenvalues and short geodesics, if a sequence of surfaces converges to a random rooted surface, then the logarithm of the determinant of its Laplacian converges to a constant. The proof involves analyzing the return density of Brownian motion to the origin, averaged over the entire surface.

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
• Probability
• School of Physical Sciences
• Statistical Laboratory info aggregator
• bld31

Note that ex-directory lists are not shown.