JSM Preliminary Online Program
This is the preliminary program for the 2009 Joint Statistical Meetings in Washington, DC.

The views expressed here are those of the individual authors
and not necessarily those of the ASA or its board, officers, or staff.


Back to main JSM 2009 Program page




Activity Number: 558
Type: Contributed
Date/Time: Thursday, August 6, 2009 : 8:30 AM to 10:20 AM
Sponsor: IMS
Abstract - #305379
Title: Recurrent Sets and Communcation for Monotonically Decreasing Nonstationarity
Author(s): Zach Dietz*+
Companies: Hamilton College
Address: 198 College Hill Road, Clinton, NY, 13323,
Keywords: Markov chain ; recurrent ; non-stationarity ; communication
Abstract:

Consider a finite state, non-stationary Markov chain with transition kernels {P_n}, where P_n monotonically converges to P in a pointwise fashion. It has long been known that the limiting distribution of X_n, the location statistic of the chain at time n, exists. However, the question remains as to how one may easily determine whether y is asymptotically accessible from x, when we begin our chain in state x at a very distant point of the future. We present results appertaining to the limiting distribution, and an algorithm for determining when lim_m lim_n P^{m,m+n}(x,y)>0, indeed, what P^{m,m+n}(x,y)'s actual value is.


  • The address information is for the authors that have a + after their name.
  • Authors who are presenting talks have a * after their name.

Back to the full JSM 2009 program


JSM 2009 For information, contact jsm@amstat.org or phone (888) 231-3473. If you have questions about the Continuing Education program, please contact the Education Department.
Revised September, 2008