BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260607T111827EDT-4792uicpGV@132.216.98.100
DTSTAMP:20260607T151827Z
DESCRIPTION:Weakly interacting particle systems on graphs: from dense to sp
 arse\n\nWe consider the asymptotic behaviors of weakly interacting (mean-f
 ield) particle systems on graphs\, which could be dense or sparse\, random
  or deterministic. The system consists of a large number of nodes in which
  the state of each node is governed by a stochastic process that has a mea
 n-field type interaction with the neighboring nodes.\n	\n	In the dense graph
  case\, the limiting system is given by the classic McKean—Vlasov equation
 . Law of large numbers\, propagation of chaos\, and central limit theorems
  have been established and are the same as those in the complete graph cas
 e.In the sparse case\, we obtain an autonomous characterization of the loc
 al dynamics of the neighborhood of a typical node for the limiting system\
 , when the limiting graph is a D-regular tree or a Galton—Watson tree. The
  proofs rely on a certain Markov random field structure of the dynamics on
  countably infinite graphs\, which may be of independent interest. Based o
 n the joint work with Daniel Lacker and Kavita Ramanan.\n
DTSTART:20181015T180000Z
DTEND:20181015T190000Z
LOCATION:Room 1205\, Burnside Hall\, CA\, QC\, Montreal\, H3A 0B9\, 805 rue
  Sherbrooke Ouest
SUMMARY:Ruoyu Wu\, Unversity of Michigan
URL:/mathstat/channels/event/ruoyu-wu-unversity-michig
 an-290541
END:VEVENT
END:VCALENDAR