Lecture

Network clustering

Related lectures (32)

Spectral Clustering: Theory and Applications

Explores spectral clustering theory, eigenvalue decomposition, Laplacian matrix, and practical applications in identifying clusters.

Graph Coloring: Random vs Symmetrical

Compares random and symmetrical graph coloring in terms of cluster colorability and equilibrium.

Graph Models and Brain Connectomics

Explores graph theory in brain connectomics, MRI applications, network analysis relevance, and individual fingerprinting.

Statistical analysis of network data

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

Matrices and Networks

Explores the application of matrices and eigendecompositions in networks.

Networks, Flows

Covers the definition of flow in a network and flow calculation.

Nonconvex Optimization: Challenges and Strategies

Explores nonconvex optimization challenges and strategies, including blind image deconvolution and SDP relaxations.

Sparsest Cut: ARV Theorem

Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.

Networked Control Systems: Laplacian Flow and Heat Equation

Explores Laplacian flow, heat equation analogies, and microgrid networked controllers.

Interlacing Families and Ramanujan Graphs

Explores interlacing families of polynomials and 1-sided Ramanujan graphs, focusing on their properties and construction methods.

Distances and Motif Counts

Explores distances on graphs, cut norms, spanning trees, blockmodels, metrics, norms, and ERGMs in network data analysis.

Semidefinite Programming: Formulations and Applications

Explores Semidefinite Programming formulations, SDP relaxations, and optimization strategies with convergence guarantees.

Non-parametric regression for networks

Explores non-parametric regression for networks, covering object data analysis, network graphs, extrinsic distances, and practical projections.

Neural Signals and Connectomes

Explores neural signals, connectomes, graph theory, and multi-voxel pattern analysis in fMRI trials.

Topology in Complex Networks: Insights from Topological Data Analysis

Explores the role of higher-order topological properties in complex networks using topological data analysis for structural break and price anomaly detection.

Statistical Analysis of Network Data

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

Fixed Points in Graph Theory

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

Spectral Graph Theory: Introduction

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

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Sparsest Cut and Concurrent Flow

Covers sparsest cut, NP-completeness, Bougains Theorem, and concurrent flow in graphs.