- Open Access
A class of small deviation theorems for random fields on a uniformly bounded tree
© Wang and Yang; licensee Springer 2013
- Received: 17 June 2011
- Accepted: 11 February 2013
- Published: 28 February 2013
By introducing the asymptotic logarithmic likelihood ratio as a measure of the Markov approximation of arbitrary random fields on a uniformly bounded tree, by constructing a non-negative martingale on a uniformly bounded tree, a class of small deviation theorems of functionals and a class of small deviation theorems of the frequencies of occurrence of states for random fields on a uniformly bounded tree are established. Some known results are generalized in this paper.
- deviation theorems
- uniformly bounded tree
- random field
A tree is a graph which is connected and contains no circuits. Given any two vertices , let be the unique path connecting α and β. Define the graph distance to be the number of edges contained in the path .
Let T be an infinite tree which is locally finite and has no leaves. We choose a vertex as the root. We call the number of neighbors of a vertex of the tree the degree of this vertex. When the degrees of any vertices of T are uniformly bounded, we say T is a uniformly bounded tree. A tree is said to be a Bethe tree if each vertex has neighboring vertices, which is denoted by . A tree is said to be a Cayley tree if the root has only N neighbors and the other vertices have neighbors, which is denoted by . Both kinds of trees are common homogeneous trees. Obviously, the two kinds of homogeneous trees are the special cases of the uniformly bounded tree. When the context permits, uniformly bounded trees are all denoted simply by T.
Let T be an infinite tree with root o. The set of all vertices with distance n from the root is called the nth generation of T, which is denoted by . We denote by the subtree comprised of level 0 (the root o) through level n. For each vertex t, there is a unique path from o to t, and for the number of edges on this path. We denote the first predecessor of t by , the second predecessor of t by , and denote by the nth predecessor of t. For any two vertices s and t of tree T, write if s is on the unique path from the root o to t. We denote by the vertex farthest from o satisfying and .
Let be a measurable space, be a collection of random variables defined on and taking values in , where b is a positive integer. Let A be a subgraph of T, , and we denote by the number of vertices of A. Let the realization of be . Let μ be a probability measure on the measurable space . We will call μ the random field on tree T. Let the distribution of under probability measure μ be . is actually the marginal distribution of μ.
Definition 1 (see )
will be called S-valued Markov chains indexed by an infinite tree T with initial distribution (1) and transition matrix (2) under probability measure .
In order to avoid technical problems, we always assume that , and are positive.
will be called the asymptotic logarithmic likelihood ratio.
Remark 1 If , then . In Lemma 1 we will show that in a general case μ-a.e., hence can be regarded as a measure of the Markov approximation of an arbitrary random field on T.
The tree model has recently drawn increasing interest from specialists in physics, probability and information theory. Benjamini and Peres  have given the notion of the tree-indexed homogeneous Markov chains and studied the recurrence and ray-recurrence for them. Berger and Ye  have studied the existence of entropy rate for some stationary random fields on a homogeneous tree. Ye and Berger  have studied the asymptotic equipartition property (AEP) in the sense of convergence in probability for a PPG-invariant and ergodic random field on a homogeneous tree. Recently, Yang  has studied some strong limit theorems for countable homogeneous Markov chains indexed by a homogeneous tree and the strong law of large numbers and the asymptotic equipartition property (AEP) for finite homogeneous Markov chains indexed by a homogeneous tree. Huang and Yang  have studied the strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree. Liu and Wang  have studied the small deviation theorems between the arbitrary random fields and the Markov chain fields on the Cayley tree. Peng, Yang, and Wang  have further studied a class of small deviation theorems for functionals of random fields on a homogeneous tree which partially extend the result of .
In this paper, by introducing the asymptotic logarithmic likelihood ratio as a measure of the Markov approximation of the arbitrary random field on a uniformly bounded tree, and by constructing a non-negative martingale, we obtain the following two results: a class of small deviation theorems of functionals and a class of small deviation theorems of the frequencies of occurrence of states for random fields on a uniformly bounded tree. In fact, our present outcomes can imply the case in  and .
Proof The proof of this lemma is similar to that of Lemma 1 of , so we omit it. □
hence we have , .
From this remark, we know that and the sequence of are existent.
Let the degree of each vertex σ () on the tree T be . Since T is a uniformly bounded tree which has no leaves, we know that there are two positive numbers m and M such that .
Since , this corollary follows from (15). □
The proof is finished. □
where is the expectation under probability measure . Then is a non-negative martingale under probability measure μ.
Proof The proof of this lemma is similar to that of Lemma 3 of , so we omit it. □
Small deviation theorems are a class of strong limit theorems expressed by inequalities. They are the extensions of strong limit theorems expressed by equalities. It is a new research topic proposed by Liu (see ).
In this section, we will establish a class of small deviation theorems of functionals and a class of small deviation theorems of the frequencies of occurrence of states for random fields on a uniformly bounded tree.
Hence (23) holds. In the case , (23) also holds by choosing () in (29). Taking and using a similar approach, we can prove (24). This completes the proof of Theorem 1. □
In the following, we will provide an example showing that maybe has a positive probability, even has probability 1.
It is easy to see that and . Since is a continuous function, for any , there exists q such that . Thus .
Hence (30) holds. In the case , (30) also holds by choosing () in (36). Taking and using a similar approach, we can prove (31). This completes the proof of Theorem 2. □
Proof Letting , (37) follows from (30) and (31). □
Corollary 3 (see )
Proof Let . Then , . Hence (38) follows (37) directly. □
Corollary 4 (see )
This completes the proof of Corollary 4. □
Remark 3 Unfortunately, the upper and lower bounds obtained in Theorem 1 and Theorem 2 are not tight. For example, if we let and in Theorem 1, then , but .
The authors would like to thank the referees for their many valuable comments and suggestions. This work was supported by National Natural Science Foundation of China 11071104.
- Benjamini I, Peres Y: Markov chains indexed by trees. Ann. Probab. 1994, 22: 219–243. 10.1214/aop/1176988857MATHMathSciNetView ArticleGoogle Scholar
- Berger T, Ye Z: Entropic aspects of random fields on trees. IEEE Trans. Inf. Theory 1990, 36(5):1006–1018. 10.1109/18.57200MATHMathSciNetView ArticleGoogle Scholar
- Ye Z, Berger T: Entropic, regularity and asymptotic equipartition property of random fields on trees. J. Comb. Inf. Syst. Sci. 1996, 21(2):157–184.MATHMathSciNetGoogle Scholar
- Yang WG: Some limit properties for Markov chains indexed by a homogeneous tree. Stat. Probab. Lett. 2003, 65: 241–250. 10.1016/j.spl.2003.04.001MATHView ArticleGoogle Scholar
- Huang HL, Yang WG: Strong law of large numbers for Markov chains indexed by an infinite tree with uniformly bounded degree. Sci. China Ser. A 2008, 51(2):195–202. 10.1007/s11425-008-0015-1MATHMathSciNetView ArticleGoogle Scholar
- Liu W, Wang LY: The Markov approximation of the random field on Cayley tree and a class of small deviation theorems. Stat. Probab. Lett. 2003, 63: 113–121. 10.1016/S0167-7152(03)00058-0MATHView ArticleGoogle Scholar
- Peng WC, Yang WG, Wang B: A class of small deviation theorems for functionals of random fields on a homogeneous tree. J. Math. Anal. Appl. 2010, 361: 293–301. 10.1016/j.jmaa.2009.06.079MATHMathSciNetView ArticleGoogle Scholar
- Liu W: Relative entropy densities and a class of limit theorems of the sequence of m -valued random variables. Ann. Probab. 1990, 18: 829–839. 10.1214/aop/1176990860MATHMathSciNetView ArticleGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.