Strong Law of Large Numbers for Hidden Markov Chains Indexed by Cayley Trees
نویسندگان
چکیده
منابع مشابه
A Note on the Strong Law of Large Numbers
Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...
متن کاملSome limit results for Markov chains indexed by trees *
We consider a sequence of Markov chains (X)n=1,2,... with X = (X σ )σ∈T , indexed by the full binary tree T = T0 ∪ T1 ∪ . . . , where Tk is the k-th generation of T . In addition, let (Σk)k=0,1,2,... be a random walk on T with Σk ∈ Tk and R̃ = (R̃ t )t≥0 with R̃ t := XΣ[tn] , arising by observing the Markov chain X n along the random walk. We present a law of large numbers concerning the empirical...
متن کاملMARCINKIEWICZ-TYPE STRONG LAW OF LARGE NUMBERS FOR DOUBLE ARRAYS OF NEGATIVELY DEPENDENT RANDOM VARIABLES
In the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. Let be a double sequence of pairwise negatively dependent random variables. If for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). In addition, it also converges to 0 in ....
متن کاملTaylor Expansion for the Entropy Rate of Hidden Markov Chains
We study the entropy rate of a hidden Markov process, defined by observing the output of a symmetric channel whose input is a first order Markov process. Although this definition is very simple, obtaining the exact amount of entropy rate in calculation is an open problem. We introduce some probability matrices based on Markov chain's and channel's parameters. Then, we try to obtain an estimate ...
متن کاملun 2 00 3 Large deviations of Markov chains indexed by random trees
Given a finite typed rooted tree T with n vertices, the empirical subtree measure is the uniform measure on the n typed subtrees of T formed by taking all descendants of a single vertex. We prove a large deviation principle in n, with explicit rate function, for the empirical subtree measures of multitype Galton-Watson trees conditioned to have exactly n vertices. In the process, we extend the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Probability and Statistics
سال: 2012
ISSN: 2090-472X
DOI: 10.5402/2012/768657