Concept
Adjacency matrix
Related lectures (114)
Graphs and Probabilities
Explores the connection between graphs and probabilities, emphasizing modular and super modular probabilities and correlation properties.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Networked Control Systems: Consensus Algorithms in Digraphs
Explores consensus algorithms in digraphs, focusing on scenarios where the digraph is not strongly connected.
Link Prediction: Missing Edges and Probabilistic Methods
Explores link prediction in networks, covering missing edges, probabilistic methods, and causal inference challenges.
Spatial Response and Convolution
Covers the spatial response of systems, including the calculation of the center of mass and convolution.
Science-fiction: Hybridity
Delves into hybridity in science-fiction, exploring space opera and science-fantasy themes like hard science and cyberpunk.
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.
Asymptotic States and S-matrix
Covers the concept of asymptotic states and S-matrix in quantum field theory, focusing on the evolution of wave packets and the scattering states.
Networked Control Systems: Laplacian Matrix and Consensus
Explores the Laplacian matrix and consensus in networked control systems.