René Corbet
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
René Corbet has a total of 9 co-authors. Here are the top co-authors by number of shared publications:
- Michael Kerber
Graz University of Technology, Graz, Austria
5 shared publications - Georg Osang
IST Austria (Institute of Science and Technology Austria), Klosterneuburg, Austria
2 shared publications - Michael Lesnick
SUNY Albany USA
2 shared publications - Wojciech Chachólski
Department of Mathematics, KTH-Royal Institute of Technology, Stockholm, Sweden
2 shared publications Anna-Laura Sattelberger
1 shared publication- Anna-Laura Sattelberger
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
1 shared publication
Latest Publications
- Open Access
- 15 June 2024
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (3) , 643-667
The shift-dimension of multipersistence modules
We present the shift-dimension of multipersistence modules and investigate its algebraic properties. This gives rise to a new invariant of multigraded modules over the multivariate polynomial ring arising from the hierarchical stabilization of the zeroth total multigraded Betti number. We give a fast algorithm for the computation of the shift-dimension of interval modules in the bivariate case. We construct multipersistence contours that are parameterized by multivariate functions and hence provide a large class of feature maps for machine learning tasks.
- 15 June 2024
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 8 (3) , 643-667
Open AccessThe shift-dimension of multipersistence modules
We present the shift-dimension of multipersistence modules and investigate its algebraic properties. This gives rise to a new invariant of multigraded modules over the multivariate polynomial ring arising from the hierarchical stabilization of the zeroth total multigraded Betti number. We give a fast algorithm for the computation of the shift-dimension of interval modules in the bivariate case. We construct multipersistence contours that are parameterized by multivariate functions and hence provide a large class of feature maps for machine learning tasks.
- Open Access
The Shift-Dimension of Multipersistence Modules
We present the shift-dimension of multipersistence modules and investigate its algebraic properties. This gives rise to a new invariant of multigraded modules over the multivariate polynomial ring arising from the hierarchical stabilization of the zeroth total multigraded Betti number. We give a fast algorithm for the computation of the shift-dimension of interval modules in the bivariate case. We construct multipersistence contours that are parameterized by multivariate functions and hence provide a large class of feature maps for machine learning tasks.
Open AccessThe Shift-Dimension of Multipersistence Modules
We present the shift-dimension of multipersistence modules and investigate its algebraic properties. This gives rise to a new invariant of multigraded modules over the multivariate polynomial ring arising from the hierarchical stabilization of the zeroth total multigraded Betti number. We give a fast algorithm for the computation of the shift-dimension of interval modules in the bivariate case. We construct multipersistence contours that are parameterized by multivariate functions and hence provide a large class of feature maps for machine learning tasks.
- Open Access
- 20 February 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (2) , 376-405
Computing the Multicover Bifiltration
Given a finite set $$A\subset {\mathbb {R}}^d$$ , let $$\text {Cov}_{r,k}$$ denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness.- 20 February 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (2) , 376-405
Open AccessComputing the Multicover Bifiltration
Given a finite set $$A\subset {\mathbb {R}}^d$$ , let $$\text {Cov}_{r,k}$$ denote the set of all points within distance r to at least k points of A. Allowing r and k to vary, we obtain a 2-parameter family of spaces that grow larger when r increases or k decreases, called the multicover bifiltration. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a Čech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. - Open Access
Computing the Multicover Bifiltration
Given a finite set $A\subset\mathbb{R}^d$, let Cov$_{r,k}$ denote the set of all points within distance $r$ to at least $k$ points of $A$. Allowing $r$ and $k$ to vary, we obtain a 2-parameter family of spaces that grow larger when $r$ increases or $k$ decreases, called the \emph{multicover bifiltration}. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a \v Cech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness.Open AccessComputing the Multicover Bifiltration
Given a finite set $A\subset\mathbb{R}^d$, let Cov$_{r,k}$ denote the set of all points within distance $r$ to at least $k$ points of $A$. Allowing $r$ and $k$ to vary, we obtain a 2-parameter family of spaces that grow larger when $r$ increases or $k$ decreases, called the \emph{multicover bifiltration}. Motivated by the problem of computing the homology of this bifiltration, we introduce two closely related combinatorial bifiltrations, one polyhedral and the other simplicial, which are both topologically equivalent to the multicover bifiltration and far smaller than a \v Cech-based model considered in prior work of Sheehy. Our polyhedral construction is a bifiltration of the rhomboid tiling of Edelsbrunner and Osang, and can be efficiently computed using a variant of an algorithm given by these authors. Using an implementation for dimension 2 and 3, we provide experimental results. Our simplicial construction is useful for understanding the polyhedral construction and proving its correctness. - Open Access
A Kernel for Multi-Parameter Persistent Homology
Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel construction for multi-parameter persistence by integrating a one-parameter kernel weighted along straight lines. We prove that our kernel is stable and efficiently computable, which establishes a theoretical connection between topological data analysis and machine learning for multivariate data analysis.
Open AccessA Kernel for Multi-Parameter Persistent Homology
Topological data analysis and its main method, persistent homology, provide a toolkit for computing topological information of high-dimensional and noisy data sets. Kernels for one-parameter persistent homology have been established to connect persistent homology with machine learning techniques. We contribute a kernel construction for multi-parameter persistence by integrating a one-parameter kernel weighted along straight lines. We prove that our kernel is stable and efficiently computable, which establishes a theoretical connection between topological data analysis and machine learning for multivariate data analysis.
- Open Access
- 9 July 2018
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 2 (1-2) , 1-31
The representation theorem of persistence revisited and generalized
- 9 July 2018
- Published by Springer Nature in Journal of Applied and Computational Topology
- Vol. 2 (1-2) , 1-31
Open AccessThe representation theorem of persistence revisited and generalized
- Open Access
The Representation Theorem of Persistent Homology Revisited and Generalized
The Representation Theorem by Zomorodian and Carlsson has been the starting point of the study of persistent homology under the lens of algebraic representation theory. In this work, we give a more accurate statement of the original theorem and provide a complete and self-contained proof. Furthermore, we generalize the statement from the case of linear sequences of $R$-modules to $R$-modules indexed over more general monoids. This generalization subsumes the Representation Theorem of multidimensional persistence as a special case.
Open AccessThe Representation Theorem of Persistent Homology Revisited and Generalized
The Representation Theorem by Zomorodian and Carlsson has been the starting point of the study of persistent homology under the lens of algebraic representation theory. In this work, we give a more accurate statement of the original theorem and provide a complete and self-contained proof. Furthermore, we generalize the statement from the case of linear sequences of $R$-modules to $R$-modules indexed over more general monoids. This generalization subsumes the Representation Theorem of multidimensional persistence as a special case.