Related papers: Complex Matching Distance and Stability for Minima…

We introduce a metric space of clusterings, where clusterings are described by a binary vector indexed by the vertex-pairs. We extend this geometry to a hypersphere and prove that maximizing modularity is equivalent to minimizing the…

We investigate the complexity of solving stable or perturbation-resilient instances of $k$-Means and $k$-Median clustering in fixed dimension Euclidean metrics (more generally doubling metrics). The notion of stable (perturbation resilient)…

Sequential lateration is a class of methods for multidimensional scaling where a suitable subset of nodes is first embedded by some method, e.g., a clique embedded by classical scaling, and then the remaining nodes are recursively embedded…

A recent work by Lesnick and Wright proposed a visualisation of $2$D persistence modules by using their restrictions onto lines, giving a family of $1$D persistence modules. We give a constructive proof that any $1$D persistence module with…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

We extend the persistence algorithm, viewed as an algorithm computing the homology of a complex of free persistence or graded modules, to complexes of modules that are not free. We replace persistence modules by their presentations and…

The combination of persistent homology and discrete Morse theory has proven very effective in visualizing and analyzing big and heterogeneous data. Indeed, topology provides computable and coarse summaries of data independently from…

We present a parallelizable algorithm for computing the persistent homology of a filtered chain complex. Our approach differs from the commonly used reduction algorithm by first computing persistence pairs within local chunks, then…

Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…

Since persistence diagrams do not admit an inner product structure, a map into a Hilbert space is needed in order to use kernel methods. It is natural to ask if such maps necessarily distort the metric on persistence diagrams. We show that…

We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category…

Numerical simulations of coupled map lattices (CMLs) and other complex model systems show an enormous phenomenological variety that is difficult to classify and understand. It is therefore desirable to establish analytical tools for…

Takens' Embedding Theorem remarkably established that concatenating M previous outputs of a dynamical system into a vector (called a delay coordinate map) can be a one-to-one mapping of a low-dimensional attractor from the system state…

The pruning distance recently introduced by Bjerkevik compares persistence modules using approximate decompositions called prunings. Bjerkevik conjectures that this distance is Lipschitz equivalent to the classical interleaving distance on…

Model-based clustering is widely-used in a variety of application areas. However, fundamental concerns remain about robustness. In particular, results can be sensitive to the choice of kernel representing the within-cluster data density.…

We study variations of tautological bundles on moduli spaces of representations of quivers with relations associated with dimer models under a change of stability parameters. We prove that if the tautological bundle induces a derived…

We study a catching-up algorithm for a class of differential inclusions driven by maximal monotone operators with continuous perturbations. Using a decomposition of the monotone operator into the closed convex hull of its single-valued part…

Given a parameter dependent fixed point equation $x = F(x,u)$, we derive an abstract compactness principle for the fixed point map $u \mapsto x^*(u)$ under the assumptions that (i) the fixed point equation can be solved by the contraction…

We prove homology stability for elementary and special linear groups over rings with many units improving known stability ranges. Our result implies stability for unstable Quillen K-groups and proves a conjecture of Bass. For commutative…

The problem of super-resolution in general terms is to recuperate a finitely supported measure $\mu$ given finitely many of its coefficients $\hat{\mu}(k)$ with respect to some orthonormal system. The interesting case concerns situations,…