Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Topology in Complex Networks: Insights from Topological Data Analysis

Related lectures (32)

Explores Eulerian circuits through the Königsberg bridges problem, leading to the development of graph theory and topology.

Introduces the fundamentals of network science, focusing on brain networks and their historical breakthroughs.

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

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

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

Covers the Stochastic Block Model and its application in community detection, exploring its mathematical formulation and challenges.

Explores knowledge inference for graphs, discussing label propagation, optimization objectives, and probabilistic behavior.

Explores dynamic programming strategies for finding shortest paths in networks with various algorithms and complexities.

Covers the topology of Riemann surfaces and the concept of triangulation using finitely many triangles.

Explores coordination in networked control systems, graph theory, and consensus algorithms.

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

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

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

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

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

Explains the concept of trees in graph theory and the definition of a spanning tree.

Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.

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

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

Page 1 of 2