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:20211123T093000
DTEND;TZID=America/New_York:20211123T103000
DTSTAMP:20240226T111143Z
CREATED:20240213T065330Z
LAST-MODIFIED:20240226T111143Z
UID:10002138-1637659800-1637663400@cmsa.fas.harvard.edu
SUMMARY:Prague dimension of random graphs
DESCRIPTION:Abstract: The Prague dimension of graphs was introduced by Nesetril\, Pultr and Rodl in the 1970s: as a combinatorial measure of complexity\, it is closely related to clique edges coverings and partitions. Proving a conjecture of Furedi and Kantor\, we show that the Prague dimension of the binomial random graph is typically of order n/(log n) for constant edge-probabilities. The main new proof ingredient is a Pippenger-Spencer type edge-coloring result for random hypergraphs with large uniformities\, i.e.\, edges of size O(log n).
URL:https://cmsa.fas.harvard.edu/event/11-23-21-combinatorics-physics-and-probability-seminar/
CATEGORIES:Combinatorics Physics and Probability
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Combinatorics-Physics-and-Probability-Seminar-11.23.21-1.png
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20211130T093000
DTEND;TZID=America/New_York:20211130T103000
DTSTAMP:20240213T065738Z
CREATED:20240213T065738Z
LAST-MODIFIED:20240213T065738Z
UID:10002146-1638264600-1638268200@cmsa.fas.harvard.edu
SUMMARY:Resistance curvature – a new discrete curvature on graphs
DESCRIPTION:Abstract: The last few decades have seen a surge of interest in building towards a theory of discrete curvature that attempts to translate the key properties of curvature in differential geometry to the setting of discrete objects and spaces. In the case of graphs there have been several successful proposals\, for instance by Lin-Lu-Yau\, Forman and Ollivier\, that replicate important curvature theorems and have inspired applications in a variety of practical settings.\nIn this talk\, I will introduce a new notion of discrete curvature on graphs\, which we call the resistance curvature\, and discuss some of its basic properties. The resistance curvature is defined based on the concept of effective resistance which is a metric between the vertices of a graph and has many other properties such as a close relation to random spanning trees. The rich theory of these effective resistances allows to study the resistance curvature in great detail; I will for instance show that “Lin-Lu-Yau >= resistance >= Forman curvature” in a specific sense\, show strong evidence that the resistance curvature converges to zero in expectation for Euclidean random graphs\, and give a connectivity theorem for positively curved graphs. The resistance curvature also has a naturally associated discrete Ricci flow which is a gradient flow and has a closed-form solution in the case of vertex-transitive and path graphs.\nFinally\, if time permits I will draw a connection with the geometry of hyperacute simplices\, following the work of Miroslav Fiedler.\nThis work was done in collaboration with Renaud Lambiotte.
URL:https://cmsa.fas.harvard.edu/event/resistance-curvature-a-new-discrete-curvature-on-graphs/
CATEGORIES:Combinatorics Physics and Probability
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Combinatorics-Physics-and-Probability-Seminar-11.30.2021-1.png
END:VEVENT
END:VCALENDAR