
Explore symmetric matrix signings, their spectral aspects, and applications in graph theory, polynomial identity testing, and algorithmic problems.

Explore eigenvalues of the Laplacian and Markov operator in spectral graph theory, including associated formulas and their applications in theoretical computer science research.

Explore spectral graph theory, focusing on minimizing and maximizing quadratic forms, with connections to graph components and bipartiteness in this graduate-level lecture.

Explores spectral graph theory, focusing on the quadratic form associated with undirected graphs. Covers basic setup and provides examples for graduate-level computer science research.

Explore spectral graph theory, covering self-adjoint matrices, Rayleigh equalities, graph isomorphism, Cayley graphs, and automorphism groups. Gain insights into complex systems and network analysis.

Explore high-dimensional expanders with Irit Dinur, delving into advanced concepts in analysis and theoretical computer science.

Explore advanced concepts in high-dimensional expanders, focusing on analysis techniques and applications in theoretical computer science.

Explore advanced concepts in high-dimensional expanders, focusing on analysis techniques and applications in theoretical computer science.

Explore fundamental concepts of graph linear algebra, focusing on matrices, spectral theory, and their applications in algorithmic graph theory and network analysis.

Explore advanced graph linear algebra concepts and optimization techniques for fast algorithms in data structures, building on previous parts.

Explore advanced concepts in graph linear algebra, focusing on data structures and optimization techniques for developing efficient algorithms.

Explore a novel approach to strong convergence in graph theory, addressing Alon's conjecture and extending Friedman's theorem with applications to random graphs, geometry, and operator algebras.

Explore expanders and property testing in graph theory, focusing on their applications and connections to theoretical computer science.

Explore Fiedler vector perturbation and its applications in graph measures and shape analysis, gaining insights into advanced mathematical concepts.

Explore multiscale basis dictionaries and scattering networks on simplicial complexes, focusing on HGLET and GHWT. Learn applications in coauthorship/citation complex and article classification.

Explore online algorithms for spectral hypergraph sparsification, focusing on space-efficient methods for handling streaming hyperedges and producing accurate sparsifiers.

Explore Ramanujan Graphs, interlacing families, and their connections to various mathematical fields. Gain insights into recent developments and open problems in graph theory.

Explore discrete analogues of Kac's question on "hearing the shape of a drum" and learn about graphs determined by their spectrum in this mathematical seminar.

Explore Reidemeister and analytic torsions on finite digraphs using path homology theory. Learn about Hodge Laplace operators, torsion identities, and formulas for Cartesian products and joins.

Explore equiangular lines in high dimensions, solving a longstanding problem using spectral graph theory and discussing future research directions.

Delve into quantum Heisenberg models and their connection to Max-Cut problems, exploring theoretical frameworks and approximation algorithms for Quantum Max-d-Cut Hamiltonians in computational physics.