Seminars and Colloquia by Series

Trouble with a chain of stochastic oscillators

Series
Stochastics Seminar
Time
Thursday, September 18, 2008 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Jonathan Mattingly – Dept of Math, Duke University
I will discuss some recent (but modest) results showing the existence and slow mixing of a stationary chain of Hamiltonian oscillators subject to a heat bath.  Surprisingly, even these simple results require some delicate stochastic averaging. This is joint work with Martin Hairer.

Exact asymptotics for the stationary distribution of Markov chains

Series
Stochastics Seminar
Time
Thursday, September 11, 2008 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Robert Foley – ISyE, Georgia Tech
Under certain conditions, we obtain exact asymptotic expressions for the stationary distribution \pi of a Markov chain.  In this talk, we will consider Markov chains on {0,1,...}^2.  We are particularly interested in deriving asymptotic expressions when the fluid limit of the most probable paths from the origin to the rare event are nonlinear.  For example, we will derive asymptotic expressions for a large deviation along the x-axis (e.g., \pi(\ell, y) for fixed y) when the most probable paths to (\ell,y) initially climb the y-axis before turning southwest and drifting towards (\ell,y).

Different behavior of the LCS depending on the number of colors

Series
Stochastics Seminar
Time
Thursday, September 4, 2008 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Heinrich Matzinger – School of Mathematics, Georgia Tech
A common subsequence of two sequences X and Y is a sequence which is a subsequence of X as well as a subsequence of Y. A Longest Common Subsequence (LCS) of X and Y is a common subsequence with maximal length. Longest Common subsequences can be represented as alignments with gaps where the aligned letter pairs corresponds to the letters in the LCS. We consider two independent i.i.d.  binary texts X and Y of length n. We show that the behavior of the the alignment corresponding to the LCS is very different depending on the number of colors.  With 2-colors, long blocks tend to be aligned with no gaps, whilst for four or more colors the opposite is true. Let Ln denote the length of the LCS of X and Y.  In general the order of the variance of Ln is not known. We explain how a biased affect of a finite pattern can influence the order of the fluctuation of Ln.

Finite Rank Approximation of Tensor-Type and Additive Random Fields

Series
Stochastics Seminar
Time
Thursday, August 28, 2008 - 15:00 for 1 hour (actually 50 minutes)
Location
Skiles 269
Speaker
Mikhail Lifshits – School of Mathematics, Georgia Tech
We consider a random field of tensor product type X and investigate the quality of approximation (both in the average and in the probabilistic sense) to X by the processes of rank n minimizing the quadratic approximation error. Most interesting results are obtained for the case when the dimension of parameter set tends to infinity. Call "cardinality" the minimal n providing a given level of approximation accuracy. By applying Central Limit Theorem to (deterministic) array of covariance eigenvalues, we show that, for any fixed level of relative error, this cardinality increases exponentially (a phenomenon often called "intractability" or "dimension curse") and find the explosion coefficient. We also show that the behavior of the probabilistic and average cardinalities is essentially the same in the large domain of parameters.

Pages