Wednesdays Carver 294
For more information, contact: Krishna Athreya
|
Probability SeminarSpring 2008March 26Alex Roitershtein March 12Alex Roitershtein February 19Ananda Weerasinghe February 12Ananda Weerasinghe January 23Ananda Weerasinghe Fall 2007November 15 (Note different day/time) from 11:00 a.m. to 11:50 a.m. in 390 CarverSpeaker - Jonathon Peterson, University of Minnesota Quenched limits for transient one-dimensional random walks in a random environment For a transient, one-dimensional random walk in random environment, Kesten, Kozlov, and Spitzer ('75) proved that the annealed limiting distribution of the random walk was related to a stable distribution. We instead study the quenched behavior of the random walk and show that there are no quenched limiting distributions for the random walk. In particular, in the positive speed regime we can find two random subsequences (depending on the environment) along which the limiting distribution of the random walk is either a Gaussian or a reverse exponential distribution. November 7Speaker - Mathieu Merle, University of British Columbia The continuous limit of invasion percolation on a regular tree We consider invasion percolation on a regular tree. Recent work of Angel, Goodman, den Hollander and Slade showed a structural representation of the invasion percolation cluster (IPC) as an infinite backbone from which emerge independent sub-critical Galton-Watson trees. October 24Speaker - Alexander Roitershtein Random walks in random environments October 17Speaker - K. B. Athreya Growth rates for pure birth Markov chains October 10Speaker - Sunder Sethuraman On fractional Brownian motion limits in a simple exclusion random walk particle system October 3Speaker - Jiyeon Suh Uniform learnability and VC dimension September 26Speaker - Jiyeon Suh Uniform learnability and VC dimension Valiant introduced the idea of learnability of a class of sets, which he called a concept class. Blumer, Ehrenfeucht, Haussler and Warmuth (1987) (henceforth referred to as BEHW) showed that a concept class is uniformly learnable( a property that will be defined in the talk) if and only if it is a VC class( a combinatorial property that will be defined in the talk). The aim of the talk is to explain the part of the BEHW paper that established the equivalence and to give a proof slightly different from that of BEHW. September 12Speaker - Alex Roitershtein A random walk on Z with drift driven by its occupation time at zero We consider a one-dimensional nearest neighbor random walk on the integer lattice with time-dependent drift towards the origin, given by an asymptotically vanishing function of the number of visits to zero. We obtain limit theorems for this random walk. In particular, we show the existence of three regimes according to the rate of decay of the drift. When the rate is sufficiently fast, This is a joint work with Iddo Ben-Ari (UC Irvine) and Mathieu Merle (UBC). |