Lecture

Higher-order Interactions in Brain Networks

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 concept of higher-order interactions in large-scale brain networks beyond pairwise interactions, using simplicial complexes to model social contagion and formalism. Examples include collaboration, gene-gene interactions, and neuronal interactions. The lecture delves into constructing simplicial complexes from data, distribution of k-simplices, and studying the human brain's structural connectome. It also covers information theory for higher-order interdependencies and the use of persistent homology in analyzing multivariate time series. The framework is tested on coupled map lattices, fMRI data, financial time-series, and infectious diseases data, showing the robustness of distinguishing different dynamical regimes.

Official source

Ontological neighbourhood

Mathematics

Topology: Algebraic topology

Related concepts (32)

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.

Simplicial homology

In algebraic topology, simplicial homology is the sequence of homology groups of a simplicial complex. It formalizes the idea of the number of holes of a given dimension in the complex. This generalizes the number of connected components (the case of dimension 0). Simplicial homology arose as a way to study topological spaces whose building blocks are n-simplices, the n-dimensional analogs of triangles. This includes a point (0-simplex), a line segment (1-simplex), a triangle (2-simplex) and a tetrahedron (3-simplex).

Simplicial complex

In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their n-dimensional counterparts (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an abstract simplicial complex. To distinguish a simplicial complex from an abstract simplicial complex, the former is often called a geometric simplicial complex.

Persistent homology

See homology for an introduction to the notation. Persistent homology is a method for computing topological features of a space at different spatial resolutions. More persistent features are detected over a wide range of spatial scales and are deemed more likely to represent true features of the underlying space rather than artifacts of sampling, noise, or particular choice of parameters. To find the persistent homology of a space, the space must first be represented as a simplicial complex.

Abstract simplicial complex

In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1).

Related lectures (64)

Simplicial and Singular Homology Equivalence

Demonstrates the equivalence between simplicial and singular homology, proving isomorphisms for finite s-complexes and discussing long exact sequences.

Simplicial Homology: Structure and Complexes

Covers the structure of topological spaces with A-complexes and chain complexes.

Data-Driven Modeling in Neuroscience: Meenakshi Khosla

By Meenakshi Khosla explores data-driven modeling in large-scale naturalistic neuroscience, focusing on brain activity representation and computational models.

Singular Homology: First Properties

Covers the first properties of singular homology and the preservation of decomposition and path-connected components in topological spaces.

Dynamic Functional Connectivity: Fundamentals