BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Claremont Center for the Mathematical Sciences - ECPv6.15.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://colleges.claremont.edu/ccms
X-WR-CALDESC:Events for Claremont Center for the Mathematical Sciences
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20240430T150000
DTEND;TZID=America/Los_Angeles:20240430T160000
DTSTAMP:20260430T111241
CREATED:20240131T040741Z
LAST-MODIFIED:20240131T040741Z
UID:3371-1714489200-1714492800@colleges.claremont.edu
SUMMARY:Claremont Topology Seminar: Elena Wang (Michigan State University)
DESCRIPTION:We welcome all undergraduates and graduate students to attend topology seminar! \nSpeaker: Elena Wang (Michigan State University) \nTitle: A Distance for Geometric Graphs via the Labeled Merge Tree Interleaving Distance \nAbstract: Geometric graphs appear in many real-world data sets\, such as road networks\, sensor networks\, and molecules. We investigate the notion of distance between graphs and present a metric to measure the distance between two geometric graphs via merge trees. In order to preserve as much useful information as possible from the original data\, we introduce a way of rotating the sublevel set to obtain the merge trees via the idea of the directional transform. We represent the merge trees using a surjective multi-labeling scheme\, and then compute the distance between two representative matrices. Our distance not only has theoretically desirable qualities but can also be approximated in polynomial time. We illustrate its utility by implementation on a Passiflora leaf data set.
URL:https://colleges.claremont.edu/ccms/event/claremont-topology-seminar-elena-wang-michigan-state-university/
LOCATION:Estella 2099
CATEGORIES:Topology Seminar
ORGANIZER;CN="Bahar Acu":MAILTO:Bahar_Acu@pitzer.edu
END:VEVENT
END:VCALENDAR