Related papers: Quantifying the structural stability of simplicial…
We study the categorical framework for the computation of persistent homology, without reliance on a particular computational algorithm. The computation of persistent homology is commonly summarized as a matrix theorem, which we call the…
This paper is motivated by recent developments in group stability, high dimensional expansion, local testability of error correcting codes and topological property testing. In Part I, we formulate and motivate three stability problems: 1.…
A commonly used approach to study stability in a complex system is by analyzing the Jacobian matrix at an equilibrium point of a dynamical system. The equilibrium point is stable if all eigenvalues have negative real parts. Here, by…
In these lectures notes, we review our recent works addressing various problems of finding the nearest stable system to an unstable one. After the introduction, we provide some preliminary background, namely, defining Port-Hamiltonian…
We introduce harmonic persistent homology spaces for filtrations of finite simplicial complexes. As a result we can associate concrete subspaces of cycles to each bar of the barcode of the filtration. We prove stability of the harmonic…
Across many scientific domains, practitioners rely on coarse, discretized summaries to track the evolving structure of complex systems under noise, measurement error, and changing system size. Understanding when such summaries are reliable…
We present a general framework how to investigate stability of solutions within a single self-consistent renormalization scheme being a parquet-type extension of the Baym-Kadanoff construction of conserving approximations. To obtain a…
Topological data analysis (TDA) is an area of data science that focuses on using invariants from algebraic topology to provide multiscale shape descriptors for geometric data sets such as point clouds. One of the most important such…
We propose a general technique for extracting a larger set of stable information from persistent homology computations than is currently done. The persistent homology algorithm is usually viewed as a procedure which starts with a filtered…
This survey offers an overview of an on-going project on uniform symmetries in abstract stable homotopy theories. This project has calculational, foundational, and representation-theoretic aspects, and key features of this emerging field on…
Concatenating matrices is a common technique for uncovering shared structures in data through singular value decomposition (SVD) and low-rank approximations. The fundamental question arises: How does the singular value spectrum of the…
Recently, the stability of certain topological phases of matter under weak perturbations was proven. Here, we present a short, alternate proof of the same result. We consider models of topological quantum order for which the unperturbed…
Higher-order networks have so far been considered primarily in the context of studying the structure of complex systems, i.e., the higher-order or multi-way relations connecting the constituent entities. More recently, a number of studies…
Persistent homology is a widely used tool in Topological Data Analysis that encodes multiscale topological information as a multi-set of points in the plane called a persistence diagram. It is difficult to apply statistical theory directly…
This paper establishes a general topological condition under which the semilocal stability of a set-valued mapping can be exactly determined by its local stability properties. Specifically, we investigate the relationship between the…
We prove structural stability under perturbations for a class of discrete-time dynamical systems near a non-hyperbolic fixed point. We reformulate the stability problem in terms of the well-posedness of an infinite-dimensional nonlinear…
Given a family of groups admitting a braided monoidal structure (satisfying mild assumptions) we construct a family of spaces on which the groups act and whose connectivity yields, via a classical argument of Quillen, homological stability…
We give a complete and detailed proof of Harer's stability theorem for the homology of mapping class groups of surfaces, with the best stability range presently known. This theorem and its proof have seen several improvements since Harer's…
Such modern applications of topology as data analysis and digital image analysis have to deal with noise and other uncertainty. In this environment, topological spaces often appear equipped with a real valued function. Persistence is a…
We investigate the automorphism groups of $\aleph\_0$-categorical structures and prove that they are exactly the Roelcke precompact Polish groups. We show that the theory of a structure is stable if and only if every Roelcke uniformly…