Lecture

Topology in Complex Networks: Insights from Topological Data Analysis

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Description

This lecture explores the role of higher-order topological properties in the functionality of complex networks. It introduces topological data analysis (TDA) as a methodology to infer geometric and topological structures directly from data, enhancing our understanding of complex systems. The lecture covers the use of TDA for structural break detection and price anomaly detection in time series and dynamic networks. It delves into the concept of persistent homology, which studies data shape through a multi-resolution view of nested simplicial complexes. The application of TDA in Ethereum blockchain networks is also discussed, focusing on anomaly detection and price forecasting. Collaborative research efforts and future directions in statistical inference for TDA are highlighted.

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (32)

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Topological data analysis

In applied mathematics, topological data analysis (TDA) is an approach to the analysis of datasets using techniques from topology. Extraction of information from datasets that are high-dimensional, incomplete and noisy is generally challenging. TDA provides a general framework to analyze such data in a manner that is insensitive to the particular metric chosen and provides dimensionality reduction and robustness to noise. Beyond this, it inherits functoriality, a fundamental concept of modern mathematics, from its topological nature, which allows it to adapt to new mathematical tools.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Related lectures (64)

Geometry: Eulerian Circuits

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

Networks, Flows MOOC: Optimization: principles and algorithms - Network and discrete optimization

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

Introduction to Networks and Brain Networks

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

Non-parametric regression for networks

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

Statistical analysis of network data

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