BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20190331T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20181028T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20190526T070152Z
UID:5c4816067a9ae173874030@ist.ac.at
DTSTART:20190129T173000
DTEND:20190129T183000
DESCRIPTION:Speaker: Jan Swart\nhosted by Jan Maas\nAbstract: Interacting p
article systems can often be constructed from a graphical representation\,
by applying local maps at the times of associated Poisson processes. This
leads to a natural coupling of systems started in different initial state
s. In the talk\, we will look at interacting particle systems on the compl
ete graph in the mean-field limit\, i.e.\, as the number of vertices tends
to infinity. We will not only be interested in the mean-field limit of a
single process\, but mainly in how several coupled processes behave in the
limit. In particular\, we want to know how sensitive the Poisson construc
tion is to small changes in the initial state. This turns out to be closel
y related to recursive tree processes as studied by Aldous and Bandyopadya
y\, which are a sort of Markov chains in which time has a tree-like struct
ure and in which the state of each vertex is a random function of its desc
endants. The abstract theory will be demonstrated on an example of a parti
cle system with cooperative branching and deaths.This is joint work with A
nja Sturm and Tibor Mach.
LOCATION:Big Seminar room Ground floor / Office Bldg West (I21.EG.101)\, IS
T Austria
ORGANIZER:swiddman@ist.ac.at
SUMMARY:Vienna Probability Seminar: Recursive tree processes and the mean-f
ield limit of stochastic flows
URL:https://talks-calendar.app.ist.ac.at/events/1773
END:VEVENT
END:VCALENDAR