BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Coagulation systems: From Particle Systems to Random Graphs - Dani
 el Heydecker (Cambridge)
DTSTART:20210512T130000Z
DTEND:20210512T140000Z
UID:TALK159691@talks.cam.ac.uk
CONTACT:Neil Deo
DESCRIPTION:We consider random systems of coagulating particles\, motivate
 d by combinatorial objects which show up in many-body systems. In the scal
 ing limit\, the coagulation system is described by a deterministic limit (
 PDE) equation\, due to Flory\, which undergoes a phase transition in finit
 e time. On the other hand\, in certain cases\, the random system can be de
 scribed exactly by a kind of random graph\, studied in detail by Bollobás
 \, Janson and Riordan\, which generalises the results we know and love on 
 Erdös-Réyni graphs\, and tools from graph theory can be brought to bear 
 on the PDE.
LOCATION:https://maths-cam-ac-uk.zoom.us/j/95531783868?pwd=U3pPbmYxTXZYRVZ
 MWFBVTkVnWmUvZz09
END:VEVENT
END:VCALENDAR