Event Type:

Probability Seminar

Date/Time:

Thursday, February 1, 2007 - 06:00

Location:

(Joint with UO) U.Oregon Campus, Deady 208

Guest Speaker:

Institution:

University of Utah

Abstract:

In 1989, P. Fitzsimmons and T. Salisbury solved the long-standing open problem of describing exactly when the trajectories of two (or more) independent Markov processes intersect. Although the proof has been greatly simplified in the setting of Markov chains (Salisbury, 1996), this is still considered a very difficult result. In this talk, I will present a completely self-contained proof [still in the context of denumerable chains], which is based on arguments that were originally designed to study the Brownian sheet (Khoshnevisan and Shi, 1999).