University of Cambridge > Talks.cam > Probability > Determinants of Laplacians of converging surfaces

  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

Determinants of Laplacians of converging surfaces

Download to your calendar using vCal

  • UserRenan Gross (Tel Aviv)
  • ClockTuesday 24 October 2023, 14:00-15:00
  • HouseMR12.

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:

Note that ex-directory lists are not shown.

Other lists

Lightfoot Room, Old Divinity School, St John’s College Average on weekdays: 9040.98046875 kWh Cambridge Climate Lecture Series

Other talks

Cambridge RNA Club - ONLINE CodeScaler: Scaling Code LLM Training and Test-Time Inference via Execution-Free Reward Models RNA-Mediated Regulation of Germinal Centre B-Cell Fitness: a tale of two DEAD-box RNA helicases Whose Egypt? Community Stewardship and the Politics of Museum Interpretation Fairy Tales Tissue-scale communication in cancer development
 

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