Lectures related to Handling Network Data

Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.

Covers graphical models for probabilistic distributions using graphs, nodes, and edges.

Covers the fundamentals of handling networks and centrality measures in graph theory.

Explores graph theory concepts, centrality measures, and real-world network properties, providing insights into handling diverse types of networks.

Covers graph properties, representations, and traversal algorithms using BFS and DFS.

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Explores scale-free networks, power laws, preferential attachment, and network assortativity.

Explores automorphisms of graphs, focusing on automorphism groups, Cayley-Abels graphs, and quasi-isometry.

Explores node degree and strength in network neuroscience, discussing random vs real networks and the challenges of fitting power laws to real data.

Explores automorphism groups in trees and graphs, focusing on ends and types of automorphisms.

Introduces Spectral Graph Theory, exploring eigenvalues and eigenvectors' role in graph properties.

Covers fundamental concepts in probabilities and statistics, including linear regression, exploratory statistics, and the analysis of probabilities.

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

Explores the role of graphs in deep learning, focusing on their structure, applications, and techniques for processing graph data.

Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.

Covers stochastic properties, network structures, models, statistics, centrality measures, and sampling methods in network data analysis.

Explores epidemics in network data, covering SIR model, basic reproductive ratio, percolation, directed networks, and maximum likelihood estimation.

Explores pseudorandomness theory, AI challenges, pseudo-random graphs, random walks, and matrix properties.

Covers the basics of graph algorithms, focusing on modeling and representation of graphs in memory.