YHYasuaki Hiraoka

Yasuaki Hiraoka

*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


Yasuaki Hiraoka has a total of 60 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Persistence Module and Schubert Calculus

    by Yasuaki Hiraoka, Kohei Yahiro, Chenguang Xu

    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 decomposition of a flag. In particular, isomorphism classes of persistence modules correspond to Schubert cells, thereby the Schubert calculus naturally defines a multiplication on persistence diagrams. The meaning of the multiplication on persistence diagrams is carried over from that on Schubert calculus, i.e., algebro-geometric intersections of varieties of persistence modules.

  • Curse of dimensionality on persistence diagrams

    by Yasuaki Hiraoka, Yusuke Imoto, Shu Kanazawa, Enhao Liu

    The stability of persistent homology has led to wide applications of the persistence diagram as a trusted topological descriptor in the presence of noise. However, with the increasing demand for high-dimension and low-sample-size data processing in modern science, it is questionable whether persistence diagrams retain their reliability in the presence of high-dimensional noise. This work aims to study the reliability of persistence diagrams in the high-dimension low-sample-size data setting. By analyzing the asymptotic behavior of persistence diagrams for high-dimensional random data, we show that persistence diagrams are no longer reliable descriptors of low-sample-size data under high-dimensional noise perturbations. We refer to this loss of reliability of persistence diagrams in such data settings as the curse of dimensionality on persistence diagrams. Next, we investigate the performance of applying normalized principal component analysis for addressing the curse of dimensionality and show that utilizing this method yields a theoretical improvement, although there remain challenges in fully recovering the original topological features.


  • Open Access

    Refinement of interval approximations for fully commutative quivers

    by Yasuaki Hiraoka, Ken Nakashima, Ippei Obayashi, Chenguang Xu

    A central challenge in the theory of multiparameter persistence modules lies in defining effective descriptors for representations of infinite or wild type. In this work, we propose a novel framework for analyzing interval approximations of fully commutative quivers, which offers a tunable trade-off between approximation resolution and computational complexity. Our approach is evaluated on commutative ladder modules of both finite and infinite type. For finite-type cases, we establish an efficient method for computing indecomposable decompositions using solely one-parameter persistent homology. For infinite-type cases, we introduce a new invariant that captures persistence in the second parameter by connecting standard persistence diagrams through interval approximations. Furthermore, we present several models for constructing commutative ladder filtrations, providing new insights into the behavior of random filtrations and demonstrating the utility of our framework in topological analysis of material structures.


  • Open Access

    Linking structure and process in dendritic growth using persistent homology with energy analysis

    by Misato Tone, Shunsuke Sato, Sotaro Kunii, Ippei Obayashi, Yasuaki Hiraoka, Yui Ogawa, Hirokazu Fukidome, Alexandre Lira Foggiatto, Chiharu Mitsumata, Ryunosuke Nagaoka, et al.


  • Open Access

    scEGOT: single-cell trajectory inference framework based on entropic Gaussian mixture optimal transport

    by Toshiaki Yachimura, Hanbo Wang, Yusuke Imoto, Momoko Yoshida, Sohei Tasaki, Yoji Kojima, Yukihiro Yabuta, Mitinori Saitou, Yasuaki Hiraoka

    Time-series scRNA-seq data have opened a door to elucidate cell differentiation, and in this context, the optimal transport theory has been attracting much attention. However, there remain critical issues in interpretability and computational cost. We present scEGOT, a comprehensive framework for single-cell trajectory inference, as a generative model with high interpretability and low computational cost. Applied to the human primordial germ cell-like cell (PGCLC) induction system, scEGOT identified the PGCLC progenitor population and bifurcation time of segregation. Our analysis shows TFAP2A is insufficient for identifying PGCLC progenitors, requiring NKX1-2. Additionally, MESP1 and GATA6 are also crucial for PGCLC/somatic cell segregation. These findings shed light on the mechanism that segregates PGCLC from somatic lineages. Notably, not limited to scRNA-seq, scEGOT’s versatility can extend to general single-cell data like scATAC-seq, and hence has the potential to revolutionize our understanding of such datasets and, thereby also, developmental biology.


  • Open Access

    Curse of Dimensionality on Persistence Diagrams

    by Yasuaki Hiraoka, Yusuke Imoto, Shu Kanazawa, Enhao Liu

    The stability of persistent homology has led to wide applications of the persistence diagram as a trusted topological descriptor in the presence of noise. However, with the increasing demand for high-dimension and low-sample-size data processing in modern science, it is questionable whether persistence diagrams retain their reliability in the presence of high-dimensional noise. This work aims to study the reliability of persistence diagrams in the high-dimension low-sample-size data setting. By analyzing the asymptotic behavior of persistence diagrams for high-dimensional random data, we show that persistence diagrams are no longer reliable descriptors of low-sample-size data under high-dimensional noise perturbations. We refer to this loss of reliability of persistence diagrams in such data settings as the curse of dimensionality on persistence diagrams. Next, we investigate the possibility of using normalized principal component analysis as a method for reducing the dimensionality of the high-dimensional observed data to resolve the curse of dimensionality. We show that this method can mitigate the curse of dimensionality on persistence diagrams. Our results shed some new light on the challenges of processing high-dimension low-sample-size data by persistence diagrams and provide a starting point for future research in this area.

  • Open Access

    Refinement of Interval Approximations for Fully Commutative Quivers

    by Yasuaki Hiraoka, Ken Nakashima, Ippei Obayashi, Chenguang Xu

    A fundamental challenge in multiparameter persistent homology is the absence of a complete and discrete invariant. To address this issue, we propose an enhanced framework that realizes a holistic understanding of a fully commutative quiver's representation via synthesizing interpretations obtained from intervals. Additionally, it provides a mechanism to tune the balance between approximation resolution and computational complexity. This framework is evaluated on commutative ladders of both finite-type and infinite-type. For the former, we discover an efficient method for the indecomposable decomposition leveraging solely one-parameter persistent homology. For the latter, we introduce a new invariant that reveals persistence in the second parameter by connecting two standard persistence diagrams using interval approximations. We subsequently present several models for constructing commutative ladder filtrations, offering fresh insights into random filtrations and demonstrating our toolkit's effectiveness in analyzing the topology of materials.