Tom Needham

Exploring optimal transport with constraints for effective resource movement.

A new framework blends TDA and optimal transport for matching data structures.

This study reveals the properties and applications of normal matrices and balanced graphs.

This study introduces a novel approach to dimension reduction using semi-relaxed Gromov-Wasserstein distance.

A new method for comparing complex data structures in graphs and networks.

Explore how partitioned networks help us understand various complex relationships.

An overview of relaxed Gromov-Wasserstein distances and their applications.

Learn how LOT and Wasserstein distances make data analysis easier and more effective.

A study of hypergraphs offers new ways to measure complex relationships.