BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Katharine Turner (Australian National University)
DTSTART:20200807T050000Z
DTEND:20200807T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /2/">Wasserstein Stability for Persistence Diagrams</a>\nby Katharine Turn
 er (Australian National University) as part of Asia Pacific Seminar on App
 lied Topology and Geometry\n\n\nAbstract\nThe stability of persistence dia
 grams is among the most important results in applied and computational top
 ology. Most results in the literature phrase stability in terms of the bot
 tleneck distance between diagrams and the infinity-norm of perturbations. 
 This has two main implications: it makes the space of persistence diagrams
  rather pathological and it is often provides very pessimistic bounds with
  respect to outliers. In this talk I will discuss new stability results wi
 th respect to the p-Wasserstein distance between persistence diagrams. I w
 ill give an elementary proof for the setting of functions on sufficiently 
 finite spaces in terms of the p-norm of the perturbations. I will also app
 ly the results to a wide range of applications in topological data analysi
 s (TDA) including topological summaries\, persistence transforms and the s
 pecial but important case of Vietoris-Rips complexes. This is joint work w
 ith Primoz Skraba (see https://arxiv.org/abs/2006.16824). \n\nThe assumed 
 knowledge for the talk: \n\n    The persistent homology and persistence di
 agram for the sub-level set filtration of a real-valued function on a fini
 te simplicial  complex.\n\n    The Vietoris-Rips complex of a set of point
 s in Euclidean space.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shu Kanazawa (Kyoto University)
DTSTART:20200821T050000Z
DTEND:20200821T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /3/">Law of large numbers for Betti numbers of homogeneous and spatially i
 ndependent random simplicial complexes</a>\nby Shu Kanazawa (Kyoto Univers
 ity) as part of Asia Pacific Seminar on Applied Topology and Geometry\n\n\
 nAbstract\nThe Erdős–Rényi graph model has been extensively studied si
 nce the 1960s as a typical random graph model. Recently\, the study of ran
 dom simplicial complexes has drawn attention as a higher-dimensional gener
 alization of random graphs. In this talk we introduce a class of homogeneo
 us and spatially independent random simplicial complexes\, and discuss the
  asymptotic behavior of their Betti numbers. This result extends the law o
 f large numbers for Betti numbers of Linial–Meshulam complexes\, obtaine
 d in an earlier study by Linial and Peled. Time permitting\, we will also 
 discuss the convergence of the empirical spectral distributions of their L
 aplacians. A key element in the argument is the local weak convergence of 
 simplicial complexes. Inspired by the work of Linial and Peled\, we establ
 ish the local weak limit theorem for homogeneous and spatially independent
  random simplicial complexes.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Samuel Ignacio (University of the Philippines Baguio)
DTSTART:20200925T050000Z
DTEND:20200925T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /4/">Another Topological "Reading" Lesson: Classification of MNIST using B
 ottleneck-based Statistical Features</a>\nby Paul Samuel Ignacio (Universi
 ty of the Philippines Baguio) as part of Asia Pacific Seminar on Applied T
 opology and Geometry\n\n\nAbstract\nInspired by the work of Garin and Tauz
 in on the classification of grayscale images using features from a wide ar
 ray of topological summaries\, we perform classification of the MNIST data
  set using only features derived from statistics on bottleneck distances. 
 While there exist several critiques on the bottleneck metric\, we show tha
 t it can be used to produce features on which machine learning algorithms\
 , in this case a random forest\, can be trained to produce respectable acc
 uracy.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vijay Natarajan (Indian Institute of Science\, Bangalore)
DTSTART:20200911T050000Z
DTEND:20200911T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/7
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /7/">Edit Distance between Merge Trees.</a>\nby Vijay Natarajan (Indian In
 stitute of Science\, Bangalore) as part of Asia Pacific Seminar on Applied
  Topology and Geometry\n\n\nAbstract\nA merge tree captures the topology o
 f sub-level and super-level sets of a scalar function. Topological structu
 res such as the merge tree provide an abstract and succinct representation
  of scientific data available as a static or time-varying scalar function.
  They facilitate effective visualization and interactive exploration of fe
 ature-rich data. Comparative tasks such as visual identification of corres
 pondence between features in the data or locating key events require a fea
 ture-aware comparison measure between scalar functions. We present an appr
 oach based on tree edit distance to compare merge trees. The comparison me
 asure satisfies metric properties\, it can be computed efficiently\, and t
 he cost model for the edit operations is both intuitive and captures well-
 known properties of merge trees. I will introduce the distance measure\, o
 utline an algorithm for computing the measure\, and describe how the edit 
 distance supports feature-driven analysis and visualization of time-varyin
 g scalar functions from CFD and 3D cryo electron microscopy data. [https:/
 /vgl.csa.iisc.ac.in/pub/paper.php?pid=057]\n
LOCATION:https://stable.researchseminars.org/talk/APATG/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tomoo Yokoyama (Kyoto University of Education)
DTSTART:20201009T050000Z
DTEND:20201009T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/8
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /8/">Topological flow data analysis and its applications to Reeb graphs of
  Morse functions</a>\nby Tomoo Yokoyama (Kyoto University of Education) as
  part of Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstra
 ct\nIn this talk\, we introduce topological methods to analyze flow data. 
 These methods are based on dynamical systems and Morse theory. So\, first\
 , we review the results of generic embeddings of closed surfaces in the th
 ree-dimensional Euclidean space and explain the relation between Morse fun
 ctions and Hamiltonian vector fields on surfaces. In particular\, such emb
 eddings are classified by a finite complement invariant\, call a molecular
 . Second\, we review topological results in flows on surfaces. Third\, we 
 review our complete invariant\, called a COT representation\, of 2D Hamilt
 onian flows\, its implementation\, and the list of all generic transitions
  of 2D Hamiltonian flow. Moreover\, we introduce a complete invariant of 2
 D flows of finite type and their applications to industrial machines. In a
 ddition\, as an application of COT representations\, we list all generic t
 ransitions of Reeb graphs of Morse functions on a sphere. If time allows\,
  we show higher-dimensional results of flows and describe a topological ch
 aracterization of Morse-Smale flows and a generic transitions between them
 .\n
LOCATION:https://stable.researchseminars.org/talk/APATG/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Adler (Technion\, Israel)
DTSTART:20201023T050000Z
DTEND:20201023T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/9
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /9/">Modelling the universe\, relative and evolving persistence\, and capt
 uring data with bagplots.</a>\nby Robert Adler (Technion\, Israel) as part
  of Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstract\nT
 his lecture will be somewhat of a potpourri of (i) applications of topolog
 ical concepts\, (ii) some quite general statistical methodology for analys
 ing homological characteristics of data sets\, and (iii) a probabilistic t
 echnique for generating almost independent\, identically distributed\, rea
 lisations of persistence diagrams. \n\nThe applications are real\, and pri
 marily cosmological. They will be exploited (together with some much simpl
 er toy examples) to demonstrate the new methodologies and the stochastic m
 odelling. In fact\, most of the methodologies and models were originally  
 designed for the application\, and only afterwards developed as generic to
 ols.\n\nI shall assume that the listeners know what a persistence diagram 
 is\, but no other prerequisites are required.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ron Rosenthal (Technion\, Israel)
DTSTART:20201204T050000Z
DTEND:20201204T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/10
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /10/">Random Steiner complexes and simplical spanning trees</a>\nby Ron Ro
 senthal (Technion\, Israel) as part of Asia Pacific Seminar on Applied Top
 ology and Geometry\n\n\nAbstract\nA spanning tree of $G$ is a subgraph of 
 $G$ with the same vertex set as $G$ that is a tree. In 1981\, McKay proved
  an asymptotic result regarding the number of spanning trees in random $k$
 -regular graphs\, showing that the number of spanning trees $\\kappa_1(G_n
 )$ in a random $k$-regular graph on $n$ vertices satisfies $\\lim_{n\\to\\
 infty}\\Big( \\kappa_{1}(G_n) \\Big)^{1/n}=c_{1\,k}$ in probability\, wher
 e $c_{1\,k}= \\frac{(k-1)^{k-1}}{(k^2-2k)^{\\frac{k-2}{2}}}$. \n\nIn this 
 talk we will discuss a high-dimensional of the matching model for simplici
 al complexes\, known as random Steiner complexes. In particular\, we will 
 prove a high-dimensional counterpart of McKay's result and discuss the loc
 al limit of such random complexes. \n\nBased on a joint work with Lior Ten
 enbaum.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stephen Hyde (University of Sydney)
DTSTART:20201106T050000Z
DTEND:20201106T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/11
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /11/">The simplest 38 (or so) fold-classes of RNA (or DNA) by base-pairing
 . Knots and tangles from string sequences\, and sequences for knots and ta
 ngles</a>\nby Stephen Hyde (University of Sydney) as part of Asia Pacific 
 Seminar on Applied Topology and Geometry\n\n\nAbstract\nRNA is known to fo
 ld into 'pseudo knots' in a variety of viruses.  Though true knots have no
 t been detected\, it is fair to wonder if they are likely in natural or sy
 nthetic biological systems.  I will explore folding of a single string of 
 RNA into double-helices\, via Watson-Crick duplexing\, allowing the possib
 ility of strand junctions\, found\, for example\, in transient Holliday ju
 nctions in vivo.  Further\, either parallel or antiparallel double-helices
  are admitted. Given some arrangement of complementary base pairs on a str
 and\, an oriented rigid-vertex graph can be constructed which encodes the 
 resulting fold.  Conversely\, given a fold\, we can build a graph and dedu
 ce the the arrangement of complementary base pairs on the strand.    \n\nS
 implest folds can be built by winding a single strand on oriented genus-g 
 surfaces formed by tubifying graphs of cyclomatic number g\, such that a d
 uplexed pair of locally parallel strands wrap each tubule of the manifold.
  More complex folds have combinations of pairs of of tracks (2-track railw
 ays) and single tracks (1\,2-track railways). 2-track railways give relaxe
 d folds\, so-named as they be embedded such that all base pairs are duplex
 ed. 1\,2-track railways necessarily have unduplexed hairpin-like strands w
 ithin the fold. It turns out that for g<4\, there are few folds among the 
 40 or so whose double-helices are all antiparallel - the preferred orienta
 tion for RNA and DNA duplexes.\n\nA connection between folds and knots is 
 possible via 2-track railways\, whose consequences will be discussed if ti
 me permits.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yuichi Ike (Fujitsu Laboratories\, Japan)
DTSTART:20201218T050000Z
DTEND:20201218T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/12
DESCRIPTION:by Yuichi Ike (Fujitsu Laboratories\, Japan) as part of Asia P
 acific Seminar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ippei Obayashi (Center for Advanced Intelligence Project (AIP)\, R
 IKEN)
DTSTART:20201120T050000Z
DTEND:20201120T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/13
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /13/">Field choice problem in persistent homology</a>\nby Ippei Obayashi (
 Center for Advanced Intelligence Project (AIP)\, RIKEN) as part of Asia Pa
 cific Seminar on Applied Topology and Geometry\n\n\nAbstract\nMathematical
 ly\, persistent homology is formalized on the homology vector spaces of a 
 filtration and linear maps between the vector spaces induced by the inclus
 ion maps. By encoding the scale information in the filtration\, we can cap
 ture the geometric features of data. The structure theorem of persistent h
 omology ensures the existence and uniqueness of the interval decomposition
 . A persistence diagram is given by the interval decomposition. The diagra
 m has the complete information about the algebraic structure of persistent
  homology.\n\nWhen we fix the field of the homology vector spaces\, the un
 iqueness of the decomposition is ensured. However\, the uniqueness is brok
 en when the field is changed. One easy example is a filtration including a
  Klein bottle. A more interesting example is given by a Möbius ring.\n\nF
 rom the above examples\, the following questions naturally arise.\n\n    W
 hat condition does ensure the independence of the choice of the field?\n\n
     Is there an efficient algorithm to check the above condition?\n\n    H
 ow often does a persistence diagram change as the field changes?\n\nThe ai
 m of our research is to answer the above questions. The result is publishe
 d on Arxiv[1]. This is joint work with M. Yoshiwaki.\n\n[1] Ippei Obayashi
  and Michio Yoshiwaki. Field choice problem in persistent homology. arXiv:
 1911.11350\, 2019.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rolando Kindelan Nuñez (Universidad de Chile)
DTSTART:20210212T050000Z
DTEND:20210212T053000Z
DTSTAMP:20260404T094507Z
UID:APATG/14
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /14/">Topological Data Analysis applied to imbalanced data classification<
 /a>\nby Rolando Kindelan Nuñez (Universidad de Chile) as part of Asia Pac
 ific Seminar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yohai Reani (Technion)
DTSTART:20210212T053000Z
DTEND:20210212T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/15
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /15/">Cycle Registration in Persistent Homology with Applications in Topol
 ogical Bootstrap</a>\nby Yohai Reani (Technion) as part of Asia Pacific Se
 minar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lakshmi Priya M.E. (IISc\, Bangalore)
DTSTART:20210226T050000Z
DTEND:20210226T053000Z
DTSTAMP:20260404T094507Z
UID:APATG/16
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /16/">Nodal sets of Gaussian Laplace eigenfunctions</a>\nby Lakshmi Priya 
 M.E. (IISc\, Bangalore) as part of Asia Pacific Seminar on Applied Topolog
 y and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Niklas Hellmer (Mathematical Institute\, Polish Academy of Science
 s)
DTSTART:20210226T053000Z
DTEND:20210226T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/17
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /17/">Discrete Prokhorov Metric for Persistence Diagrams</a>\nby Niklas He
 llmer (Mathematical Institute\, Polish Academy of Sciences) as part of Asi
 a Pacific Seminar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Adélie Garin (EPFL)
DTSTART:20210312T050000Z
DTEND:20210312T053000Z
DTSTAMP:20260404T094507Z
UID:APATG/18
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /18/">From Trees to Barcodes and Back Again</a>\nby Adélie Garin (EPFL) a
 s part of Asia Pacific Seminar on Applied Topology and Geometry\n\nAbstrac
 t: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chenguang Xu (Kyoto University)
DTSTART:20210312T053000Z
DTEND:20210312T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/19
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /19/">A correspondence between Schubert cells and persistence diagrams</a>
 \nby Chenguang Xu (Kyoto University) as part of Asia Pacific Seminar on Ap
 plied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hiroshi Takeuchi (Shiga University\, Japan)
DTSTART:20210326T050000Z
DTEND:20210326T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/20
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /20/">The persistent homology of a sampled map: on failed reconstructions<
 /a>\nby Hiroshi Takeuchi (Shiga University\, Japan) as part of Asia Pacifi
 c Seminar on Applied Topology and Geometry\n\n\nAbstract\nThis talk introd
 uces a filtration analysis of sampled maps based on persistent homology. T
 he aim is to reconstruct the underlying maps. The key idea is to extend th
 e definition of homology-induced maps of correspondences using quiver repr
 esentations. Our definition of homology-induced maps is given by the most 
 persistent direct summands of representations. The direct summands uniquel
 y determine a persistent homology for a sampled map. Compared to existing 
 methods using eigenspace functors\, our filtration analysis represents an 
 important advantage that no prior information related to the eigenvalues o
 f the underlying map is required. However\, our reconstruction method does
  not always work. In this talk\, we focus on examples of failed reconstruc
 tions.\n\nThis talk is based on the paper DOI:10.1007/s41468-021-00065-3 (
 in press). The preprint is available at arXiv:1810.11774.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maurizia Rossi (University of Milano-Bicocca)
DTSTART:20210423T050000Z
DTEND:20210423T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/21
DESCRIPTION:by Maurizia Rossi (University of Milano-Bicocca) as part of As
 ia Pacific Seminar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benedikt Kolbe (INRIA\, Nancy)
DTSTART:20210416T050000Z
DTEND:20210416T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/22
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /22/">The mapping class group\, hyperbolic tilings\, and structures in thr
 ee-dimensional Euclidean space</a>\nby Benedikt Kolbe (INRIA\, Nancy) as p
 art of Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstract
 \nWe discuss some recent breakthroughs concerning an inherently interdisci
 plinary project between mathematicians\, physicists\, chemists\, and compu
 ter scientists that attempts to produce structures in three-dimensional Eu
 clidean space from graph embeddings on triply-periodic minimal surfaces. T
 he mapping class group (MCG) of a surface is the group of homeomorphisms o
 f the surface modulo isotopies of the surface. It has a long history in to
 pology and represents an active area of research. We present in this talk 
 a recent new application of MCGs relevant for crystallography\, materials 
 science\, structure formation\, and knot theory. We first explain the nece
 ssary set-up for the construction of candidates for new crystalline struct
 ures from graph embeddings on surfaces\, where intrinsically hyperbolic tr
 iply-periodic minimal surfaces in three-dimensional Euclidean space are us
 ed as a scaffold for promising three-periodic structures. We then give an 
 overview of new results on MCGs that facilitates an enumeration of isotopy
  classes of graph embeddings with a given group of symmetries. Lastly\, we
  present a catalogue of three-dimensional structures that have resulted fr
 om this project and explain some of the difficulties involved as well as f
 uture directions.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sonia Mahmoudi (Tohoku University)
DTSTART:20210507T050000Z
DTEND:20210507T053000Z
DTSTAMP:20260404T094507Z
UID:APATG/23
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /23/">A topological introduction to define\, construct and classify a clas
 s of weaves</a>\nby Sonia Mahmoudi (Tohoku University) as part of Asia Pac
 ific Seminar on Applied Topology and Geometry\n\n\nAbstract\nFrom innovati
 ve woven artificial muscles to garments made from traditional woven fabric
 s\, weavings are historically well-known structures. Research on this subj
 ect is still very active in materials science\, but it is very recent in m
 athematics. The study of weavings as new mathematical objects is very inte
 resting in itself but also as an interdisciplinary project\, with the aim 
 of better understanding their geometric and topological structure\, often 
 associated with physical properties. This talk attempts to introduce weavi
 ngs from a point of view of low dimensional topology. First\, a formal def
 inition of Euclidean and hyperbolic weavings will be stated\, as well as a
  construction method based on the transformation of periodic uniform tilin
 gs. Next\, an idea of classification for alternating structures will be di
 scussed\, extending some classical results of knot theory such as the brac
 ket polynomial and Tait's conjectures.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yossi Bokor (Australian National University\, University of Sydney
 )
DTSTART:20210507T053000Z
DTEND:20210507T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/24
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /24/">Towards Stratified Space Learning: An Algorithm for Learning Linearl
 y Embedded Graphs</a>\nby Yossi Bokor (Australian National University\, Un
 iversity of Sydney) as part of Asia Pacific Seminar on Applied Topology an
 d Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yusu Wang (UC San Diego)
DTSTART:20210521T050000Z
DTEND:20210521T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/25
DESCRIPTION:by Yusu Wang (UC San Diego) as part of Asia Pacific Seminar on
  Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kelin Xia (Nanyang Technological University)
DTSTART:20210917T040000Z
DTEND:20210917T050000Z
DTSTAMP:20260404T094507Z
UID:APATG/26
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /26/">Persistent function based machine learning for drug design</a>\nby K
 elin Xia (Nanyang Technological University) as part of Asia Pacific Semina
 r on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Hirsch (University of Groningen\, Netherlands)
DTSTART:20211001T050000Z
DTEND:20211001T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/27
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /27/">Simplicial percolation</a>\nby Christian Hirsch (University of Groni
 ngen\, Netherlands) as part of Asia Pacific Seminar on Applied Topology an
 d Geometry\n\n\nAbstract\nThis talk introduces weak and strong simplicial 
 percolation as models for continuum percolation based on random simplicial
  complexes in Euclidean space. Weak simplicial percolation is defined thro
 ugh infinite sequences of k-simplices sharing a (k-1)-dimensional face. In
  contrast\, strong simplicial demands the existence of an infinite k-surfa
 ce\, thereby generalizing the lattice notion of plaquette percolation. We 
 discuss the sharp phase transition for weak simplicial percolation and der
 ive several relationships between weak simplicial percolation\, strong sim
 plicial percolation\, and classical vacant continuum percolation. We will 
 also draw connections to a variety of topological models for percolation t
 hat have been proposed recently in the literature. This talk is based on j
 oint work with Daniel Valesin.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tomoki Uda (Tohoku University)
DTSTART:20211105T050000Z
DTEND:20211105T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/28
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /28/">On Interleaving Distance between Reeb Trees as 𝑹-Pospaces</a>\nby
  Tomoki Uda (Tohoku University) as part of Asia Pacific Seminar on Applied
  Topology and Geometry\n\n\nAbstract\nA Reeb graph is one of the mathemati
 cal tools to summarize topology of real-valued functions. Silva\, Munch an
 d Patel proposed the interleaving distance between two Reeb graphs as 𝑹
 -spaces. Although this metric is useful to show the stability\, the estima
 tion is rough in terms of data resolution. In this talk we will introduce 
 an interleaving distance between tree pospaces\, which can be also used to
  prove the stability of Reeb trees. A pospace\, a partially ordered space\
 , is a poset endowed with a compatible topology. By considering the compat
 ibility of both topology and order\, we can achieve sharp evaluation by in
 corporating data resolutions as discrete order structures\, while maintain
 ing the comparison of “soft” topological structures of trees. Furtherm
 ore\, the metric can compare discrete and/or continuous structured 𝑹-po
 spaces\, which is expected to be useful for evaluating the convergence.\n
LOCATION:https://stable.researchseminars.org/talk/APATG/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Koushik Ramachandran (TIFR-CAM\,  Bangalore)
DTSTART:20220204T050000Z
DTEND:20220204T060000Z
DTSTAMP:20260404T094507Z
UID:APATG/29
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/APATG
 /29/">On the geometry and topology of random lemniscates</a>\nby Koushik R
 amachandran (TIFR-CAM\,  Bangalore) as part of Asia Pacific Seminar on App
 lied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shizuo Kaji (Kyushu University)
DTSTART:20220304T040000Z
DTEND:20220304T050000Z
DTSTAMP:20260404T094507Z
UID:APATG/30
DESCRIPTION:by Shizuo Kaji (Kyushu University) as part of Asia Pacific Sem
 inar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/APATG/30/
END:VEVENT
END:VCALENDAR
