Research
On-device research index

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.

168,742 papers · 148 categories

Trend · papers per month

61122183244 · May 202619922001200920172026
48 results for topology matching

New model for shape graph registration with partial matching constraints.

problem Shape graph registration with topological inconsistencies and partial matching.
method Higher order invariant Sobolev metrics, varifolds, inexact variational formulation, SFISTA algorithm.
result Existence of minimizers for variational problem with TV regularization.

New technique connects graph matching complexes to Morse theory for better topology understanding.

problem Understanding the topology of matching complexes of complete graphs.
method Developed discrete Morse theory technique to analyze MnM_n.
result Showed MnM_n is geometrically (νn1)(ν_n-1)-connected, improving on previous homotopical results.

Detect anomalies in complex networks using topological subspace detectors.

problem Detect anomalies in complex networks defined by simplicial complexes.
method Formulate a hypothesis testing framework using Neyman-Pearson matched topological subspace detectors.
result Effective detection of anomalies in foreign currency exchange networks and other real-world data.

Match van Stockum dust to vacuum metrics with a single parameter.

problem Matching van Stockum dust to vacuum metrics.
method 1-parametric family of non-static Papapetrou vacuum metrics, Ehlers and Kramer--Neugebauer transformations.
result Explicit examples of matching, including Bonnor metric and Lanczos--van Stockum dust metric.

Power series invariant of hyperbolic 3-manifolds matches knot invariants.

problem Understanding topological invariants of hyperbolic 3-manifolds.
method Perturbative power series associated with ideally triangulated cusped hyperbolic 3-manifolds.
result The power series agrees with Kashaev and Andersen-Kashaev invariants to all orders.

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.

2011-05-06abs ↗pdf ↗

Researchers use discrete Morse theory to improve the topology of matching complexes of complete graphs.

problem Understanding the topology of matching complexes of complete graphs, especially for small n.
method Developed gradient vector fields to simplify the computation of homology groups.
result Computed the homology groups of M7M_7 efficiently and conjectured an optimal gradient vector field.

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…

2011-08-30abs ↗pdf ↗

A new method compares persistent cycles in topological data.

problem Comparing persistent homology representations of two spaces.
method Direct comparison of individual persistent cycles based on persistence intervals and spatial placement.
result Demonstrated the effectiveness of the method in topological inference.

Prime Match protects client stock trades from market price manipulation.

problem Protecting client stock trades from market price manipulation.
method Prime Match uses a two-round secure linear comparison protocol to match orders without revealing information.
result Prime Match reduces market impact and maintains client privacy.

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 …

2019-01-17abs ↗pdf ↗

Paper identifies tensor ranks via prior predictive matching, solving system of equations.

problem Determining the latent dimensions (ranks) in tensor factorization models.
method Prior predictive moment matching to transform moment matching conditions into a log-linear system of equations.
result Identifies which tensor models have identifiable ranks and derives rank estimators.

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…

2008-09-24abs ↗pdf ↗

This work introduces novel methods to identify and compare cycles across topological objects.

problem Identifying and comparing topological features, particularly cycles, across different topological objects.
method Two complementary approaches: dendrogram-based merge-tree algorithms and Stratified Gradient Sampling.
result Transformed cycle matching into hierarchical clustering and topological optimization framework.

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…

2010-02-02abs ↗pdf ↗

A quantum field theory for Spin(7)-instantons derived from moduli spaces.

problem Constructing a topological quantum field theory for Spin(7)-instantons.
method Using Mathai-Quillen formalism and AKSZ formalism, we derive the action and Batalin-Vilkovisky action.
result The Batalin-Vilkovisky action matches the Mathai-Quillen construction and provides a framework for classical observables.

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 CC, from which topological and geometrical informations of CC can be efficiently computed, in particular its homology or Morse-Smale d…

2018-01-30abs ↗pdf ↗

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…

2003-11-12abs ↗pdf ↗

A new numerical framework simplifies elastic surface matching and comparison.

problem Challenging problem in surface comparison and matching in computer vision.
method Relaxing the geodesic boundary constraint using a varifold fidelity metric.
result Flexibility to deal with arbitrary topologies and sampling patterns, scalability to large meshes.

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…

2018-12-04abs ↗pdf ↗

Researchers analyze geodesic complexity in robot paths on tree graphs.

problem Understanding optimal paths for robots on tree graphs.
method Examined geodesic complexity in ordered and unordered configuration spaces of graphs in 1\ell_1 and 2\ell_2 metrics, finding explicit geodesics and families.
result Geodesic complexity matches topological complexity in all cases studied.

This paper refines understanding of decentralized learning by considering graph topology.

problem Current theory fails to predict performance in decentralized learning settings.
method Quantifies how graph topology influences convergence in decentralized learning.
result Graph topology significantly impacts convergence in decentralized learning, contrary to spectral gap theory.

FAST selects coresets more efficiently by matching distributions in the frequency domain.

problem Efficiently selecting representative subsets of large datasets for deep learning.
method FAST uses spectral graph theory and CFD to match distributions, addressing limitations of existing methods.
result FAST significantly outperforms state-of-the-art coreset selection methods in accuracy and energy efficiency.

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 …

2019-01-23abs ↗pdf ↗

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…

2006-01-17abs ↗pdf ↗

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…

2013-03-26abs ↗pdf ↗

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…

2018-07-12abs ↗pdf ↗