Topological Flow Matching: A Generative Modeling Framework for Structured Spaces
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Paper speeds up topological signal identification and cycle matching.
Proposes TSBP for matching topological signal distributions.
New model for shape graph registration with partial matching constraints.
Efficiently matches subgraphs in noisy data without node labels.
New method for partial matching of shapes with Varifolds.
New technique connects graph matching complexes to Morse theory for better topology understanding.
Minimal surfaces match symmetries and topology exactly.
Piecewise normalizing flows improve multi-modal distribution modeling.
Detect anomalies in complex networks using topological subspace detectors.
The paper introduces a quantum state system to count perfect matchings in graphs.
This paper studies the problem of error-runtime trade-off, typically encountered in decentralized training based on stochastic gradient descent (SGD) using a given network. While a denser (sparser) network topology results in faster (slower) error convergence in terms of iterations, it incurs more (less) communication …
Match van Stockum dust to vacuum metrics with a single parameter.
Power series invariant of hyperbolic 3-manifolds matches knot invariants.
PHINN: A generative model for rare-event time series using persistent homology
We give a solution to a part of Problem 1.60 in Kirby's list of open problems in topology thus answering in the positive the 1987 conjecture by J.Przytycki concerning the existence of knots without matched diagrams.
Researchers use discrete Morse theory to improve the topology of matching complexes of complete graphs.
We present a complete acyclic matching of the Hasse diagram associated with the face lattice of a hypersimplex. Since a hypersimplex is a convex polytope, there is a natural way to form a CW complex from its faces. We will then utilize this matching along with discrete Morse theory and some topological techniques to cl…
This paper puts forth a new formulation and algorithm for the elastic matching problem on unparametrized curves and surfaces. Our approach combines the frameworks of square root normal fields and varifold fidelity metrics into a novel framework, which has several potential advantages over previous works. First, our var…
We establish a compact analog of the P = W conjecture. For a holomorphic symplectic variety with a Lagrangian fibration, we show that the perverse numbers associated with the fibration match perfectly with the Hodge numbers of the total space. This builds a new connection between the topology of Lagrangian fibrations a…
A new method compares persistent cycles in topological data.
The paper shows how to rearrange arcs to form closed curves.
Prime Match protects client stock trades from market price manipulation.
A novel Gromov-Wasserstein learning framework is proposed to jointly match (align) graphs and learn embedding vectors for the associated graph nodes. Using Gromov-Wasserstein discrepancy, we measure the dissimilarity between two graphs and find their correspondence, according to the learned optimal transport. The node …
Paper identifies tensor ranks via prior predictive matching, solving system of equations.
We study how a gluing construction, which produces compact manifolds with holonomy G_2 from matching pairs of asymptotically cylindrical G_2-manifolds, behaves under deformations. We show that the gluing construction defines a smooth map from a moduli space of gluing data to the moduli space of torsion-free G_2-structu…
This work introduces novel methods to identify and compare cycles across topological objects.
We consider two well known constructions of link invariants. One uses skein theory: you resolve each crossing of the link as a linear combination of things that don't cross, until you eventually get a linear combination of links with no crossings, which you turn into a polynomial. The other uses quantum groups: you con…
We study the twisted index of 4d = 2 class S theories on a closed hyperbolic 3-manifold . Via 6d picture, the index can be written in terms of topological invariants called analytic torsions twisted by irreducible flat connections on the 3-manifold. Using the topological expression, we determine the …
A quantum field theory for Spin(7)-instantons derived from moduli spaces.
New method identifies vanishing arcs for curve singularities.
Constructing VAE Latent Spaces with Prescribed Topology
Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex , from which topological and geometrical informations of can be efficiently computed, in particular its homology or Morse-Smale d…
We study conditions on the topological D-branes of types A and B obtained by requiring a proper matching of the spectral flow operators on the boundary. These conditions ensure space-time supersymmetry and stability of D-branes. In most cases, we reproduce the results of Marino-Minasian-Moore-Strominger, who studied th…
New condition prevents hyperbolic spaces from matching curve complexes.
A new numerical framework simplifies elastic surface matching and comparison.
Topology-based information retrieval improves query accuracy.
This work incorporates topological features via persistence diagrams to classify point cloud data arising from materials science. Persistence diagrams are multisets summarizing the connectedness and holes of given data. A new distance on the space of persistence diagrams generates relevant input features for a classifi…
Researchers analyze geodesic complexity in robot paths on tree graphs.
This paper refines understanding of decentralized learning by considering graph topology.
FAST selects coresets more efficiently by matching distributions in the frequency domain.
We study 1-parameter families of holomorphic curves with Lagrangian boundary in Calabi-Yau 3-folds. We show that the expected codimension one phenomena can be organized to match the HOMFLYPT skein relations from quantum topology. It follows that counting holomorphic curves by the class of their boundaries in the skein …
We consider the connected-sum method of constructing compact Riemannian 7-manifolds with holonomy G_2 developed in math.DG/0012189. The method requires pairs of projective complex threefolds endowed with anticanonical K3 divisors, the latter `matching' via a certain non-holomorphic map. Suitable examples of threefolds …
We propose the labeled Čech complex, the plain labeled Vietoris-Rips complex, and the locally scaled labeled Vietoris-Rips complex to perform persistent homology inference of decision boundaries in classification tasks. We provide theoretical conditions and analysis for recovering the homology of a decision boundary fr…
In this article we show that every closed oriented smooth 4-manifold can be decomposed into two codimension zero submanifolds (one with reversed orientation) so that both pieces are exact Kahler manifolds with strictly pseudoconvex boundaries and that induced contact structures on the common boundary are isotopic. Mean…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our measure will depend on the topology of the space, but also on how nicely the spa…
The manifold hypothesis states that many kinds of high-dimensional data are concentrated near a low-dimensional manifold. If the topology of this data manifold is non-trivial, a continuous encoder network cannot embed it in a one-to-one manner without creating holes of low density in the latent space. This is at odds w…
New categorical actions link topological and algebraic structures.