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:20260422T212605Z
UID:APATG/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/2/">Wa
 sserstein Stability for Persistence Diagrams</a>\nby Katharine Turner (Aus
 tralian National University) as part of Asia Pacific Seminar on Applied To
 pology and Geometry\n\n\nAbstract\nThe stability of persistence diagrams i
 s among the most important results in applied and computational topology. 
 Most results in the literature phrase stability in terms of the bottleneck
  distance between diagrams and the infinity-norm of perturbations. This ha
 s two main implications: it makes the space of persistence diagrams rather
  pathological and it is often provides very pessimistic bounds with respec
 t to outliers. In this talk I will discuss new stability results with resp
 ect to the p-Wasserstein distance between persistence diagrams. I will giv
 e an elementary proof for the setting of functions on sufficiently finite 
 spaces in terms of the p-norm of the perturbations. I will also apply the 
 results to a wide range of applications in topological data analysis (TDA)
  including topological summaries\, persistence transforms and the special 
 but important case of Vietoris-Rips complexes. This is joint work with Pri
 moz Skraba (see https://arxiv.org/abs/2006.16824). \n\nThe assumed knowled
 ge for the talk: \n\n    The persistent homology and persistence diagram f
 or the sub-level set filtration of a real-valued function on a finite simp
 licial  complex.\n\n    The Vietoris-Rips complex of a set of points in Eu
 clidean space.\n
LOCATION:https://researchseminars.org/talk/APATG/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shu Kanazawa (Kyoto University)
DTSTART:20200821T050000Z
DTEND:20200821T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/3/">La
 w of large numbers for Betti numbers of homogeneous and spatially independ
 ent random simplicial complexes</a>\nby Shu Kanazawa (Kyoto University) as
  part of Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstra
 ct\nThe Erdős–Rényi graph model has been extensively studied since the
  1960s as a typical random graph model. Recently\, the study of random sim
 plicial complexes has drawn attention as a higher-dimensional generalizati
 on of random graphs. In this talk we introduce a class of homogeneous and 
 spatially independent random simplicial complexes\, and discuss the asympt
 otic behavior of their Betti numbers. This result extends the law of large
  numbers for Betti numbers of Linial–Meshulam complexes\, obtained in an
  earlier study by Linial and Peled. Time permitting\, we will also discuss
  the convergence of the empirical spectral distributions of their Laplacia
 ns. A key element in the argument is the local weak convergence of simplic
 ial complexes. Inspired by the work of Linial and Peled\, we establish the
  local weak limit theorem for homogeneous and spatially independent random
  simplicial complexes.\n
LOCATION:https://researchseminars.org/talk/APATG/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Paul Samuel Ignacio (University of the Philippines Baguio)
DTSTART:20200925T050000Z
DTEND:20200925T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/4/">An
 other Topological "Reading" Lesson: Classification of MNIST using Bottlene
 ck-based Statistical Features</a>\nby Paul Samuel Ignacio (University of t
 he Philippines Baguio) as part of Asia Pacific Seminar on Applied Topology
  and Geometry\n\n\nAbstract\nInspired by the work of Garin and Tauzin on t
 he classification of grayscale images using features from a wide array of 
 topological summaries\, we perform classification of the MNIST data set us
 ing only features derived from statistics on bottleneck distances. While t
 here exist several critiques on the bottleneck metric\, we show that it ca
 n be used to produce features on which machine learning algorithms\, in th
 is case a random forest\, can be trained to produce respectable accuracy.\
 n
LOCATION:https://researchseminars.org/talk/APATG/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Vijay Natarajan (Indian Institute of Science\, Bangalore)
DTSTART:20200911T050000Z
DTEND:20200911T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/7
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/7/">Ed
 it Distance between Merge Trees.</a>\nby Vijay Natarajan (Indian Institute
  of Science\, Bangalore) as part of Asia Pacific Seminar on Applied Topolo
 gy and Geometry\n\n\nAbstract\nA merge tree captures the topology of sub-l
 evel and super-level sets of a scalar function. Topological structures suc
 h as the merge tree provide an abstract and succinct representation of sci
 entific data available as a static or time-varying scalar function. They f
 acilitate effective visualization and interactive exploration of feature-r
 ich data. Comparative tasks such as visual identification of correspondenc
 e between features in the data or locating key events require a feature-aw
 are comparison measure between scalar functions. We present an approach ba
 sed on tree edit distance to compare merge trees. The comparison measure s
 atisfies metric properties\, it can be computed efficiently\, and the cost
  model for the edit operations is both intuitive and captures well-known p
 roperties of merge trees. I will introduce the distance measure\, outline 
 an algorithm for computing the measure\, and describe how the edit distanc
 e supports feature-driven analysis and visualization of time-varying scala
 r functions from CFD and 3D cryo electron microscopy data. [https://vgl.cs
 a.iisc.ac.in/pub/paper.php?pid=057]\n
LOCATION:https://researchseminars.org/talk/APATG/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tomoo Yokoyama (Kyoto University of Education)
DTSTART:20201009T050000Z
DTEND:20201009T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/8
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/8/">To
 pological flow data analysis and its applications to Reeb graphs of Morse 
 functions</a>\nby Tomoo Yokoyama (Kyoto University of Education) as part o
 f Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstract\nIn 
 this talk\, we introduce topological methods to analyze flow data. These m
 ethods are based on dynamical systems and Morse theory. So\, first\, we re
 view the results of generic embeddings of closed surfaces in the three-dim
 ensional Euclidean space and explain the relation between Morse functions 
 and Hamiltonian vector fields on surfaces. In particular\, such embeddings
  are classified by a finite complement invariant\, call a molecular. Secon
 d\, we review topological results in flows on surfaces. Third\, we review 
 our complete invariant\, called a COT representation\, of 2D Hamiltonian f
 lows\, its implementation\, and the list of all generic transitions of 2D 
 Hamiltonian flow. Moreover\, we introduce a complete invariant of 2D flows
  of finite type and their applications to industrial machines. In addition
 \, as an application of COT representations\, we list all generic transiti
 ons of Reeb graphs of Morse functions on a sphere. If time allows\, we sho
 w higher-dimensional results of flows and describe a topological character
 ization of Morse-Smale flows and a generic transitions between them.\n
LOCATION:https://researchseminars.org/talk/APATG/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Robert Adler (Technion\, Israel)
DTSTART:20201023T050000Z
DTEND:20201023T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/9
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/9/">Mo
 delling the universe\, relative and evolving persistence\, and capturing d
 ata with bagplots.</a>\nby Robert Adler (Technion\, Israel) as part of Asi
 a Pacific Seminar on Applied Topology and Geometry\n\n\nAbstract\nThis lec
 ture will be somewhat of a potpourri of (i) applications of topological co
 ncepts\, (ii) some quite general statistical methodology for analysing hom
 ological characteristics of data sets\, and (iii) a probabilistic techniqu
 e for generating almost independent\, identically distributed\, realisatio
 ns of persistence diagrams. \n\nThe applications are real\, and primarily 
 cosmological. They will be exploited (together with some much simpler toy 
 examples) to demonstrate the new methodologies and the stochastic modellin
 g. In fact\, most of the methodologies and models were originally  designe
 d for the application\, and only afterwards developed as generic tools.\n\
 nI shall assume that the listeners know what a persistence diagram is\, bu
 t no other prerequisites are required.\n
LOCATION:https://researchseminars.org/talk/APATG/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ron Rosenthal (Technion\, Israel)
DTSTART:20201204T050000Z
DTEND:20201204T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/10/">R
 andom Steiner complexes and simplical spanning trees</a>\nby Ron Rosenthal
  (Technion\, Israel) as part of Asia Pacific Seminar on Applied Topology a
 nd Geometry\n\n\nAbstract\nA spanning tree of $G$ is a subgraph of $G$ wit
 h the same vertex set as $G$ that is a tree. In 1981\, McKay proved an asy
 mptotic result regarding the number of spanning trees in random $k$-regula
 r 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\, where $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 simplicial comp
 lexes\, known as random Steiner complexes. In particular\, we will prove a
  high-dimensional counterpart of McKay's result and discuss the local limi
 t of such random complexes. \n\nBased on a joint work with Lior Tenenbaum.
 \n
LOCATION:https://researchseminars.org/talk/APATG/10/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stephen Hyde (University of Sydney)
DTSTART:20201106T050000Z
DTEND:20201106T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/11/">T
 he simplest 38 (or so) fold-classes of RNA (or DNA) by base-pairing. Knots
  and tangles from string sequences\, and sequences for knots and tangles</
 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 fold into
  'pseudo knots' in a variety of viruses.  Though true knots have not been 
 detected\, it is fair to wonder if they are likely in natural or synthetic
  biological systems.  I will explore folding of a single string of RNA int
 o double-helices\, via Watson-Crick duplexing\, allowing the possibility o
 f strand junctions\, found\, for example\, in transient Holliday junctions
  in vivo.  Further\, either parallel or antiparallel double-helices are ad
 mitted. Given some arrangement of complementary base pairs on a strand\, a
 n oriented rigid-vertex graph can be constructed which encodes the resulti
 ng fold.  Conversely\, given a fold\, we can build a graph and deduce the 
 the arrangement of complementary base pairs on the strand.    \n\nSimplest
  folds can be built by winding a single strand on oriented genus-g surface
 s formed by tubifying graphs of cyclomatic number g\, such that a duplexed
  pair of locally parallel strands wrap each tubule of the manifold. More c
 omplex folds have combinations of pairs of of tracks (2-track railways) an
 d single tracks (1\,2-track railways). 2-track railways give relaxed folds
 \, so-named as they be embedded such that all base pairs are duplexed. 1\,
 2-track railways necessarily have unduplexed hairpin-like strands within t
 he fold. It turns out that for g<4\, there are few folds among the 40 or s
 o whose double-helices are all antiparallel - the preferred orientation fo
 r RNA and DNA duplexes.\n\nA connection between folds and knots is possibl
 e via 2-track railways\, whose consequences will be discussed if time perm
 its.\n
LOCATION:https://researchseminars.org/talk/APATG/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yuichi Ike (Fujitsu Laboratories\, Japan)
DTSTART:20201218T050000Z
DTEND:20201218T060000Z
DTSTAMP:20260422T212605Z
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://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:20260422T212605Z
UID:APATG/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/13/">F
 ield choice problem in persistent homology</a>\nby Ippei Obayashi (Center 
 for Advanced Intelligence Project (AIP)\, RIKEN) as part of Asia Pacific S
 eminar on Applied Topology and Geometry\n\n\nAbstract\nMathematically\, pe
 rsistent homology is formalized on the homology vector spaces of a filtrat
 ion and linear maps between the vector spaces induced by the inclusion map
 s. By encoding the scale information in the filtration\, we can capture th
 e geometric features of data. The structure theorem of persistent homology
  ensures the existence and uniqueness of the interval decomposition. A per
 sistence diagram is given by the interval decomposition. The diagram has t
 he complete information about the algebraic structure of persistent homolo
 gy.\n\nWhen we fix the field of the homology vector spaces\, the uniquenes
 s of the decomposition is ensured. However\, the uniqueness is broken 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\nFrom the
  above examples\, the following questions naturally arise.\n\n    What con
 dition does ensure the independence of the choice of the field?\n\n    Is 
 there an efficient algorithm to check the above condition?\n\n    How ofte
 n does a persistence diagram change as the field changes?\n\nThe aim of ou
 r research is to answer the above questions. The result is published on Ar
 xiv[1]. This is joint work with M. Yoshiwaki.\n\n[1] Ippei Obayashi and Mi
 chio Yoshiwaki. Field choice problem in persistent homology. arXiv:1911.11
 350\, 2019.\n
LOCATION:https://researchseminars.org/talk/APATG/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Rolando Kindelan Nuñez (Universidad de Chile)
DTSTART:20210212T050000Z
DTEND:20210212T053000Z
DTSTAMP:20260422T212605Z
UID:APATG/14
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/14/">T
 opological Data Analysis applied to imbalanced data classification</a>\nby
  Rolando Kindelan Nuñez (Universidad de Chile) as part of Asia Pacific Se
 minar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yohai Reani (Technion)
DTSTART:20210212T053000Z
DTEND:20210212T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/15
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/15/">C
 ycle Registration in Persistent Homology with Applications in Topological 
 Bootstrap</a>\nby Yohai Reani (Technion) as part of Asia Pacific Seminar o
 n Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Lakshmi Priya M.E. (IISc\, Bangalore)
DTSTART:20210226T050000Z
DTEND:20210226T053000Z
DTSTAMP:20260422T212605Z
UID:APATG/16
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/16/">N
 odal sets of Gaussian Laplace eigenfunctions</a>\nby Lakshmi Priya M.E. (I
 ISc\, Bangalore) as part of Asia Pacific Seminar on Applied Topology and G
 eometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Niklas Hellmer (Mathematical Institute\, Polish Academy of Science
 s)
DTSTART:20210226T053000Z
DTEND:20210226T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/17
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/17/">D
 iscrete Prokhorov Metric for Persistence Diagrams</a>\nby Niklas Hellmer (
 Mathematical Institute\, Polish Academy of Sciences) as part of Asia Pacif
 ic Seminar on Applied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Adélie Garin (EPFL)
DTSTART:20210312T050000Z
DTEND:20210312T053000Z
DTSTAMP:20260422T212605Z
UID:APATG/18
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/18/">F
 rom Trees to Barcodes and Back Again</a>\nby Adélie Garin (EPFL) as part 
 of Asia Pacific Seminar on Applied Topology and Geometry\n\nAbstract: TBA\
 n
LOCATION:https://researchseminars.org/talk/APATG/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Chenguang Xu (Kyoto University)
DTSTART:20210312T053000Z
DTEND:20210312T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/19
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/19/">A
  correspondence between Schubert cells and persistence diagrams</a>\nby Ch
 enguang Xu (Kyoto University) as part of Asia Pacific Seminar on Applied T
 opology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hiroshi Takeuchi (Shiga University\, Japan)
DTSTART:20210326T050000Z
DTEND:20210326T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/20
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/20/">T
 he persistent homology of a sampled map: on failed reconstructions</a>\nby
  Hiroshi Takeuchi (Shiga University\, Japan) as part of Asia Pacific Semin
 ar on Applied Topology and Geometry\n\n\nAbstract\nThis talk introduces a 
 filtration analysis of sampled maps based on persistent homology. The aim 
 is to reconstruct the underlying maps. The key idea is to extend the defin
 ition of homology-induced maps of correspondences using quiver representat
 ions. Our definition of homology-induced maps is given by the most persist
 ent direct summands of representations. The direct summands uniquely deter
 mine a persistent homology for a sampled map. Compared to existing methods
  using eigenspace functors\, our filtration analysis represents an importa
 nt advantage that no prior information related to the eigenvalues of the u
 nderlying map is required. However\, our reconstruction method does not al
 ways work. In this talk\, we focus on examples of failed reconstructions.\
 n\nThis talk is based on the paper DOI:10.1007/s41468-021-00065-3 (in pres
 s). The preprint is available at arXiv:1810.11774.\n
LOCATION:https://researchseminars.org/talk/APATG/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Maurizia Rossi (University of Milano-Bicocca)
DTSTART:20210423T050000Z
DTEND:20210423T060000Z
DTSTAMP:20260422T212605Z
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://researchseminars.org/talk/APATG/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Benedikt Kolbe (INRIA\, Nancy)
DTSTART:20210416T050000Z
DTEND:20210416T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/22
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/22/">T
 he mapping class group\, hyperbolic tilings\, and structures in three-dime
 nsional Euclidean space</a>\nby Benedikt Kolbe (INRIA\, Nancy) as part of 
 Asia Pacific Seminar on Applied Topology and Geometry\n\n\nAbstract\nWe di
 scuss some recent breakthroughs concerning an inherently interdisciplinary
  project between mathematicians\, physicists\, chemists\, and computer sci
 entists that attempts to produce structures in three-dimensional Euclidean
  space from graph embeddings on triply-periodic minimal surfaces. The mapp
 ing class group (MCG) of a surface is the group of homeomorphisms of the s
 urface modulo isotopies of the surface. It has a long history in topology 
 and represents an active area of research. We present in this talk a recen
 t new application of MCGs relevant for crystallography\, materials science
 \, structure formation\, and knot theory. We first explain the necessary s
 et-up for the construction of candidates for new crystalline structures fr
 om graph embeddings on surfaces\, where intrinsically hyperbolic triply-pe
 riodic minimal surfaces in three-dimensional Euclidean space are used as a
  scaffold for promising three-periodic structures. We then give an overvie
 w of new results on MCGs that facilitates an enumeration of isotopy classe
 s of graph embeddings with a given group of symmetries. Lastly\, we presen
 t a catalogue of three-dimensional structures that have resulted from this
  project and explain some of the difficulties involved as well as future d
 irections.\n
LOCATION:https://researchseminars.org/talk/APATG/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sonia Mahmoudi (Tohoku University)
DTSTART:20210507T050000Z
DTEND:20210507T053000Z
DTSTAMP:20260422T212605Z
UID:APATG/23
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/23/">A
  topological introduction to define\, construct and classify a class of we
 aves</a>\nby Sonia Mahmoudi (Tohoku University) as part of Asia Pacific Se
 minar on Applied Topology and Geometry\n\n\nAbstract\nFrom innovative wove
 n artificial muscles to garments made from traditional woven fabrics\, wea
 vings are historically well-known structures. Research on this subject is 
 still very active in materials science\, but it is very recent in mathemat
 ics. The study of weavings as new mathematical objects is very interesting
  in itself but also as an interdisciplinary project\, with the aim of bett
 er understanding their geometric and topological structure\, often associa
 ted with physical properties. This talk attempts to introduce weavings fro
 m a point of view of low dimensional topology. First\, a formal definition
  of Euclidean and hyperbolic weavings will be stated\, as well as a constr
 uction method based on the transformation of periodic uniform tilings. Nex
 t\, an idea of classification for alternating structures will be discussed
 \, extending some classical results of knot theory such as the bracket pol
 ynomial and Tait's conjectures.\n
LOCATION:https://researchseminars.org/talk/APATG/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yossi Bokor (Australian National University\, University of Sydney
 )
DTSTART:20210507T053000Z
DTEND:20210507T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/24
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/24/">T
 owards Stratified Space Learning: An Algorithm for Learning Linearly Embed
 ded Graphs</a>\nby Yossi Bokor (Australian National University\, Universit
 y of Sydney) as part of Asia Pacific Seminar on Applied Topology and Geome
 try\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Yusu Wang (UC San Diego)
DTSTART:20210521T050000Z
DTEND:20210521T060000Z
DTSTAMP:20260422T212605Z
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://researchseminars.org/talk/APATG/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Kelin Xia (Nanyang Technological University)
DTSTART:20210917T040000Z
DTEND:20210917T050000Z
DTSTAMP:20260422T212605Z
UID:APATG/26
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/26/">P
 ersistent function based machine learning for drug design</a>\nby Kelin Xi
 a (Nanyang Technological University) as part of Asia Pacific Seminar on Ap
 plied Topology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Christian Hirsch (University of Groningen\, Netherlands)
DTSTART:20211001T050000Z
DTEND:20211001T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/27
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/27/">S
 implicial percolation</a>\nby Christian Hirsch (University of Groningen\, 
 Netherlands) as part of Asia Pacific Seminar on Applied Topology and Geome
 try\n\n\nAbstract\nThis talk introduces weak and strong simplicial percola
 tion as models for continuum percolation based on random simplicial comple
 xes in Euclidean space. Weak simplicial percolation is defined through inf
 inite sequences of k-simplices sharing a (k-1)-dimensional face. In contra
 st\, strong simplicial demands the existence of an infinite k-surface\, th
 ereby generalizing the lattice notion of plaquette percolation. We discuss
  the sharp phase transition for weak simplicial percolation and derive sev
 eral relationships between weak simplicial percolation\, strong simplicial
  percolation\, and classical vacant continuum percolation. We will also dr
 aw connections to a variety of topological models for percolation that hav
 e been proposed recently in the literature. This talk is based on joint wo
 rk with Daniel Valesin.\n
LOCATION:https://researchseminars.org/talk/APATG/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Tomoki Uda (Tohoku University)
DTSTART:20211105T050000Z
DTEND:20211105T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/28
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/28/">O
 n Interleaving Distance between Reeb Trees as 𝑹-Pospaces</a>\nby Tomoki
  Uda (Tohoku University) as part of Asia Pacific Seminar on Applied Topolo
 gy and Geometry\n\n\nAbstract\nA Reeb graph is one of the mathematical too
 ls to summarize topology of real-valued functions. Silva\, Munch and Patel
  proposed the interleaving distance between two Reeb graphs as 𝑹-spaces
 . Although this metric is useful to show the stability\, the estimation is
  rough in terms of data resolution. In this talk we will introduce an inte
 rleaving 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 compatibility
  of both topology and order\, we can achieve sharp evaluation by incorpora
 ting data resolutions as discrete order structures\, while maintaining the
  comparison of “soft” topological structures of trees. Furthermore\, t
 he metric can compare discrete and/or continuous structured 𝑹-pospaces\
 , which is expected to be useful for evaluating the convergence.\n
LOCATION:https://researchseminars.org/talk/APATG/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Koushik Ramachandran (TIFR-CAM\,  Bangalore)
DTSTART:20220204T050000Z
DTEND:20220204T060000Z
DTSTAMP:20260422T212605Z
UID:APATG/29
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/APATG/29/">O
 n the geometry and topology of random lemniscates</a>\nby Koushik Ramachan
 dran (TIFR-CAM\,  Bangalore) as part of Asia Pacific Seminar on Applied To
 pology and Geometry\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/APATG/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shizuo Kaji (Kyushu University)
DTSTART:20220304T040000Z
DTEND:20220304T050000Z
DTSTAMP:20260422T212605Z
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://researchseminars.org/talk/APATG/30/
END:VEVENT
END:VCALENDAR
