3 papers
math.PR2025
Expected Length of the Euclidean Minimum Spanning Tree and 1-norms of Chromatic Persistence Diagrams in the Plane
Ondřej Draganov, Herbert Edelsbrunner, Sophie Rosenmeier +1
Let be the constant such that the expected length of the Euclidean minimum spanning tree of random points in the unit square is in the limit, when goes to…
math.MG2025
Gromov-Hausdorff distance between chromatic metric pairs and stability of the six-pack
Ondřej Draganov, Sophie Rosenmeier, Nicolò Zava
Chromatic metric pairs consist of a metric space and a coloring function partitioning a subset thereof into various colors. It is a natural extension of the notion of chromatic poi…
cs.CL2024
The Shape of Word Embeddings: Quantifying Non-Isometry With Topological Data Analysis
Ondřej Draganov, Steven Skiena
Word embeddings represent language vocabularies as clouds of -dimensional points. We investigate how information is conveyed by the general shape of these clouds, instead of rep…