University of Cambridge > Talks.cam > Discrete Analysis Seminar > Spectral expansion in random regular graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Spectral expansion in random regular graphs

Download to your calendar using vCal

  • UserEwan Cassidy (University of Cambridge)
  • ClockWednesday 05 November 2025, 13:30-14:30
  • HouseMR4, CMS.

If you have a question about this talk, please contact Julia Wolf .

Fixed-degree expanders are sparse yet highly connected graphs. This quality is captured by their spectral gap—the difference between the largest and second largest eigenvalues of their adjacency matrix. A celebrated result of Friedman states that a random d-regular graph on n vertices is a near-optimal expander with high probability. I will discuss a generalization of this result to a regime where the number of vertices grows quasi-exponentially in n. The proof draws on ideas from representation theory and considerations of word maps on the symmetric group.

This talk is part of the Discrete Analysis Seminar series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

eng-cv-seminars-request@lists.cam.ac.uk Booking Required - Computing/IT Courses at the CMS Engineering Department, Baker Building (5th floor), MIL meeting room

Other talks

Title to be confirmed Formal Dinner at Selwyn College Title to be confirmed Task performance predicts the substitution of feedforward by feedback drive in visual cortex Optimal metric and approximation of free boundary minimal surfaces Online Causal Inference Seminar
 

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