University of Cambridge > Talks.cam > CMI Student Seminar Series > Coagulation systems: From Particle Systems to Random Graphs

Coagulation systems: From Particle Systems to Random Graphs

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Neil Deo.

We consider random systems of coagulating particles, motivated by combinatorial objects which show up in many-body systems. In the scaling limit, the coagulation system is described by a deterministic limit (PDE) equation, due to Flory, which undergoes a phase transition in finite time. On the other hand, in certain cases, the random system can be described 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 .

This talk is part of the CMI Student Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2021 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity