Some limit results for Markov chains indexed by trees

Abstract

We consider a sequence of Markov chains ( Xn)n=1,2,... with Xn = (Xnσ)σ∈ T, indexed by the full binary tree T = T0 T1 ..., where Tk is the kth generation of T. In addition, let (k)k=0,1,2,... be a random walk on T with k ∈ Tk and Rn = ( Rtn)t≥ 0 with Rtn := X_[tn], arising by observing the Markov chain Xn along the random walk. We present a law of large numbers concerning the empirical measure process Zn = ( Ztn)t≥ 0 where Ztn = Σσ∈ T[tn] δXσn as n∞. Precisely, we show that if Rn R for some Feller process R = (Rt)t≥ 0 with deterministic initial condition, then Zn Z with Zt = δ L(Rt).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…