|
|
Spring 2009
-
February 20
No seminar this week.
-
March 6
No seminar this week.
-
May 1
No seminar this week.
-
May 8
No seminar this week.
Fall 2008
-
September, 12
Sergey Bobkov University of Minnesota
Isotropic positions of convex measures.
We will be discussing extensions of Hensley's theorem on sections of isotropic convex bodies to the class of convex measures that are put in a specific position.
-
September, 19
Ofer Zeitouni University of Minnesota
A fragmentation-coagulation chain, random walk on permutations, and Schramm's coupling.
Abstract in PDF
-
September, 26
Vasileios Maroulas IMA, University of Minnesota
Small noise large deviations for infinite dimensional stochastic dynamical systems.
Abstract in PDF
-
October, 3
Ramon Van Handle Princeton University
A qualitative long time asymptotic theory for nonlinear filtering
The asymptotic properties of nonlinear filters, such as stability and unique
ergodicity, are of significant importance in proving the convergence of
approximate filtering algorithms and the consistency of likelihood-based
inference in hidden Markov models. A variety of ingenious methods have been
proposed to study these long time properties quantitatively. On a
qualitative level, however, none of these results are able to reproduce and
extend the powerful observability/detectability criteria which are known in
the special case of linear Gaussian models.
In this talk, I will outline some recent qualitative results which shed
light on the fundamental mechanisms that lead to stability of nonlinear
filters. The results are very general in nature and subsume and extend to
nonlinear models various known results in the linear Gaussian case. This
qualitative theory is based on connections between nonlinear filtering on
the one hand, and Markov chains in random environments and uniform
approximations on the other hand. Along the way, a long-standing gap in a
classic paper by H. Kunita (1971) is largely resolved.
-
October, 10
Jon Peterson University of Wisconsin
Properties of the averaged large deviation rate function for random walks in random environments
An averaged (annealed) large deviation principle for multi-dimensional random walks in random environments (RWRE) was proved by Varadhan in 2003. However, Varadhan's proof is quite complicated and thus it is difficult to derive much qualitative information about the large deviation rate function from the formulation given in his proof. In this talk I will describe a different, much simpler, approach to large deviations of multidimensional RWRE using regeneration times. I will use this approach to show that when the distribution on environments is ``non-nestling,'' the averaged large deviation rate function is analytic in a neighborhood of the limiting velocity of the RWRE.
-
October, 17
Brian Rider University of Colorado
Diffusion at RMT's hard edge
With J. Ramirez and B. Virag we recently proved that the limiting soft edge eigenvalues of the general beta ensembles have laws shared by the spectral points of a certain random Schroedinger operator. After recalling this fact I'll prove there is a similar picture at the random matrix hard edge. That is, the spectrum of random sample covariance type matrices is described in terms of a (random) differential operator in the large dimensional limit. And thus also, via a Riccati transformation, by the hitting distribution of a simple diffusion. This second description allows us to prove the anticipated transition between the hard and soft edge laws.
-
October, 24
Midwest Probability Colloqium Northwestern University
No seminar
-
October, 31
Houman Owhadi Caltech
Noisy mechanical systems and Stochastic Variational Integrators
We present a continuous and discrete Lagrangian theory for stochastic Hamiltonian systems on manifolds. Analogously to discrete mechanics and variational integrators, this theory leads to structure-preserving numerical integrators for noisy mechanical systems by extremizing a discrete stochastic action. As an example of application we will examine the (non equilibrium) behavior of a magnetic motor at uniform temperature, submitted to degenerate noise and dissipation. This is a joint work with Nawaf Bou-Rabee.
-
November, 7
Hye-Won Kang University of Minnesota
Multiple scaling methods in chemical reaction networks
Abstract in PDF
-
November, 14
Manjunath Krishnapur Toronto
Singular points of matrix-valued analytic functions
We consider the set of points in the complex plane where a matrix-valued analytic function becomes singular. As the size of the matrix goes to infinity, we find a limiting measure in the complex plane, in the case when the entries of the matrix are iid random analytic functions. This generalizes the circular law of random matrix theory to a much larger family of laws.
-
November, 21
Gabor Pete
Toronto & MSRI
The exact noise and dynamical sensitivity of critical percolation, via the Fourier spectrum
Let each site of the triangular lattice (or edge of the \Z^2 lattice) have an independent Poisson clock switching between open and closed. So, at any given moment, the configuration is just critical percolation. In particular, the probability of a left-right open crossing in an n*n box is roughly 1/2, and, on the infinite lattice, almost surely there are only finite open clusters.
In the box, how long do we have to wait before we lose essentially all information about having a left-right open crossing? In the infinite lattice, are there random exceptional times when there are infinite clusters? In joint work with Christophe Garban and Oded Schramm, we gave quite complete answers: exceptional times do exist on both lattices, and the Hausdorff dimension of their set is computed to be 31/36 for the triangular lattice.
The indicator function of a percolation crossing event is a function on the hypercube {-1,+1}^{sites or edges}, and thus it has a Fourier-Walsh expansion. Our proofs are based on giving sharp concentration results for the ``weight'' of the Fourier coefficients at different frequencies.
-
December 5
Maury Bramson University of Minnesota
Randomized load balancing for general service times with the FIFO discipline
We consider the randomized load balancing scheme where each arriving job joins the shortest of d randomly chosen queues from among a pool of n queues, where d is fixed and n goes to infinity. Works by Mitzenmacher (1996) and Vvedenskaya et al. (1996) considered the case with Poisson input and exponentially distributed service times, where an explicit formula for the equilibrium distribution was derived when the system is subcritical. For general service times, the service discipline can affect the nature of the equilibrium distribution. Here, we examine its behavior for the FIFO service discipline and service distributions with fat tails. This is joint work with Y. Lu and B. Prabhakar of Stanford University.
|