BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CDAR - ECPv4.6.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CDAR
X-ORIGINAL-URL:http://cdar.berkeley.edu
X-WR-CALDESC:Events for CDAR
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20181016T110000
DTEND;TZID=America/Los_Angeles:20181016T123000
DTSTAMP:20190626T115357
CREATED:20180809T170111Z
LAST-MODIFIED:20181016T161612Z
UID:3960-1539687600-1539693000@cdar.berkeley.edu
SUMMARY:Tingyue Gan\, UC Berkeley: Asymptotic Spectral Analysis of Markov Chains with Rare Transitions: A Graph-Algorithmic Approach
DESCRIPTION:Parameter-dependent Markov chains with exponentially small transition rates arise in modeling complex systems in physics\, chemistry\, and biology. Such processes often manifest metastability\, and the spectral properties of the generators largely govern their long-term dynamics. In this work\, we propose a constructive graph-algorithmic approach to computing the asymptotic estimates of eigenvalues and eigenvectors of the generator. In particular\, we introduce the concepts of the hierarchy of Typical Transition Graphs and the associated sequence of Characteristic Timescales. Typical Transition Graphs can be viewed as a unification of Wentzellâ€™s hierarchy of optimal W-graphs and Friedlinâ€™s hierarchy of Markov chains\, and they are capable of describing typical escapes from metastable classes as well as cyclic behaviors within metastable classes\, for both reversible and irreversible processes. We apply the proposed approach to conduct zero-temperature asymptotic analysis of the stochastic network representing the energy landscape of the Lennard-Jones cluster of 75 atoms. \n\n\n\nDownload the slides from this presentation: 20181016_riskseminar\n\n\n\n\n\n\n\n\n\n\n
URL:http://cdar.berkeley.edu/event/tingyue-gan-university-of-maryland/
CATEGORIES:Fall 2018 Seminar
END:VEVENT
END:VCALENDAR