BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20200308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20201101T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20211107T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211005T090000
DTEND;TZID=America/New_York:20211005T100000
DTSTAMP:20240304T085033Z
CREATED:20240213T113617Z
LAST-MODIFIED:20240304T085033Z
UID:10002508-1633424400-1633428000@cmsa.fas.harvard.edu
SUMMARY:10/5/2021 Combinatorics\, Physics and Probability Seminar
DESCRIPTION:Title: Geodesic Geometry on Graphs \nAbstract: In a graph G = (V\, E) we consider a system of paths S so that for every two vertices u\,v in V there is a unique uv path in S connecting them. The path system is said to be consistent if it is closed under taking subpaths\, i.e. if P is a path in S then any subpath of P is also in S. Every positive weight function w: E–>R^+ gives rise to a consistent path system in G by taking the paths in S to be geodesics w.r.t. w. In this case\, we say w induces S. We say a graph G is metrizable if every consistent path system in G is induced by some such w. \nWe’ll discuss the concept of graph metrizability\, and\, in particular\, we’ll see that while metrizability is a rare property\, there exists infinitely many 2-connected metrizable graphs. \nJoint work with Nati Linial.
URL:https://cmsa.fas.harvard.edu/event/10-5-2021-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
END:VEVENT
END:VCALENDAR