On martingale approximations

Consider additive functionals of a Markov chain $W_k$, with stationary (marginal) distribution and transition function denoted by $\pi$ and $Q$, say $S_n=g(W_1)+...+g(W_n)$, where $g$ is square integrable and has mean 0 with respect to $\pi$. If $S_n$ has the form $S_n=M_n+R_n$, where $M_n$ is a square integrable martingale with stationary increments and $E(R_n^2)=o(n)$, then $g$ is said to admit a martingale approximation. Necessary and sufficient conditions for such an approximation are developed. Two obvious necessary conditions are $E[E(S_n|W_1)^2]=o(n)$ and $\lim_{n\to \infty}E(S_n^2)/n<\infty$. Assuming the first of these, let $\Vert g\Vert^2_+=\limsup_{n\to \infty}E(S_n^2)/n$; then $\Vert\cdot\Vert_+$ defines a pseudo norm on the subspace of $L^2(\pi)$ where it is finite. In one main result, a simple necessary and sufficient condition for a martingale approximation is developed in terms of $\Vert\cdot\Vert_+$. Let $Q^*$ denote the adjoint operator to $Q$, regarded as a linear operator from $L^2(\pi)$ into itself, and consider co-isometries ($QQ^*=I$), an important special case that includes shift processes. In another main result a convenient orthonormal basis for $L_0^2(\pi)$ is identified along with a simple necessary and sufficient condition for the existence of a martingale approximation in terms of the coefficients of the expansion of $g$ with respect to this basis.Comment: Published in at http://dx.doi.org/10.1214/07-AAP505 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org

Law of the iterated logarithm for stationary processes

There has been recent interest in the conditional central limit question for (strictly) stationary, ergodic processes $...,X_{-1},X_0,X_1,...$ whose partial sums $S_n=X_1+...+X_n$ are of the form $S_n=M_n+R_n$, where $M_n$ is a square integrable martingale with stationary increments and $R_n$ is a remainder term for which $E(R_n^2)=o(n)$. Here we explore the law of the iterated logarithm (LIL) for the same class of processes. Letting $\Vert\cdot\Vert$ denote the norm in $L^2(P)$, a sufficient condition for the partial sums of a stationary process to have the form $S_n=M_n+R_n$ is that $n^{-3/2}\Vert E(S_n|X_0,X_{-1},...)\Vert$ be summable. A sufficient condition for the LIL is only slightly stronger, requiring $n^{-3/2}\log^{3/2}(n)\Vert E(S_n|X_0,X_{-1},...)\Vert$ to be summable. As a by-product of our main result, we obtain an improved statement of the conditional central limit theorem. Invariance principles are obtained as well.Comment: Published in at http://dx.doi.org/10.1214/009117907000000079 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

A non-linear Renewal Theorem with stationary and slowly changing perturbations

Non-linear renewal theory is extended to include random walks perturbed by both a slowly changing sequence and a stationary one. Main results include a version of the Key Renewal Theorem, a derivation of the limiting distribution of the excess over a boundary, and an expansion for the expected first passage time. The formulation is motivated by problems in sequential analysis with staggered entry, where subjects enter a study at random times.Comment: Published at http://dx.doi.org/10.1214/074921706000000680 in the IMS Lecture Notes--Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org

Estimating a Polya frequency function_2

We consider the non-parametric maximum likelihood estimation in the class of Polya frequency functions of order two, viz. the densities with a concave logarithm. This is a subclass of unimodal densities and fairly rich in general. The NPMLE is shown to be the solution to a convex programming problem in the Euclidean space and an algorithm is devised similar to the iterative convex minorant algorithm by Jongbleod (1999). The estimator achieves Hellinger consistency when the true density is a PFF_2 itself.Comment: Published at http://dx.doi.org/10.1214/074921707000000184 in the IMS Lecture Notes Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org