Lecture

Ramanujan Graphs: Generating Functions and Expander Graphs

Description

This lecture covers the importance of Ramanujan graphs, focusing on mathematical patterns, generating functions, and the concept of non-backtracking walks. It explores the building blocks of cycles and ways of combining nodes, as well as the behavior of graphs on expander graphs. The instructor discusses the relationship between Ramanujan graphs and certain NP-hard problems, highlighting their solvability on expander graphs. The lecture also delves into the concept of belief negotiation and coding theory, emphasizing the significance of expanders as worst-case scenarios for embedding. Additionally, it touches on the continuous and discrete distance properties of graphs.

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.