Campus Event Calendar
Event Entry
What and Who
The phase transition in random graphs and random graph processes
Taral Seierstad
HU Berlin
Talk
Taral applied for a post-doc position in AG1.
AG 1, AG 3, AG 5, RG2, AG 2, AG 4, RG1, SWS
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Wednesday, 28 March 2007
12:00
45 Minutes
Warning: Time has changed!
E1 4
024
Saarbrücken
Abstract
We consider a phenomenon, known as the 'phase transition', which occurs in several random graph processes. At some point during the process, the component structure changes radically through the addition of a relatively small number of random edges, from being a graph consisting of many small components, to containing a unique 'giant' component with a large proportion of the vertices. We consider several different random graph models and we will outline some methods which are used to study the phase transition. In particular we wish to determine the number of edges which have to be added for the phase transition to occur, and describe the behaviour of the graphs in the critical phase, which is the short period of time in which the giant component is formed.
Contact
Benjamin Doerr
--email hidden
passcode not visible
logged in users only
Benjamin Doerr, 03/27/2007 14:42
Benjamin Doerr, 03/20/2007 10:40
Benjamin Doerr, 03/19/2007 21:30
Benjamin Doerr, 03/12/2007 10:45 -- Created document.
Benjamin Doerr, 03/20/2007 10:40
Benjamin Doerr, 03/19/2007 21:30
Benjamin Doerr, 03/12/2007 10:45 -- Created document.