Antonio Rieser
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
Research Subjects
Antonio Rieser has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Alejandra Trujillo-Negrete
Centro de Investigacion en Matematicas, Guanajuato, GTO, Mexico
2 shared publications - Samuel Lisi
Department of Mathematics, University of Mississippi, Oxford, Miss., U.S.A.
2 shared publications - Araceli Guzmán-Tristán1 shared publication
- Jonathan Treviño-Marroquín1 shared publication
Latest Publications
- 27 February 2025
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 167
Semi-coarse spaces, homotopy and homology
- 27 February 2025
- Published by Elsevier in Advances in Applied Mathematics
- Vol. 167
Semi-coarse spaces, homotopy and homology
- Open Access
Noncommutative Model Selection for Data Clustering and Dimension Reduction Using Relative von Neumann Entropy
We propose a pair of completely data-driven algorithms for unsupervised classification and dimension reduction, and we empirically study their performance on a number of data sets, both simulated data in three-dimensions and images from the COIL-20 data set. The algorithms take as input a set of points sampled from a uniform distribution supported on a metric space, the latter embedded in an ambient metric space, and they output a clustering or reduction of dimension of the data. They work by constructing a natural family of graphs from the data and selecting the graph which maximizes the relative von Neumann entropy of certain normalized heat operators constructed from the graphs. Once the appropriate graph is selected, the eigenvectors of the graph Laplacian may be used to reduce the dimension of the data, and clusters in the data may be identified with the kernel of the associated graph Laplacian. Notably, these algorithms do not require information about the size of a neighborhood or the desired number of clusters as input, in contrast to popular algorithms such as $k$-means, and even more modern spectral methods such as Laplacian eigenmaps, among others. In our computational experiments, our clustering algorithm outperforms $k$-means clustering on data sets with non-trivial geometry and topology, in particular data whose clusters are not concentrated around a specific point, and our dimension reduction algorithm is shown to work well in several simple examples.
Open AccessNoncommutative Model Selection for Data Clustering and Dimension Reduction Using Relative von Neumann Entropy
We propose a pair of completely data-driven algorithms for unsupervised classification and dimension reduction, and we empirically study their performance on a number of data sets, both simulated data in three-dimensions and images from the COIL-20 data set. The algorithms take as input a set of points sampled from a uniform distribution supported on a metric space, the latter embedded in an ambient metric space, and they output a clustering or reduction of dimension of the data. They work by constructing a natural family of graphs from the data and selecting the graph which maximizes the relative von Neumann entropy of certain normalized heat operators constructed from the graphs. Once the appropriate graph is selected, the eigenvectors of the graph Laplacian may be used to reduce the dimension of the data, and clusters in the data may be identified with the kernel of the associated graph Laplacian. Notably, these algorithms do not require information about the size of a neighborhood or the desired number of clusters as input, in contrast to popular algorithms such as $k$-means, and even more modern spectral methods such as Laplacian eigenmaps, among others. In our computational experiments, our clustering algorithm outperforms $k$-means clustering on data sets with non-trivial geometry and topology, in particular data whose clusters are not concentrated around a specific point, and our dimension reduction algorithm is shown to work well in several simple examples.
- Open Access
Cofibration and Model Category Structures for Discrete and Continuous Homotopy
We show that the categories PsTop and Lim of pseudotopological spaces and limit spaces, respectively, admit cofibration category structures, and that PsTop admits a model category structure, giving several ways to simultaneously study the homotopy theory of classical topological spaces, combinatorial spaces such as graphs and matroids, and metric spaces endowed with a privileged scale, in addition to spaces of maps between them. In the process, we give a sufficient condition for a topological construct which contains compactly generated Hausdorff spaces as a subcategory to admit an $I$-category structure. We further show that, for a topological space $X\in C$, the homotopy groups of $X$ constructed in the cofibration category on PsTop are isomorphic to those constructed classically in Top$^*$.Open AccessCofibration and Model Category Structures for Discrete and Continuous Homotopy
We show that the categories PsTop and Lim of pseudotopological spaces and limit spaces, respectively, admit cofibration category structures, and that PsTop admits a model category structure, giving several ways to simultaneously study the homotopy theory of classical topological spaces, combinatorial spaces such as graphs and matroids, and metric spaces endowed with a privileged scale, in addition to spaces of maps between them. In the process, we give a sufficient condition for a topological construct which contains compactly generated Hausdorff spaces as a subcategory to admit an $I$-category structure. We further show that, for a topological space $X\in C$, the homotopy groups of $X$ constructed in the cofibration category on PsTop are isomorphic to those constructed classically in Top$^*$. - 11 April 2022
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 166 (2) , 239-253
Künneth theorems for Vietoris–Rips homology
- 11 April 2022
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 166 (2) , 239-253
Künneth theorems for Vietoris–Rips homology
- Open Access
Kunneth Theorems for Vietoris-Rips Homology
We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We finish by computing the Vietoris-Rips cohomology of the torus endowed with diferent semi-uniform structures.
Open AccessKunneth Theorems for Vietoris-Rips Homology
We prove a Kunneth theorem for the Vietoris-Rips homology and cohomology of a semi-uniform space. We then interpret this result for graphs, where we show that the Kunneth theorem holds for graphs with respect to the strong graph product. We finish by computing the Vietoris-Rips cohomology of the torus endowed with diferent semi-uniform structures.
- Open Access
- 1 June 2021
- Published by Elsevier in Topology and its Applications
- Vol. 296
Čech closure spaces: A unified framework for discrete and continuous homotopy
- 1 June 2021
- Published by Elsevier in Topology and its Applications
- Vol. 296
Open AccessČech closure spaces: A unified framework for discrete and continuous homotopy
- Open Access
Vietoris-Rips Homology Theory for Semi-Uniform Spaces
While the Vietoris-Rips complex is now widely used in both topological data analysis and the theory of hyperbolic groups, many of the fundamental properties of its homology have remained elusive. In this article, we define the Vietoris-Rips homology for semi-uniform spaces, which generalizes the classical theory for graphs and metric spaces, and provides a natural, general setting for the construction. We then prove a version of the Eilenberg-Steenrod axioms in this setting, giving a natural definition of homotopy for semi-uniform spaces in the process.
Open AccessVietoris-Rips Homology Theory for Semi-Uniform Spaces
While the Vietoris-Rips complex is now widely used in both topological data analysis and the theory of hyperbolic groups, many of the fundamental properties of its homology have remained elusive. In this article, we define the Vietoris-Rips homology for semi-uniform spaces, which generalizes the classical theory for graphs and metric spaces, and provides a natural, general setting for the construction. We then prove a version of the Eilenberg-Steenrod axioms in this setting, giving a natural definition of homotopy for semi-uniform spaces in the process.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 3 (1) , 49-66
A topological approach to spectral clustering
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space$ X $ , and output a clustering of the data based on the selection of a topological model for the connected components of$ X $ . Both algorithms work by selecting a graph on the samples from a natural one-parameter family of graphs, using a geometric criterion in the first case and an information theoretic criterion in the second. The estimated connected components of$ X $ are identified with the kernel of the associated graph Laplacian, which allows the algorithm to work without requiring the number of expected clusters or other auxiliary data as input.- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Foundations of Data Science
- Vol. 3 (1) , 49-66
A topological approach to spectral clustering
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space$ X $ , and output a clustering of the data based on the selection of a topological model for the connected components of$ X $ . Both algorithms work by selecting a graph on the samples from a natural one-parameter family of graphs, using a geometric criterion in the first case and an information theoretic criterion in the second. The estimated connected components of$ X $ are identified with the kernel of the associated graph Laplacian, which allows the algorithm to work without requiring the number of expected clusters or other auxiliary data as input.- Open Access
A Topological Approach to Spectral Clustering
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space $X$, and output a clustering of the data based on the selection of a topological model for the connected components of $X$. Both algorithms work by selecting a graph on the samples from a natural one-parameter family of graphs, using a geometric criterion in the first case and an information theoretic criterion in the second. The estimated connected components of $X$ are identified with the kernel of the associated graph Laplacian, which allows the algorithm to work without requiring the number of expected clusters or other auxiliary data as input.Open AccessA Topological Approach to Spectral Clustering
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space $X$, and output a clustering of the data based on the selection of a topological model for the connected components of $X$. Both algorithms work by selecting a graph on the samples from a natural one-parameter family of graphs, using a geometric criterion in the first case and an information theoretic criterion in the second. The estimated connected components of $X$ are identified with the kernel of the associated graph Laplacian, which allows the algorithm to work without requiring the number of expected clusters or other auxiliary data as input. - 1 January 2020
- Published by International Press of Boston in Journal of Symplectic Geometry
- Vol. 18 (3) , 819-865
Coisotropic Hofer–Zehnder capacities and non-squeezing for relative embeddings
International Press of Boston - publishers of scholarly mathematical and scientific journals and books
- 1 January 2020
- Published by International Press of Boston in Journal of Symplectic Geometry
- Vol. 18 (3) , 819-865
Coisotropic Hofer–Zehnder capacities and non-squeezing for relative embeddings
International Press of Boston - publishers of scholarly mathematical and scientific journals and books