Related papers: Interval Replacements of Persistence Modules
A multiplication on persistence diagrams is introduced by means of Schubert calculus. The key observation behind this multiplication comes from the fact that the representation space of persistence modules has the structure of the Schubert…
We show that every infinite zigzag persistence module decomposes into a direct sum of interval persistence modules.
The local persistence R(t), defined as the proportion of the system still in its initial state at time t, is measured for the Bak--Sneppen model. For 1 and 2 dimensions, it is found that the decay of R(t) depends on one of two classes of…
In this paper, we investigate the global exponential stability for complex-valued recurrent neural networks with asynchronous time delays by decomposing complex-valued networks to real and imaginary parts and construct an equivalent…
Given collections A and B of residue classes modulo m and n, respectively, we investigate conditions on A and B that ensure that, for at least some a in A and b in B, the linear system x = a mod m, x = b mod n has an integer solution, and…
We consider the general second order difference equation $x_{n+1}=F(x_n,x_{n-1})$ in which $F$ is continuous and of mixed monotonicity in its arguments. In equations with negative terms, a persistent set can be a proper subset of the…
Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model with dynamic reconfigurations making the system evolve--with a…
Exterior powers play important roles in persistent homology in computational geometry. In the present paper we study the problem of extracting the $K$ longest intervals of the exterior-power layers of a tame persistence module. We prove a…
For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…
Persistent homology is a popular and useful tool for analysing finite metric spaces, revealing features that can be used to distinguish sets of unlabeled points and as input into machine learning pipelines. The famous stability theorem of…
In this paper we study the preservation of strong stability of strongly continuous semigroups on Hilbert spaces. In particular, we study a situation where the generator of the semigroup has a finite number of spectral points on the…
We show some preservation results of amenably extending strongly Ulam stable groups under mild decay assumptions, including quantitative preservation of asymptotic bounds under the assumption that the modulus of stability is H\"older…
We ask what happens when the index set carries modal structure, with possibilities organized into a Kripke frame. We define modal exchangeability as invariance under accessibility-preserving automorphisms that fix a designated base world,…
Persistent homology, while ostensibly measuring changes in topology, captures multiscale geometrical information. It is a natural tool for the analysis of point patterns. In this paper we explore the statistical power of the (persistent…
A common technique for verifying the safety of complex systems is the inductive invariant method. Inductive invariants are inductive formulas that overapproximate the reachable states of a system and imply a desired safety property.…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
The low displacement rank (LDR) framework for structured matrices represents a matrix through two displacement operators and a low-rank residual. Existing use of LDR matrices in deep learning has applied fixed displacement operators…
The Interval poset of a permutation is an effective way of capturing all the intervals of the permutation and the inclusions between them and was introduced recently by Tenner. Thi paper explores the geometric interpretation of interval…
In this article we use the theory of interval-posets recently introduced by Ch{\^a}tel and Pons in order to describe some interesting families of intervals in the Tamari lattices. These families are defined as interval-posets avoiding…
We show that computing the interleaving distance between two multi-graded persistence modules is NP-hard. More precisely, we show that deciding whether two modules are $1$-interleaved is NP-complete, already for bigraded, interval…