Emerson G. Escolar

ORCID: 0000-0003-4751-1521
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Topological and Geometric Data Analysis
  • Homotopy and Cohomology in Algebraic Topology
  • Advanced Neuroimaging Techniques and Applications
  • Algebraic structures and combinatorial models
  • Commutative Algebra and Its Applications
  • Molecular spectroscopy and chirality
  • Theoretical and Computational Physics
  • Gene expression and cancer classification
  • Single-cell and spatial transcriptomics
  • Alzheimer's disease research and treatments
  • MicroRNA in disease regulation
  • Data Visualization and Analytics
  • Digital Image Processing Techniques
  • Advanced Combinatorial Mathematics
  • Cell Image Analysis Techniques
  • Metabolomics and Mass Spectrometry Studies
  • Advanced Graph Neural Networks
  • Bioinformatics and Genomic Networks
  • Genomics and Chromatin Dynamics
  • Polynomial and algebraic computation
  • Advanced Fluorescence Microscopy Techniques

Kobe University
2019-2024

RIKEN Center for Advanced Intelligence Project
2018-2023

Kyoto University
2019

Tohoku University
2016-2018

Advanced Institute of Materials Science
2016

Kyushu University
2014-2015

This article proposes a topological method that extracts hierarchical structures of various amorphous solids. The is based on the persistence diagram (PD), mathematical tool for capturing shapes multiscale data. input to PDs given by an atomic configuration and output expressed as 2D histograms. Then, specific distributions such curves islands in identify meaningful shape characteristics configuration. Although can be applied wide variety disordered systems, it here silica glass,...

10.1073/pnas.1520877113 article EN Proceedings of the National Academy of Sciences 2016-06-13

The characterization of the medium-range (MRO) order in amorphous materials and its relation to short-range is discussed. A new topological approach extract a hierarchical structure presented, which robust against small perturbations allows us distinguish it from periodic or random configurations. This method called persistence diagram (PD) introduces scales many-body atomic structures facilitate size shape characterization. We first illustrate representation perfect crystalline PDs. Then,...

10.1088/0957-4484/26/30/304001 article EN Nanotechnology 2015-07-07

In this work, we propose a new invariant for 2D persistence modules called the compressed multiplicity and show that it generalizes notions of dimension vector rank invariant. addition, module M, an "interval-decomposable replacement" δ⁎(M) (in split Grothendieck group category modules), which is expressed by pair interval-decomposable modules, is, its positive negative parts. We M if only equal to in group. Furthermore, even not necessarily interval-decomposable, preserves M. provide...

10.1016/j.jaca.2023.100007 article EN cc-by Journal of Computational Algebra 2023-08-24

In the persistent homology of filtrations, indecomposable decompositions provide persistence diagrams. However, in almost all cases multidimensional persistence, classification modules is known to be a wild problem. One direction consider subclass interval-decomposable modules, which are direct sums interval representations. We introduce definition pre-interval representations, more natural algebraic definition, and study relationships between pre-interval, interval, thin show that over...

10.1016/j.comgeo.2022.101879 article EN cc-by Computational Geometry 2022-03-25

10.1007/s00454-015-9746-2 article EN Discrete & Computational Geometry 2015-11-02

Single-cell RNA sequencing (scRNA-seq) can determine gene expression in numerous individual cells simultaneously, promoting progress the biomedical sciences. However, scRNA-seq data are high-dimensional with substantial technical noise, including dropouts. During analysis of data, such noise engenders a statistical problem known as curse dimensionality (COD). Based on statistics, we herein formulate reduction method, RECODE (resolution dimensionality), for random sampling noise. We show that...

10.26508/lsa.202201591 article EN cc-by Life Science Alliance 2022-08-09

Where do firms innovate? Mapping their locations and directions in technological space is challenging due to its high dimensionality. We propose a new method characterize firms' inventive activities via topological data analysis (TDA) that represents high-dimensional shape graph. Applying this 333 major patents 1976–2005 reveals hitherto undocumented industry dynamics: some remain undifferentiated; others develop unique portfolios. Firms with trajectories, which we define measure...

10.1016/j.respol.2023.104821 article EN cc-by Research Policy 2023-06-22

Abstract A recent work by Lesnick and Wright proposed a visualisation of 2D persistence modules using their restrictions onto lines, giving family 1D modules. We give constructive proof that any module with finite support can be found as restriction some indecomposable support. As consequences our construction, we are able to exhibit whose has holes well an containing all line restrictions. Finally, also show finite-rectangle-decomposable n D $$(n+1)$$ <mml:math...

10.1007/s41468-020-00053-z article EN cc-by Journal of Applied and Computational Topology 2020-05-12

While persistent homology has taken strides towards becoming a widespread tool for data analysis, multidimensional persistence proven more difficult to apply. One reason is the serious drawback of no longer having concise and complete descriptor analogous diagrams former. We propose simple algebraic construction illustrate existence infinite families indecomposable modules over regular grids sufficient size. On top providing constructive proof representation type, we also provide...

10.4230/lipics.socg.2018.15 article EN Symposium on Computational Geometry 2018-06-01

A paper by Mischaikow and Nanda [14] uses filtered acyclic matchingsto form a Morse filtration for complex. The is smallerin size, yet has persistent homology equivalent to that of the original. We give anextension matchings case zigzag complexes prove theMorse complex similarly obtained isomorphic thatof present an algorithm compute agiven some numerical examples. Since complexis smaller in calculations its tend complete faster thanthose original complex.DOI :...

10.22342/jims.20.1.177.47-75 article EN Journal of the Indonesian Mathematical Society 2014-05-23

Where do firms innovate? Mapping their locations and directions in technological space is challenging due to its high dimensionality. We propose a new method characterize firms’ inventive activities via topological data analysis (TDA) that represents high-dimensional shape graph. Applying this 333 major patents 1976–2005 reveals substantial heterogeneity: some remain undifferentiated; others develop unique portfolios. Firms with trajectories, which we define measure graph-theoretically as...

10.2139/ssrn.3445703 article EN SSRN Electronic Journal 2020-01-01

While persistent homology has taken strides towards becoming a wide-spread tool for data analysis, multidimensional persistence proven more difficult to apply. One reason is the serious drawback of no longer having concise and complete descriptor analogous diagrams former. We propose simple algebraic construction illustrate existence infinite families indecomposable modules over regular grids sufficient size. On top providing constructive proof representation type, we also provide...

10.48550/arxiv.1803.05722 preprint EN other-oa arXiv (Cornell University) 2018-01-01

In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across filtration. this work, we extend setting, propose use bipath homology, which can be used to study persistence pair filtrations connected at their ends, compare two filtrations. interval-decomposability is guaranteed, provide an algorithm for computing diagrams discuss interpretation diagrams.

10.48550/arxiv.2404.02536 preprint EN arXiv (Cornell University) 2024-04-03

In recent years, the use of data-driven methods has provided insights into underlying patterns and principles behind culinary recipes. this exploratory work, we introduce topological data analysis, especially persistent homology, in order to study space particular, homology analysis provides a set recipes surrounding multiscale "holes" existing We then propose method generate novel ingredient combinations using combinatorial optimization on information. made biscuits combinations, which were...

10.48550/arxiv.2406.09445 preprint EN arXiv (Cornell University) 2024-06-11

Abstract In persistent homology analysis, interval modules play a central role in describing the birth and death of topological features across filtration. this work, we extend setting, propose use bipath , which can be used to study persistence pair filtrations connected at their ends, compare two filtrations. interval-decomposability is guaranteed, provide an algorithm for computing diagrams discuss interpretation diagrams.

10.1007/s13160-024-00681-3 article EN cc-by Japan Journal of Industrial and Applied Mathematics 2024-12-17

10.1016/j.ijgfs.2024.101088 article EN International Journal of Gastronomy and Food Science 2024-12-01

In this work, we propose a new invariant for $2$D persistence modules called the compressed multiplicity and show that it generalizes notions of dimension vector rank invariant. addition, module $M$, an "interval-decomposable replacement" $\delta^{\ast}(M)$ (in split Grothendieck group category modules), which is expressed by pair interval-decomposable modules, is, its positive negative parts. We $M$ if only equal to in group. Furthermore, even not necessarily interval-decomposable,...

10.48550/arxiv.1911.01637 preprint EN other-oa arXiv (Cornell University) 2019-01-01

We study persistence modules defined on commutative ladders. This class of frequently appears in topological data analysis, and the theory algorithm proposed this paper can be applied to these practical problems. A new algebraic framework deals with as representations associative algebras Auslander-Reiten is develop theoretical algorithmic foundations. In particular, we prove that ladders length less than 5 are representation-finite explicitly show their quivers. Furthermore, a...

10.48550/arxiv.1404.7588 preprint EN other-oa arXiv (Cornell University) 2014-01-01
Coming Soon ...