CLClaudia Landi

Claudia Landi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Claudia Landi has a total of 59 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Canonical chain complexes for Morse-Smale vector fields

    by Clemens Bannwart, Claudia Landi

    In 1960, Smale defined a filtration of a closed smooth manifold by the unstable manifolds of fixed points and closed orbits of a Morse-Smale vector field defined on it, and derived generalized Morse inequalities. This suggests that, similarly to the Morse chain complex of a gradient-like vector field, even in the presence of closed orbits, Morse-Smale vector fields admit canonical chain complexes, invariant under topological equivalence, from which one can algebraically derive Morse inequalities. In this paper we show that this is actually the case, improving the state of the art that only offers non-canonical chain complexes. Technically, we achieve this result considering the Čech homology spectral sequence of the unstable manifolds filtration. In particular, we turn bounded exact couples into chain complexes such that the limit page of the spectral sequence associated with an exact couple gives the homology of the chain complex. We showcase our construction with examples.

  • Tagged Barcodes for the Topological Analysis of Gradient-Like Vector Fields

    by Clemens Bannwart, Claudia Landi

    Intending to introduce a method for the topological analysis of fields, we present a pipeline that takes as an input a weighted and based chain complex, produces a factored chain complex, and encodes it as a barcode of tagged intervals (briefly, a tagged barcode). We show how to apply this pipeline to the weighted and based Morse chain complex of a gradient-like Morse–Smale vector field on a compact Riemannian manifold in both the smooth and discrete settings. Interestingly for computations, it turns out that there is an isometry between factored chain complexes endowed with the interleaving distance and their tagged barcodes endowed with the bottleneck distance. Concerning stability, we show that the map taking a generic enough gradient-like vector field to its barcode of tagged intervals is continuous. Finally, we prove that the tagged barcode of any such vector field can be approximated by the tagged barcode of a combinatorial version of it with arbitrary precision.


  • Open Access

    A Closed Formula for the Interleaving Distance of Rectangle Persistence Modules

    by Mehmet Ali Batan, Claudia Landi, Mehmetcik Pamuk

    We give formulas for calculating the interleaving distance between rectangle persistence modules that depend solely on the geometry of the underlying rectangles. Moreover, we extend our results to calculate the bottleneck distance for rectangle decomposable persistence modules.

  • Open Access

    On the support of betti tables of multiparameter persistent homology modules

    by Andrea Guidolin, Claudia Landi

    Persistent homology encodes the evolution of homological features of a multifiltered cell complex in the form of a multigraded module over a polynomial ring, called a multiparameter persistence module, and quantifies it through invariants suitable for topological data analysis. In this paper, we establish relations between the Betti tables, a standard invariant for multigraded modules commonly used in multiparameter persistence, and the multifiltered cell complex. In particular, we show that the grades at which cells of specific dimensions first appear in the filtration reveal all positions in which the Betti tables are possibly non-zero. This result can be used in combination with discrete Morse theory on the multifiltered cell complex originating the module to obtain a better approximation of the support of the Betti tables. In the case of bifiltrations, we refine our results by considering homological critical grades of a filtered chain complex instead of entrance grades of cells.


  • Open Access

    Morse inequalities for the Koszul complex of multi-persistence

    by Andrea Guidolin, Claudia Landi

    In this paper, we define the homological Morse numbers of a filtered cell complex in terms of relative homology of nested filtration pieces, and derive inequalities relating these numbers to the Betti tables of the multi-parameter persistence modules of the considered filtration. Using the Mayer-Vietoris spectral sequence we first obtain strong and weak Morse inequalities involving the above quantities, and then we improve the weak inequalities achieving a sharp lower bound for homological Morse numbers. Furthermore, we prove a sharp upper bound for homological Morse numbers, expressed again in terms of the Betti tables.

  • Morse-Based Fibering of the Persistence Rank Invariant

    by Asilata Bapat, Robyn Brooks, Celia Hacker, Claudia Landi, Barbara I. Mahler


  • Open Access

    Morse-based Fibering of the Persistence Rank Invariant

    by Asilata Bapat, Robyn Brooks, Celia Hacker, Claudia Landi, Barbara I. Mahler

    Although there is no doubt that multi-parameter persistent homology is a useful tool to analyse multi-variate data, efficient ways to compute these modules are still lacking in the available topological data analysis toolboxes. Other issues such as interpretation and visualization of the output remain difficult to solve. Software visualizing multi-parameter persistence diagrams is currently only available for 2-dimensional persistence modules. One of the simplest invariants for a multi-parameter persistence module is its rank invariant, defined as the function that counts the number of linearly independent homology classes that live in the filtration through a given pair of values of the multi-parameter. We propose a step towards interpretation and visualization of the rank invariant for persistence modules for any given number of parameters. We show how discrete Morse theory may be used to compute the rank invariant, proving that it is completely determined by its values at points whose coordinates are critical with respect to a discrete Morse gradient vector field. These critical points partition the set of all lines of positive slope in the parameter space into equivalence classes, such that the rank invariant along lines in the same class are also equivalent. We show that we can deduce all persistence diagrams of the restrictions to the lines in a given class from the persistence diagram of the restriction to a representative in that class.

  • Open Access

    Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology

    by Claudia Landi, Sara Scaramuccia

    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 specific coordinate systems and does so robustly to noise. Moreover, the geometric content of a discrete gradient vector field is very useful for visualization purposes. The specific case of multivariate data still demands for further investigations, on the one hand, for computational reasons, it is important to reduce the necessary amount of data to be processed. On the other hand, for analysis reasons, the multivariate case requires the detection and interpretation of the possible interdepedance among data components. To this end, in this paper we introduce and study a notion of perfectness for discrete gradient vector fields with respect to multi-parameter persistent homology, called relative-perfectness. As a natural generalization of usual perfectness in Morse theory for homology, relative-perfectness entails having the least number of critical cells relevant for multi-parameter persistence. As a first contribution, we support our definition of relative-perfectness by generalizing Morse inequalities to the filtration structure where homology groups involved are relative with respect to subsequent sublevel sets. In order to allow for an interpretation of critical cells in 2-parameter persistence, our second contribution consists of two inequalities bounding Betti tables of persistence modules from above and below, via the number of critical cells. Our last result is the proof that existing algorithms based on local homotopy expansions allow for efficient computability over simplicial complexes up to dimension 2.


  • Open Access

    Relative-perfectness of discrete gradient vector fields and multi-parameter persistent homology

    by Claudia Landi, Sara Scaramuccia

    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 specific coordinate systems and does so robustly to noise. Moreover, the geometric content of a discrete gradient vector field is very useful for visualization purposes. The specific case of multivariate data still demands for further investigations, on the one hand, for computational reasons, it is important to reduce the necessary amount of data to be processed. On the other hand, for analysis reasons, the multivariate case requires the detection and interpretation of the possible interdepedance among data components. To this end, in this paper we introduce and study a notion of perfectness for discrete gradient vector fields with respect to multi-parameter persistent homology, called relative-perfectness. As a natural generalization of usual perfectness in Morse theory for homology, relative-perfectness entails having the least number of critical cells relevant for multi-parameter persistence. As a first contribution, we support our definition of relative-perfectness by generalizing Morse inequalities to the filtration structure where homology groups involved are relative with respect to subsequent sublevel sets. In order to allow for an interpretation of critical cells in $2$-parameter persistence, our second contribution consists of two inequalities bounding Betti tables of persistence modules from above and below, via the number of critical cells. Our last result is the proof that existing algorithms based on local homotopy expansions allow for efficient computability over simplicial complexes up to dimension $2$.

  • Invariants for tame parametrised chain complexes

    by Wojciech Chachólski, Barbara Giunti, Claudia Landi

    International Press of Boston - publishers of scholarly mathematical and scientific journals and books