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

Lecture

Graph Alignment: Wasserstein-based

Description

This lecture covers the challenges in comparing non-Euclidean data such as social, functional, and economic networks, emphasizing the importance of topology. The instructor proposes a solution using Laplacian matrices for graph alignment, discussing the limitations of existing methods. The lecture explores optimal transport for graph distance computation, graph signal prediction, and the GOT algorithm for graph alignment optimization. It delves into the optimization difficulties and stochastic exploration techniques, concluding with experiments on graph classification and the significance of optimal transport in capturing structural information and transferring signals between graphs.

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.

Laplacian matrix

In the mathematical field of graph theory, the Laplacian matrix, also called the graph Laplacian, admittance matrix, Kirchhoff matrix or discrete Laplacian, is a matrix representation of a graph. Named after Pierre-Simon Laplace, the graph Laplacian matrix can be viewed as a matrix form of the negative discrete Laplace operator on a graph approximating the negative continuous Laplacian obtained by the finite difference method. The Laplacian matrix relates to many useful properties of a graph.

Line graph

In the mathematical discipline of graph theory, the line graph of an undirected graph G is another graph L(G) that represents the adjacencies between edges of G. L(G) is constructed in the following way: for each edge in G, make a vertex in L(G); for every two edges in G that have a vertex in common, make an edge between their corresponding vertices in L(G). The name line graph comes from a paper by although both and used the construction before this.

Graph database

A graph database (GDB) is a database that uses graph structures for semantic queries with nodes, edges, and properties to represent and store data. A key concept of the system is the graph (or edge or relationship). The graph relates the data items in the store to a collection of nodes and edges, the edges representing the relationships between the nodes. The relationships allow data in the store to be linked together directly and, in many cases, retrieved with one operation.

Final topology

In general topology and related areas of mathematics, the final topology (or coinduced, strong, colimit, or inductive topology) on a set with respect to a family of functions from topological spaces into is the finest topology on that makes all those functions continuous. The quotient topology on a quotient space is a final topology, with respect to a single surjective function, namely the quotient map. The disjoint union topology is the final topology with respect to the inclusion maps.

Related lectures (34)

Graph Algorithms: Modeling and Traversal

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

Topology of Riemann Surfaces

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

Topologie: Attachment Applications

Covers exercises on attaching 1-cells to intervals in topology.