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.

169,181 papers · 148 categories

Trend · papers per month

6.3%12.5%18.8%25.0% · Jul 199319922001200920182026
48 results for link persistence

New models for graph sequences capture link and community persistence.

problem Difficulties in extending block model results to graph sequences.
method Two models for graph sequences capturing link and community persistence, with efficient inference algorithms.
result Validated suitability of proposed models and methods on synthetic and real instances.

PHLP uses persistent homology to interpret graph link prediction.

problem Interpreting why graph neural network models perform well in link prediction.
method Employing persistent homology to analyze graph topology and extract features.
result PHLP outperforms state-of-the-art models on most benchmark datasets.

New obstructions for embedding one compact oriented 3-manifold in another are given. A theorem of D. Krebes concerning 4-tangles embedded in links arises as a special case. Algebraic and skein-theoretic generalizations for 2n-tangles provide invariants that persist in the corresponding invariants of links in which they…

2004-05-24abs ↗pdf ↗

Study cosmic structures using Topological Data Analysis and Persistence Energy.

problem Investigate cosmic web evolution in ΛΛCDM cosmologies.
method Apply LITE method to embed persistence diagrams into vector spaces and analyze cosmic structures.
result Discover a correlation between Persistence Energy and redshift values.

Persistent homology reveals geometric features of metric spaces, especially geodesic circles.

problem Detecting geometric features in metric spaces using persistent homology.
method Analyzing algebraic elements (footprints) in persistent homology of metric spaces and subspace.
result Higher-dimensional persistent homology captures lower-dimensional geometric features.

This review explores TDA and TDL beyond persistent homology.

problem Limitations of persistent homology in capturing topological invariants and homotopic evolution.
method Spectral representations, sheaf theory, Mayer topology, interaction topology, differential topology, geometric topology.
result Review of topological tools for various data types.

We consider knots whose diagrams have a high amount of twisting of multiple strands. By encircling twists on multiple strands with unknotted curves, we obtain a link called a generalized augmented link. Dehn filling this link gives the original knot. We classify those generalized augmented links that are Seifert fibere…

2009-06-24abs ↗pdf ↗

Following the suggestion of arXiv:1407.6319 to lift the knot polynomials for virtual knots and links from Jones to HOMFLY, we apply the evolution method to calculate them for an infinite series of twist-like virtual knots and antiparallel 2-strand links. Within this family one can check topological invariance and under…

2014-11-10abs ↗pdf ↗

TabPFN's internal geometry topology correlates with dataset reliability.

problem Understanding TabPFN's behavior on structurally difficult tabular geometries.
method Using zigzag persistent homology, studying TabPFN's internal representations on synthetic tabular tasks with known topology.
result Topology of TabPFN's internal representation geometry is strongly associated with dataset-level reliability.

Classifies LL-space surgeries on all two-bridge links

problem Classifying LL-space surgeries on two-bridge links
method Introduces a sufficient diagrammatic condition for links in S3S^3 to be persistently foliar, defines a simplified model for Heegaard Floer homology, and uses Turaev torsions for computations
result Determines LL-space surgeries in the case of generalised LL-space links

Persistence landscapes map diagrams into function spaces for statistical and machine learning applications.

problem Mapping persistence diagrams into function spaces for statistical and machine learning.
method Introducing persistence landscapes, weighted persistence landscapes, and Poisson-weighted persistence landscape kernels.
result Persistence landscapes allow for the application of statistical and machine learning tools, and are stable and invertible.

Dynamic network model forecasts interbank market link formation.

problem Forecasting interbank market link formation with time-varying topologies.
method Dynamic network model with past link existence and node-specific latent variables. Markov dynamics and EM algorithm for estimation.
result Forecasting future link presence and recognition of preferential lending.

Study shows social reinforcement learning can lead to persistent but metastable polarization.

problem Understanding the persistence and dynamics of opinion polarization.
method Simulation and mathematical analysis of a reinforcement learning model of opinion dynamics.
result Polarization observed in the model is metastable and will eventually lead to consensus.

Study shows how sentiment shocks affect equity markets, revealing asymmetries and state-dependent effects.

problem Understanding how sentiment shocks propagate through equity markets and their impact on different investor groups.
method Used four independent proxies with sign-aligned kappa-rho parameters, calibrated a structural model to link sentiment to returns.
result A one standard deviation sentiment shock has a 1.06 basis point impact, with effects amplified over 11.2 months and concentrated in retail-tilted stocks.

Study on Vietoris-Rips complexes of regular polygons, revealing complex homotopy types.

problem Understanding the homotopy types and persistent homology of Vietoris-Rips complexes of regular polygons.
method Use of persistent homology, cyclic graphs, and winding fractions.
result Characterization of homotopy types and persistent homology of Vietoris-Rips complexes of PnP_n up to a scale parameter.

Proposes deep graph persistence to address neural persistence issues in deep learning.

problem Variance of weights and lack of spatial structure in deep neural networks impact neural persistence.
method Extends neural persistence to the whole network, considering interactions between layers.
result Deep graph persistence alleviates variance-related issues and captures persistent paths through the network.

This paper demonstrates the flaws of co-persistence theory proposed by Bollerslev and Engle (1993) which cause the theory can hardly be applied. With the introduction of the half-life of decay coefficient as the measure of the persistence, and both the weak definition of persistence and co-persistence in variance, this…

2011-12-06abs ↗pdf ↗

Optimizes wavelets for graph classification using spectral wavelet signatures and persistence diagrams.

problem Graph classification with geometric properties encoded in persistence diagrams.
method Optimizes spectral wavelets for graph datasets to capture best-suited features for classification.
result Competitive performance in graph classification problems compared to other persistence-based architectures.

This paper interprets critical scales in persistent homology for compact metric spaces.

problem Understanding critical scales in persistent homology for general compact metric spaces.
method Analyzing local minima of the distance function and their impact on persistence.
result Each decrease in zero-dimensional persistence and increase in one-dimensional persistence is induced by local minima of the distance function.

Introduces a new space of Radon measures for better understanding persistence diagrams.

problem Lack of optimal transport-based formalism for persistence diagrams.
method Formalizes persistence diagrams as Radon measures on the upper half plane via optimal partial transport.
result Characterizes convergence and barycenters of persistence diagrams.

The interbank market has a natural multiplex network representation. We employ a unique database of supervisory reports of Italian banks to the Banca d'Italia that includes all bilateral exposures broken down by maturity and by the secured and unsecured nature of the contract. We find that layers have different topolog…

2013-11-19abs ↗pdf ↗

MuRiT efficiently computes multi-parameter persistence barcodes.

problem Efficient computation of multi-parameter persistent homology.
method Vietoris-Rips transformation to reduce multi-parameter to single-parameter computation.
result MuRiT computes pathwise persistence barcodes for multi-filtered flag complexes.

Study on embedding persistence diagrams into Hilbert spaces, focusing on metric distortion.

problem Understanding metric properties of persistence diagrams in Hilbert spaces.
method Investigate embedding persistence diagrams into separable Hilbert spaces using bi-Lipschitz maps.
result Impossible to find a bi-Lipschitz embedding into finite-dimensional Hilbert spaces.

This article analyzes the relationship between co-persistence and hedging which indicates co-persistence ratio is just the long-term hedging ratio. The new method of exhaustive search algorithm for deriving co-persistence ratio is derived in the article. And we also develop a new hedging strategy of combining co-persis…

2011-12-17abs ↗pdf ↗

The paper studies geometric properties of geodesic spaces using Rips and Čech filtrations.

problem Understanding geometric properties of geodesic spaces.
method Applying fundamental group and homology groups to Rips or Čech filtrations.
result Rips critical points correspond to circles of specific lengths and persistence encodes space properties.

A new approach to reinforcement learning improves policy performance by adjusting control frequency.

problem Improving reinforcement learning performance by optimizing control frequency.
method Introducing action persistence and a novel algorithm, PFQI, to learn optimal value function at a given persistence.
result PFQI effectively learns optimal value function with action persistence, improving reinforcement learning performance.

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.

Improved persistence spheres map measures to functions, stable under partial transport.

problem Representing and comparing measures in topological machine learning.
method Persistence spheres map measures to continuous functions on the sphere, stable under 1-Wasserstein partial transport.
result Persistence spheres provide a stable, parameter-free representation of measures, improving upon existing methods.