AGAraceli Guzmán-Tristán

Araceli Guzmán-Tristán

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

Araceli Guzmán-Tristán has a total of 4 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    On the existence of universal links in three-manifolds

    by Francisco González-Acuña, Araceli Guzmán-Tristán, José Andrés Rodríguez-Migueles, Jesús Rodríguez-Viorato

    We study the existence of branched coverings between closed 3-manifolds, with emphasis on universal knots and links. We prove that the only closed 3-manifolds that admit a universal link are spherical. Furthermore, we distinguish between universal links and complement universal links and show that these notions do not coincide in general, by exhibiting infinitely many examples of complement universal links that are not universal. Also, we prove that there is no closed aspherical 3-manifold such that every closed, aspherical 3-manifold is a branched covering over it. Finally, we characterize the closed 3-manifolds admitting branching coverings from $$P^3 \# P^3$$ P 3 # P 3 , and deduce that there is no closed reducible 3-manifold, such that every closed reducible 3-manifold is a branched covering over it.

  • Open Access

    Noncommutative Model Selection for Data Clustering and Dimension Reduction Using Relative von Neumann Entropy

    by Araceli Guzmán-Tristán, Antonio Rieser

    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.