Concept
Incidence matrix
Related lectures (57)
Graphs and Probabilities
Explores the connection between graphs and probabilities, emphasizing modular and super modular probabilities and correlation properties.
Pseudo Randomness in Graphs
Explores pseudo randomness in graphs using eigenvalues and polynomials, emphasizing the significance of bunched roots and common interlacers.
Link Prediction: Missing Edges and Probabilistic Methods
Explores link prediction in networks, covering missing edges, probabilistic methods, and causal inference challenges.
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Network Flows Meets Simplex
Explores network flows, simplex method, linear programming, tree solutions, and dual solutions in optimization problems.
Max-Flow Min-Cut
Explores the Ford Fulkerson algorithm, Max-Flow Min-Cut theorem, Incidence matrix, and network optimization complexity.
Graphical Models: Probability Distributions and Factor Graphs
Covers graphical models for probability distributions and factor graphs representation.
Statistical Analysis of Network Data
Introduces network data structures, models, and analysis techniques, emphasizing permutation invariance and Erdős-Rényi networks.
Spatial Response and Convolution
Covers the spatial response of systems, including the calculation of the center of mass and convolution.