COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |
University of Cambridge > Talks.cam > Combinatorics Seminar > Achlioptas processes and truncated stochastic coalescence
Achlioptas processes and truncated stochastic coalescenceAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Andrew Thomason. Achlioptas processes are widely-studied variants of the classical Erdős-Rényi random graph process. Starting from an empty graph, these proceed as follows: in each step two potential edges are chosen uniformly at random, and using some rule one of them is selected and added to the evolving graph. Very detailed results are nowadays known for the class of `bounded-size’ rules, where all component sizes larger than some constant B are treated the same way. In 2001 Spencer and Wormald made several conjectures, which intuitively state that any `unbounded’ size rule (such as the sum or product rule) is in some sense the limit of a sequence of appropriately defined `truncated’ bounded-size rules (with increasing size-bound B). In this talk we shall discuss some of our recent work, which proves one of these conjectures. This talk is part of the Combinatorics Seminar series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsMeeting the Challenge of Healthy Ageing in the 21st Century Type the title of a new list here Visual rhetoric and modern South Asian history 1 and 1/2 APDE days Hebrew Open Classes DAK SeminarsOther talksSine-Gordon on a Wormhole Reading and Panel Discussion with Emilia Smechowski Systems for Big Data Applications: Revolutionising personal computing Leveraging the imaging power of the Beacon platform Bringing Personality Theory Back to Life: On Persons-in-Context, Idiographic Strategies, and Lazarus Adrian Seminar: Ensemble coding in amygdala circuits |