BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of California\, Berkeley//UCB Events Calendar//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
DTSTART:19701029T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:19700402T020000
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20180322T090714Z
DTSTART;TZID=America/Los_Angeles:20180406T141000
DTEND;TZID=America/Los_Angeles:20180406T153000
TRANSP:OPAQUE
SUMMARY:Student Probability/PDE Seminar: Metastability of the Zero Range Process on a Finite Set Without Capacity Estimates
UID:116543-ucb-events-calendar@berkeley.edu
ORGANIZER;CN="UC Berkeley Calendar Network":
LOCATION:891 Evans Hall
DESCRIPTION:Chanwoo Oh\, UC Berkeley\n\nIn this talk\, I'll prove metastability of the zero range process on a finite set without using capacity estimates. The proof is based on the existence of certain auxiliary functions. One such function is inspired by Evans and Tabrizian's article\, "Asymptotics for the Kramers-Smouchowski equations". This function is the solution of a certain equation involving the infinitesimal generator of the zero range process. Another relevant auxiliary function is from a work of Beltran and Landim. We also use martingale problems to characterize Markov processes. Let $p$ be the jump rates of a random walk on a finite set $S$. Assume that the uniform measure on $S$ is an invariant measure of this random walk for simplicity (we expect that our method is applicable for an arbitrary invariant measure $m$). Consider the zero range process on $S$\, where the rate the particle jumps from a site $x$ to $y$ with $k$ particles at the site $x$ is given by $g(k) p(x\, y).$ Here $g(0) = 0$\, $g(1) = 1$\, and $g(k) = (k/ k-1)^\\alpha \, k > 1$ for some $\\alpha > 1$. As total number of particles $N \\rightarrow \\infty $\, most of the particles concentrate on a single site. In the time scale $N^{1+\\alpha }$\, the site of concentration evolves as a Markov chain whose jump rates are proportional to the capacities of the underlying random walk. This talk based on the joint work with F. Rezakhanlou.
URL:http://events.berkeley.edu/index.php/calendar/sn/pubaff.html?event_ID=116543&view=preview
SEQUENCE:0
CLASS:PUBLIC
CREATED:20180322T090714Z
LAST-MODIFIED:20180322T090714Z
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-OWNERAPPTID:-1
END:VEVENT
END:VCALENDAR