Please click here for the workshop timetable.
One methodology for random graphs and random networks
Prof. D. Aldous (University of California, Berkeley)
1. The mean field model of distance.
2. Local weak convergence of random graphs.
3. Recursive distributional equations for additively renormalized limits.From elementary results we will work up to 2 examples which are non-rigorously solvable via sophisticated 3-line arguments: 1. Mean length of traveling salesman problem in mean-field model. 2. Flow through a random disordered directed network
Separation of time scales and averaging of fast subsystems for stochastic chemical reaction models
Prof. T. Kurtz (University of Wisconsin, Madison)
1. Stochastic equations for counting processes
2. Stochastic models for chemical reactions
3. Identifying separated time scales in stochastic models of reaction networks4. Averaging fast subsystems5. Central limit theorems and diffusion approximations
Participants are encouraged, but by no means obliged, to present their own work in one of the afternoon sessions. Speakers may choose to give an informal introduction to an area of interest, or to present a more detailed account of their research (subject to timetabling constraints). If you would be interested in presenting some work, please indicate this when completing your registration form.