Conditional entropy,entropy density,and strong law of large numbers for generalized controlled tree-indexed Markov chains

In this paper, we first introduces a tree model without degree boundedness restriction namely generalized controlled tree T, which is an extension of some known tree models, such as homogeneous tree model, uniformly bounded degree tree model, controlled tree model, etc. Then some limit properties including strong law of large numbers for generalized controlled tree-indexed non homogeneous Markov chain are obtained. Finally, we establish some entropy density properties, monotonicity of conditional entropy, and entropy properties for generalized controlled tree-indexed Markov chains.     

The strong laws of large numbers for countable non homogeneous hidden Markov models

In this article, we are going to study the strong laws of large numbers for countable non homogeneous hidden Markov models. First, we introduce the notion of countable non homogeneous hidden Markov models. Then, we obtain some properties for those Markov models. Finally, we establish two strong laws of large numbers for countable non homogeneous hidden Markov models. As corollaries, we obtain some known results of strong laws of large numbers for finite non homogeneous Markov chains.     

Asymptotic equipartition property for second-order circular Markov chains indexed by a two-rooted Cayley tree

In this paper, we introduce a model of a second-order circular Markov chain indexed by a two-rooted Cayley tree and establish two strong law of large numbers and the asymptotic equipartition property (AEP) for circular second-order finite Markov chains indexed by this homogeneous tree. In the proof, we apply a limit property for a sequence of multi-variable functions of a non homogeneous Markov chain indexed by such tree. As a corollary, we obtain the strong law of large numbers and AEP about the second-order finite homogeneous Markov chain indexed by the two-rooted homogeneous tree.     

The strong law of large numbers for non homogeneous M-bifurcating Markov chains indexed by a M-branch Cayley tree

This article is devoted to the strong law of large numbers and the entropy ergodic theorem for non homogeneous M-bifurcating Markov chains indexed by a M-branch Cayley tree, which generalizes the relevant results of tree-indexed nonhomogeneous bifurcating Markov chains. Meanwhile, our proof is quite different from the traditional method.     

The generalizations of strong law of large numbers for asymptotic even–odd Markov chains indexed by a homogeneous tree

Yang et al. (Yang et al., J. Math. Anal. Appl., 410 (2014), 179–189.) have obtained the strong law of large numbers and asymptotic equipartition property for the asymptotic even–odd Markov chains indexed by a homogeneous tree. In this article, we are going to study the strong law of large numbers and the asymptotic equipartition property for a class of non homogeneous Markov chains indexed by a homogeneous tree which are the generalizations of above results. We also provide an example showing that our generalizations are not trivial.     

Strong law of large numbers of the delayed sums for Markov Chains indexed by a Cayley tree

Abstract

In this paper, we will study the strong law of large numbers of the delayed sums for Markov chains indexed by a Cayley tree with countable state spaces. Firstly, we prove a strong limit theorem for the delayed sums of the bivariate functions for Markov chains indexed by a Cayley tree. Secondly, the strong law of large numbers for the frequencies of occurrence of states of the delayed sums is obtained. As a corollary, we obtain the strong law of large numbers for the frequencies of occurrence of states for countable Markov chains indexed by a Cayley tree.     

A class of small deviation theorems for the random variables associated with mth-order asymptotic circular Markov chains

ABSTRACT

In this article, we study a class of small deviation theorems for the random variables associated with mth-order asymptotic circular Markov chains. First, the definition of mth-order asymptotic circular Markov chain is introduced, then by applying the known results of the limit theorem for mth-order non homogeneous Markov chain, the small deviation theorem on the frequencies of occurrence of states for mth-order asymptotic circular Markov chains is established. Next, the strong law of large numbers and asymptotic equipartition property for this Markov chains are obtained. Finally, some results of mth-order nonhomogeneous Markov chains are given.     

The strong law of large numbers and the Shannon-McMillan theorem for the mth-order nonhomogeneous Markov chains indexed by an m rooted Cayley tree

ABSTRACT

In this article, we studied the strong law of large numbers(LLN) and Shannon-McMillan theorem for an mth-order nonhomogeneous Markov chain indexed by an m- rooted Cayley tree. This article generalized the relative results of level mth-order nonhomogeneous Markov chains indexed by an m- rooted Cayley tree.     

Strong Law of Large Numbers for Countable Asymptotic Circular Markov Chains

In this article, we introduce the notion of a countable asymptotic circular Markov chain, and prove a strong law of large numbers: as a corollary, we generalize a well-known version of the strong law of large numbers for nonhomogeneous Markov chains, and prove the Shannon-McMillan-Breiman theorem in this context, extending the result for the finite case.     

Strong laws of large numbers for the mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree

In this article, we will study the strong laws of large numbers and asymptotic equipartition property (AEP) for mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree. First, the definition of mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree is introduced, then the strong limit theorem for this Markov chains is established. Next, the strong laws of large numbers for the frequencies of ordered couple of states for mth-order asymptotic odd–even Markov chains indexed by an m-rooted Cayley tree are obtained. Finally, we prove the AEP for this Markov chains.     

A strong law of large numbers for independent random variables under non-additive probabilities

Abstract

Under non‐additive probabilities, cluster points of the empirical average have been proved to quasi-surely fall into the interval constructed by either the lower and upper expectations or the lower and upper Choquet expectations. In this paper, based on the initiated notion of independence, we obtain a different Marcinkiewicz-Zygmund type strong law of large numbers. Then the Kolmogorov type strong law of large numbers can be derived from it directly, stating that the closed interval between the lower and upper expectations is the smallest one that covers cluster points of the empirical average quasi-surely.     

Estimation of the Entropy Rate of a Countable Markov Chain

We consider here ergodic homogeneous Markov chains with countable state spaces. The entropy rate of the chain is an explicit function of its transition and stationary distributions. We construct estimators for this entropy rate and for the entropy of the stationary distribution of the chain, in the parametric and nonparametric cases. We study estimation from one sample with long length and from many independent samples with given length. In the parametric case, the estimators are deduced by plug-in from the maximum likelihood estimator of the parameter. In the nonparametric case, the estimators are deduced by plug-in from the empirical estimators of the transition and stationary distributions. They are proven to have good asymptotic properties.     

M-Estimator of a Generalized Linear Model with Measurement Errors

In this article, we propose a generalized linear model and estimate the unknown parameters using robust M-estimator. Under suitable conditions and by the strong law of large numbers and central limits theorem, the proposed M-estimators are proved to be consistent and asymptotically normal. We also evaluate the finite sample performance of our estimator through a Monte Carlo study.     

Markov Systems in a General State Space

In this article, we introduce and study Markov systems on general spaces (MSGS) as a first step of an entire theory on the subject. Also, all the concepts and basic results needed for this scope are given and analyzed. This could be thought of as an extension of the theory of a non homogeneous Markov system (NHMS) and that of a non homogeneous semi-Markov system on countable spaces, which has realized an interesting growth in the last thirty years. In addition, we study the asymptotic behaviour or ergodicity of Markov systems on general state spaces. The problem of asymptotic behaviour of Markov chains has been central for finite or countable spaces since the foundation of the subject. It has also been basic in the theory of NHMS and NHSMS. Two basic theorems are provided in answering the important problem of the asymptotic distribution of the population of the memberships of a Markov system that lives in the general space (X, ?(X)). Finally, we study the total variability from the invariant measure of the Markov system given that there exists an asymptotic behaviour. We prove a theorem which states that the total variation is finite. This problem is known also as the coupling problem.     

Some limit theorems of delayed sums for rowwise conditionally independent stochastic arrays

This paper is concerned with the asymptotic property of delayed sums for rowwise conditionally independent stochastic arrays. The main technique of the proofing is to construct non negative random variables with one parameter and to apply the Borel–Cantelli lemma to obtaining almost everywhere convergence. The relevant results for non homogeneous Markov chains indexed by a tree are extended.     

Weighted extensions of generalized cumulative residual entropy and their applications

Abstract

In this paper, we consider weighted extensions of generalized cumulative residual entropy and its dynamic(residual) version. Our results include linear transformations, stochastic ordering, bounds, aging class properties and some relationships with other reliability concepts. We also define the conditional weighted generalized cumulative residual entropy and discuss some properties of its. For these concepts, we obtain some characterization results under some assumptions. Finally, we provide an estimator of the new information measure using empirical approach. In addition, we study large sample properties of this estimator.     

A strong law of large number for negatively dependent and non identical distributed random variables in the framework of sublinear expectation

Abstract

In this article, in the framework of sublinear expectation initiated by Peng, we derive a strong law of large numbers (SLLN) for negatively dependent and non identical distributed random variables. This result includes and extends some existing results. Furthermore, we give two examples of our result for applications.     

On the formulation of uniform laws of large numbers: a truncation approach

The paper develops a general framework for the formulation of generic uniform laws of large numbers. In particular, we introduce a basic generic uniform law of large numbers that contains recent uniform laws of large numbers by Andrews [2] and Hoadley [9] as special cases. We also develop a truncation approach that makes it possible to obtain uniform laws of large numbers for the functions under consideration from uniform laws of large numbers for truncated versions of those functions. The point of the truncation approach is that uniform laws of large numbers for the truncated versions are typically easier to obtain. By combining the basic uniform law of large numbers and the truncation approach we also derive generalizations of recent uniform laws of large numbers introduced in Pötscher and Prucha [15, 16].     

A Strong Law of Large Numbers for Strongly Mixing Processes

We prove a strong law of large numbers for a class of strongly mixing processes. Our result rests on recent advances in understanding of concentration of measure. It is simple to apply and gives finite-sample (as opposed to asymptotic) bounds, with readily computable rate constants. In particular, this makes it suitable for analysis of inhomogeneous Markov processes. We demonstrate how it can be applied to establish an almost-sure convergence result for a class of models that includes as a special case a class of adaptive Markov chain Monte Carlo algorithms.