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,657 papers · 148 categories

Trend · papers per month

36811 · Oct 201919922001200920172026
48 results for Rips filtrations

Generalizes Rips' result on hyperbolic spaces to metric spaces, showing collapses for tree metrics.

problem Understanding the contractibility of Vietoris-Rips complexes in metric spaces.
method Extending Rips' result using geodesic defect and apparent pairs gradient.
result Vietoris-Rips complexes collapse to subforests for finite tree metrics.

Using ideas of the Dowker duality we prove that the Rips complex at scale rr is homotopy equivalent to the nerve of a cover consisting of sets of prescribed diameter. We then develop a functorial version of the Nerve theorem coupled with the Dowker duality, which is presented as a Functorial Dowker-Nerve Diagram. Thes…

2019-06-10abs ↗pdf ↗

Given a compact geodesic space XX we apply the fundamental group and alternatively the first homology group functor to the corresponding Rips or Čech filtration of XX to obtain what we call a persistence. This paper contains the theory describing such persistence: properties of the set of critical points, their preci…

2017-09-15abs ↗pdf ↗

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.

Unified probabilistic foundation for fuzzy simplicial sets in dimensionality reduction.

problem Lack of clear probabilistic interpretation in fuzzy simplicial sets.
method Introducing a probabilistic framework explaining fuzzy simplicial sets as marginals of probability measures on simplicial sets.
result Unified probabilistic theoretical foundation for fuzzy simplicial sets.

Unified pipeline classifies time series using complex networks and persistent homology.

problem Classifying univariate time series using various graph constructions and metrics.
method Time series to graph, graph to dissimilarity matrix, filtration to persistence diagrams, vectorization to features.
result Persistence-based features are robust to noise and optimal graph type depends on signal structure.

An algorithm preserves topological features in dimensionality reduction.

problem Preserving topological features in dimensionality reduction.
method Simulated annealing for finding a linear projection preserving persistent homology.
result Measures of topological equivalence between filtrations.

This paper classifies planar-Rips complexes and their unit disk graphs up to homotopy.

problem Classifying planar-Rips complexes and their unit disk graphs.
method Simplicial classification, homotopy equivalence, and hereditary properties.
result Classification of planar-Rips complexes and unit disk graphs up to homotopy.

Homotopy types of Vietoris-Rips metric thickenings of the circle confirmed.

problem Understanding the homotopy types of Vietoris-Rips metric thickenings of the circle.
method Finding quotients of the metric thickenings that preserve homotopy type and showing that the quotient spaces can be described as CW complexes.
result The Vietoris-Rips metric thickenings of the circle are homotopy equivalent to odd-dimensional spheres at the expected scale parameters.

Study reveals how dengue spread patterns vary across different years in Recife, Brazil.

problem Understanding spatial organization of dengue transmission in urban areas.
method Spatial analysis of dengue cases using topological data analysis and Vietoris-Rips filtrations.
result Critical percolation thresholds define distinct geometric regimes of dengue spread.

The restricted isometry property (RIP) for design matrices gives guarantees for optimal recovery in sparse linear models. It is of high interest in compressed sensing and statistical learning. This property is particularly important for computationally efficient recovery methods. As a consequence, even though it is in …

2016-05-31abs ↗pdf ↗

Sign-RIP improves robust low-rank matrix recovery by preserving norms even with corrupted measurements.

problem Robust low-rank matrix recovery in the presence of corrupted measurements.
method Proposed Sign-RIP, a robust restricted isometry property.
result Sign-RIP guarantees uniform convergence of subdifferentials in robust low-rank matrix recovery.

Fix a finite set of points in Euclidean nn-space $\euc^n$, thought of as a point-cloud sampling of a certain domain $D\subset\euc^n$. The Rips complex is a combinatorial simplicial complex based on proximity of neighbors that serves as an easily-computed but high-dimensional approximation to the homotopy type of DD. …

2007-12-03abs ↗pdf ↗

Paper analyzes noisy low-rank matrix optimization, improving RIP bounds and convergence rates.

problem Noisy low-rank matrix optimization with general objective functions.
method Develops new mathematical framework and proves convergence rate under RIP condition.
result Any spurious local solution is close to ground truth when RIP constant is less than 1/3.

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.

When the linear measurements of an instance of low-rank matrix recovery satisfy a restricted isometry property (RIP)---i.e. they are approximately norm-preserving---the problem is known to contain no spurious local minima, so exact recovery is guaranteed. In this paper, we show that moderate RIP is not enough to elimin…

2018-05-25abs ↗pdf ↗

This paper investigates the average-case time complexity of certifying RIP matrices.

problem Certifying the restricted isometry property (RIP) for large sparsity levels in random Gaussian matrices.
method Analysis of the low-degree likelihood ratio to determine the average-case time complexity.
result Subexponential runtime of NildeΩ(s2/M)N^{ ildeΩ(s^2/M)} is required for certifying RIP matrices.

Persistent homology has emerged as a novel tool for data analysis in the past two decades. However, there are still very few shapes or even manifolds whose persistent homology barcodes (say of the Vietoris-Rips complex) are fully known. Towards this direction, let PnP_n be the boundary of a regular polygon in the plane…

2018-07-28abs ↗pdf ↗

Paper uses TDA to assess cryptocurrency risk by measuring phase space instability.

problem Traditional risk measures fail to capture market dynamics' geometric structure.
method Applied Takens' Delay Embedding Theorem to generate point cloud, computed persistent homology groups, defined Topological Persistence Norm.
result Proposed leverage calibration heuristic based on persistence of 1-dimensional cycles.

We construct a compact subset K of the four dimensional Euclidean space with the following property: For all values of the parameter in an interval, the Vietoris-Rips complex of K has uncountably generated first homology. This answers a question that arose in work on persistent homology.

2012-10-15abs ↗pdf ↗

We study isometric actions of finitely presented groups on R\mathbb{R}-trees. In this paper, we develop a relative version of the Rips machine to study pairs\textit{pairs} of such actions. An important example of a pair\textit{pair} is a group action on an R\mathbb{R}-tree and a subgroup action on its minimal invariant su…

2016-12-23abs ↗pdf ↗

Let GG be a group acting properly and by isometries on a metric space XX; it follows that the quotient or orbit space X/GX/G is also a metric space. We study the Vietoris-Rips and Čech complexes of X/GX/G. Whereas (co)homology theories for metric spaces let the scale parameter of a Vietoris-Rips or Čech complex go to z…

2019-11-02abs ↗pdf ↗

Recently, Rips produced an example of a double of two free groups which has unsolvable generalized word problem. In this paper, we show that Rips's example fits into a large class of doubles of groups, each member of which contains F_2 x F_2 and therefore has unsolvable generalized word problem and is incoherent.

1998-09-23abs ↗pdf ↗

The paper analyzes conditions for solving low-rank matrix recovery problems with noisy measurements.

problem Low-rank matrix recovery with corrupted measurements.
method Analysis of the restricted isometry property (RIP) and local search methods.
result Sharp bounds on the maximum distance between local minimizers and the ground truth.

The paper connects geometric and topological concepts to bound distances between metric spaces.

problem Bounding distances between metric spaces using Gromov-Hausdorff distance.
method Using Borsuk-Ulam theorems and Vietoris-Rips complexes, the paper obstructs the existence of certain continuous maps between complexes to bound discontinuities of functions.
result The paper provides new bounds on Gromov-Hausdorff distances between spheres of different dimensions.

We inspect Vietoris-Rips complexes VRt(X)VR_t(X) of certain metric spaces XX using a new generalization of Bestvina-Brady discrete Morse theory. Our main result is a pair of metric criteria on XX, called the Morse Criterion and Link Criterion, that allow us to deduce information about the homotopy types of certain $VR_t(…

2018-12-28abs ↗pdf ↗

Two groups with same profinite completion have different co-Hopfian properties.

problem Understanding co-Hopfian properties in residually finite groups.
method Using a specific construction involving a finitely presented acyclic group with trivial profinite completion.
result Found two groups with same profinite completion but different co-Hopfian properties.

Matrices satisfying the Restricted Isometry Property (RIP) play an important role in the areas of compressed sensing and statistical learning. RIP matrices with optimal parameters are mainly obtained via probabilistic arguments, as explicit constructions seem hard. It is therefore interesting to ask whether a fixed mat…

2019-04-11abs ↗pdf ↗

Nonnegative low-rank matrix recovery can have spurious local minima.

problem Nonnegative low-rank matrix recovery problems can have spurious local minima.
method Investigated projected gradient methods for nonnegative low-rank recovery problems.
result Benign nonconvexity holds in the fully-observed case with RIP constant δ=0 but fails in the partially-observed case and higher-rank ground truths.

Given a sample of points XX in a metric space MM and a scale r>0r>0, the Vietoris-Rips simplicial complex VR(X;r)\mathrm{VR}(X;r) is a standard construction to attempt to recover MM from XX up to homotopy type. A deficiency of this approach is that VR(X;r)\mathrm{VR}(X;r) is not metrizable if it is not locally finite, and thu…

2017-06-15abs ↗pdf ↗

Researchers decompose Forman-Ricci curvature for efficient computation in VR complexes.

problem Efficiently computing Forman-Ricci curvature in higher-dimensional data.
method Decomposition and set-theoretical proof for local computation of FRC in VR complexes.
result Reveals critical geometric insights overlooked by conventional techniques.

In "Rips complexes and covers in the uniform category" \cite{Rips} the authors define, following James \cite{J}, covering maps of uniform spaces and introduce the concept of generalized uniform covering maps. Conditions for the existence of universal uniform covering maps and generalized uniform covering maps are given…

2010-08-02abs ↗pdf ↗

Stable density-based clustering via multiparameter persistence.

problem Density-based clustering stability to data perturbations.
method Degree-Rips construction, correspondence-interleaving distance, multiparameter stability analysis.
result Persistable pipeline yields stable, consistent density-based clustering.