Pseudorandomness: Theory and Applications

Related lectures (46)

Explores pseudo randomness in graphs using eigenvalues and polynomials, emphasizing the significance of bunched roots and common interlacers.

Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.

Introduces the basics of graphs and networks, covering definitions, paths, trees, flows, circulation, and spanning trees.

Explores the connection between graphs and probabilities, emphasizing modular and super modular probabilities and correlation properties.

Explores the convergence of random walks on graphs and the properties of weighted adjacency matrices.

Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.

Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.

Focuses on open problems and the importance of reformulating problems with better tools and intuition.

Explores characteristic polynomials, similarity of matrices, and eigenvalues in linear transformations.

Covers the calculation of determinants and Cramer's rule for matrix invertibility.

Introduces algebraic properties, vector equations, and matrix operations.

Covers the Weil representation, Heisenberg group actions, and symplectic group concepts.

Covers Cramer's Rule, matrix inverse, determinants, and volume in linear algebra.

Explores radiation, sound waves, color perception, and luminous flux characterization.

Covers proper values and eigenvectors in matrices, focusing on finding counter-examples.

Covers the key concepts of Principal Component Analysis (PCA) and its practical applications in data dimensionality reduction and feature extraction.

Introduces real analysis basics, including functions, sequences, limits, and set properties in R.

Explores Schur's lemma and its applications in representations of an associative algebra over an algebraically closed field.

Explores convex sets, their properties, and applications in optimization.

Explores Wedderburn's theorem, group algebras, and Maschke's theorem in the context of finite dimensional simple algebras and their endomorphisms.

Page 2 of 3