Explicit Near-Fully X-Ramanujan Graphs

Explicit Near-Fully X-Ramanujan Graphs

IEEE FOCS: Foundations of Computer Science via YouTube Direct link

Approach: finite permutations

8 of 11

8 of 11

Approach: finite permutations

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Explicit Near-Fully X-Ramanujan Graphs

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Ramanujan graphs: Finite graphs which resemble infinite graphs
  3. 3 Random finite graphs which resemble infinite graphs
  4. 4 Beyond d-regular trees
  5. 5 Spectrally resembling infinite graphs
  6. 6 Adjacency matrix
  7. 7 Consider the formal polynomial
  8. 8 Approach: finite permutations
  9. 9 Matrix-weighted polynomials
  10. 10 Our results
  11. 11 Open problems

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.