Discrete Probability
2009 spring
Seminar program
Tuesday, June 9, 2009:
14.00-15.00 Andrew Barbour, Universität Zürich
Quasi-stationary distributions
Thursday, June 4, 2009:
14.00-15.00 Gil Kalai, Hebrew University, Jerusalem
Noise sensitivity
15.30-16.30 Svante Janson, Uppsala University
Audience's choice
Tuesday, June 2, 2009:
14.00-15.00 Balint Toth, Budapest University of Technology
Long time asymptotics of self-repelling random walks
15.30-16.30 Gabor Pete, University of Toronto
The scaling limits of dynamical and near-critical percolation, and the minimal spanning tree
Thursday, May 28, 2009:
14.00-15.00 Elchanan Mossel, University of California, Berkeley
Quantitative social choice theory
15.30-16.30 Christopher Hoffman, University of Washington,Seattle
Topology of random simplicial complexes
Tuesday, May 26, 2009:
14.00-15.00 Alan Sokal, University of New York
The multivariate Tutte polynomial for graphs and matroids
15.30-16.30 Jim Fill, Johns Hopkins University, Baltimore
The numbers of symbol comparisons used by Quickselect and by Quicksort
Tuesday, May 19, 2009:
14.00-15.00 Tony Guttmann, University of Melbourne, Victoria
Lattice green functions and Calabi-Yau equations
15.30-16.30 Mathias Lindholm, Stockholm University
Dynamic random networks
Thursday, May 14, 2009:
14.00-15.00 Martin Bender, University of Leuven
Edge scaling limits for non-Hermitian random matrices
15.30-16.30 Thomas Vallier, Institut Mittag-Leffler, Djursholm
Spread of activation on G(n,p)
Tuesday, May 12, 2009:
14.00-15.00 Gregory Sorkin, IBM Research, Yorktown Heights
Average-case analyses of Vickrey costs
15.30-16.30 Stanislav Volkov, University of Bristol
Going through a passport control with wife, or sequential adsorption at extremes
Thursday, May 7, 2009:
14.00-15.00 Maria Deijfen, Stockholm University
Invariant random graphs with prescribed iid degrees
15.30-16.30 Kimmo Eriksson, Mälardalens Högskola, Västerås
Cultural evolution as a random walk on integer partitions
Tuesday, May 5, 2009:
14.00-15.00 Harry Kesten, Cornell University, Ithaca
Random walk with occasionally modified transition probabilities
15.30-16.30 Ofer Zeitouni, University of Minnesota, Minneapolis
Some aspects of large deviations for RWRE
Tuesday, April 28, 2009:
14.00-15.00 Per Austrin, KTH, Stockholm
Randomly supported independence
15.30-16.30 Svante Linusson and Sven Erick Alm, KTH, Stockholm and Uppsala University
Surprising (?) correlations in randomly oriented graphs
Thursday, April 23, 2009:
14.00-15.00 Vladas Sidoravicius, IMPA, Rio de Janeiro
Fixation in the activated random walk model
15.30-16.30 Tom Britton, Stockholm University
Random networks and epidemics
Tuesday, April 21, 2009:
14.00-15.00 Cecilia Holmgren, Uppsala University
A weakly 1-stable limiting distribution for the number of random records and cuttings in split trees
15.30-16.30 Bo Söderberg, Lund University
Random Feynman graphs
Thursday, April 16, 2009:
14.00-15.00 Vlada Limic, Université de Provence, Marseille
The Lambda-coalescent speed of coming down from infinity
15.30-16.30 Anders Martin-Löf, Stockholm University
Pfaff, Ising and statistical mechanics
Tuesday, April 14, 2009:
15.30-16.30 Johan Jonasson, Chalmers, Gothenburg
The bottom-to-top shuffle and the overlapping cycles shuffle
Tuesday, April 7, 2009:
14.00-15.00 Colin McDiarmid, University of Oxford
Random graphs with few disjoint cycles
15.30-16.30 Rob van den Berg, CWI, Amsterdam
Sharpness of percolation transitions in some dependent 2D models
Thursday, April 2 , 2009:
14.00-15.00 David Wilson, Microsoft Corporation, Redmond
A sharp threshold for minimum bounded-depth and bounded-diameter spanning trees and Steiner trees in random networks
15.30-16.30 Oliver Riordan, Oxford University
Random graphs, the cut metric and branching processes
Tuesday, March 31, 2009:
14.00-15.00 Johan Wästlund, Chalmers, Gothenburg
Cancelling $\infty - \infty$ with games on graphs
15.30-16.30 Kurt Johansson, KTH, Stockholm
Universality in random matrix theory
Thursday, March 26 , 2009:
14.00-15.00 Anders Johansson, University of Gävle
Factors in random graphs and hypergraphs
15.30-16.30 Malwina Luczak, London School of Economics
Averaging over fast variables in the fluid limit for Markov chains
Tuesday, March 24, 2009:
14.00-15.00 Lars Holst, KTH,Stockholm
On records
15.30-16.30 Joel Spencer, New York University
Finding Lovász's needle in an exponential haystack
Thursday, March 19 , 2009:
14.00-15.00 Peter Hegarty, Chalmers, Gothenburg
Concentration of measure in additive number theory
15.30-16.30 Erik Broman, Chalmers, Gothenburg
(Some new and some old results in) fractal percolation
Tuesday, March 17, 2009:
14.00-15.00 Olle Häggström, Chalmers, Gothenburg
Dependent percolation on the square lattice
15.30-16.30 Svante Janson, Uppsala University
Susceptibility of random graphs
Thursday, March 12 , 2009:
14.00-15.00 John Wierman, Johns Hopkins University, Baltimore
Triangle-duality and exact bond percolation thresholds
15.30-16.30 Anthony Metcalfe, University College Cork
Structural and universality properties of Gelfand-Tsetlin patterns and their generalizations
Tuesday, March 10, 2009:
14.00-15.00 Jakob Björnberg, Statistical Laboratory, Cambridge
Stochastic geometry of the space-time Ising model
15.30-16.30 Eric Nordenstam, KTH, Stockholm
The shuffling algorithm and the Aztec diamond
Thursday, March 5 , 2009:
14.00-15.00 Patrik Ferrari, Weierstrass Institute, Berlin
Limit processes in KPZ growth
15.30-16.30 Nina Gantert, University of Münster
Nearly optimal paths and survival in a killed branching random walk
Tuesday, March 3, 2009:
14.00-15.00 Liza Jones, Oxford University
Infinite systems of non-colliding processes
15.30-16.30 James Martin, St Hugh's College, Oxford
Multiclass queues and interchangeability
Thursday, February 26 , 2009:
14.00-15.00 Timo Seppäläinen, University of Wisconsin-Madison
Fluctuation bounds for a class of zero range processes
15.30-16.30 Alan Hammond, ENS, Paris
Trapping of a biased random walk on a supercritical tree
Tuesday, February 24, 2009:
14.00-15.00 Christophe Garban, Université Paris Sud
The Fourier spectrum of critical percolation
15.30-16.30 Federico Camia, Vrije Universiteit, Amsterdam
Ising Euclidean fields and cluster area measures
Thursday, February 19 , 2009:
14.00-15.00 Ralph Neininger, J.W. Goethe-Universität, Frankfurt
Probabilistic analysis of "Quickselect" and the contraction method
15.30-16.30 Johan Tykesson, Chalmers, Gothenburg
Aspects of continuum percolation in hyperbolic space
Tuesday, February 17, 2009:
14.00-15.00 Klas Markström, Umeå University
Random Cayley-like graphs
15.30-16.30 Alexander Holroyd, University of British Columbia, Vancouver
Poisson matching
Thursday, February 12 , 2009:
14.00-15.00 Frank den Hollander, Leiden University
Intermittency on catalysts
15.30-16.30 Noam Berger, Einstein Institute of Mathematics, Jerusalem
Slowdown estimates for ballistic random walk in random environment
Tuesday, February 10, 2009:
14.00-15.00 Mihyun Kang, Technische Universität, Berlin
An ice-type model for random graphs embeddable on a surface
15.30-16.30 Michal Karonski, Adam Mickiewicz University, Poznan
Vertex-coloring edge-weightings
Thursday, February 5 , 2009:
14.00-15.00 Markus Heydenreich, Vrije Universiteit, Amsterdam
Percolation on high dimensional boxes and related questions
15.30-16.30 Alexander Fribergh, Université Lyon 1
Biased random walks on a Galton-Watson tree with leaves
Tuesday, February 3, 2009:
14.00-15.00 Hsien-Kuei Hwang, Academia Sinica, Taipei
A new analytic approach to the variance asymptotics of random digital trees
15.30-16.30 Andrzej Rucinski, Adam Mickiewicz University, Poznan
Subhypergraph counts in random hypergraphs
Thursday, January 29, 2009:
14.00-15.00 Jonathon Peterson, University of Wisconsin, Madison
Quenched limits for one-dimensional, transient, RWRE
15.30-16.30 Taral Guldahl Seierstad, University of Oslo
The differential equation method and random graphs
Tuesday, January 27, 2009:
14.00-15.00 Remco van der Hofstad, Eindhoven University of Technology
First passage percolation on random graphs
15.30-16.30 Vincent Beffara, UMPA-ENS, Lyon
Isotropic embeddings of planar lattices
Thursday, January 22, 2009:
14.00-15.00 Tomasz Luczak, Adam Mickiewics University, Poznan
Chasing robbers on random graphs
15.30-16.30 Tatyana Turova, Lund University
Asymptotics for the size of the largest component scaled to "log n" in inhomogeneous random graphs
Tuesday, January 20, 2009:
14.00-15.00 Tom Sanders, Christ's College, Cambridge
Probabilistic methods in additive combinatorics: sets with random spectrum
15.30-16.30 Ilkka Norros, VTT, Helsinki
Power-law random graphs and routing problems
|
