BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UM//UM*Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Detroit
TZURL:http://tzurl.org/zoneinfo/America/Detroit
X-LIC-LOCATION:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20070311T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20071104T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230202T101102
DTSTART;TZID=America/Detroit:20230208T160000
DTEND;TZID=America/Detroit:20230208T170000
SUMMARY:Workshop / Seminar:MCAIM Colloquium: Modeling and Analyzing Temporal Networks and Dynamics on Them
DESCRIPTION:Abstract: Two salient features of empirical temporal (i.e.\, time-varying) network data are the time-varying nature of network structure itself and heavy-tailed distributions of inter-contact times. Both of them can strongly impact dynamical processes occurring on networks\, such as contagion processes\, synchronization dynamics\, and random walks. In the first part of the talk\, I introduce theoretical explanation of heavy-tailed distributions of inter-contact times by state-dynamics modeling approaches in which each node is assumed to switch among a small number of discrete states in a Markovian manner and the nodes' states determine time-dependent edges. This approach is interpretable\, facilitates mathematical analyses\, and seeds various related mathematical modeling\, algorithms\, and data analysis (e.g.\, theorizing on epidemic thresholds\, random walks on metapopulation models\, inference of mixtures of exponential distributions\, new Gillespie algorithms\, embedding of temporal network data)\, some of which we will also discuss. The second part of the talk is on modeling of temporal networks by static networks that switch from one to another at regular time intervals. This approach facilitates analytical understanding of diffusive and epidemic dynamics on temporal networks as well as an efficient algorithm for containing epidemic spreading as convex optimization. Finally\, I will touch upon some of my interdisciplinary collaborations including those on static networks.\n\nEvent will take place in-person in 4448 East Hall and online via Zoom.\n\nZoom Webinar Link: \nhttps://umich.zoom.us/j/98734707290
UID:103915-21808085@events.umich.edu
URL:https://events.umich.edu/event/103915
CLASS:PUBLIC
STATUS:CONFIRMED
CATEGORIES:Mathematics
LOCATION:East Hall - 4448 EH
CONTACT:
END:VEVENT
END:VCALENDAR