Lecture

Ramanujan Graphs: Constructions and Similarities

Description

This lecture covers the constructions and similarities of Ramanujan graphs, focusing on the matching polynomials and perfect matchings. The instructor explains the building methods and the high probability choices involved. The lecture also delves into the differences between group theory and Ramanujan graphs, highlighting open problems in the field. Additionally, the concept of random walks on universal covers is discussed, along with the theory of expected characteristic polynomials. The lecture concludes with a detailed exploration of quantitation and qualitative aspects, emphasizing the challenges and functions related to soft matrices and root calculations.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.