Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.
Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.
Real-time monitoring with RCA models
\email{[email removed]}
\email{[email removed]}
\address{$^1$Department of Mathematics, University of Utah, Salt Lake City,
UT 84112--0090 USA }
\address{$^2$School of Business and Economics, University of Leicester,
Leicester, U.K.; Department of Economics and Management, University of
Pavia, Pavia, Italy}
\subjclass[2020]{60F17}
abstractWe propose a family of weighted statistics based on the CUSUM
process of the WLS residuals for the online detection of changepoints in a
Random Coefficient Autoregressive model, using both the standard CUSUM and
the Page-CUSUM process. We derive the asymptotics under the null of no
changepoint for all possible weighing schemes, including the case of the
standardised CUSUM, for which we derive a Darling-Erd\H{o}s-type limit
theorem; our results guarantee the procedure-wise size control under both an
open-ended and a closed-ended monitoring. In addition to considering the
standard RCA model with no covariates, we also extend our results to the
case of exogenous regressors. Our results can be applied irrespective of
(and with no prior knowledge required as to) whether the observations are
stationary or not, and irrespective of whether they change into a stationary
or nonstationary regime. Hence, our methodology is particularly suited to
detect the onset, or the collapse, of a bubble or an epidemic. Our
simulations show that our procedures, especially when standardising the
CUSUM process, can ensure very good size control and short detection delays.
We complement our theory by studying the online detection of breaks in
epidemiological and housing prices series.
\doublespacing
Introduction
Economic history is full of events where stationary observations suddenly
become explosively increasing, or - vice versa - where explosive trends
crash. A classical example are financial bubbles, where periods of
\textquotedblleft tame\textquotedblright\ fluctuations are followed by
exuberant growth, in turn then followed by\ a collapse which is typically
modelled as a stationary regime (see e.g. harvey2017improving; and
phillips2018financial). Historical examples include the
\textquotedblleft Tulipmania\textquotedblright\ in the Netherlands in the
1630's and the \textquotedblleft South Sea\textquotedblright\ bubble of
1720. More recent instances include the Japan's real estate and stock market
bubble of the 1980's, which after the collapse turned into a negative
period, the so called \textquotedblleft Lost Decade\textquotedblright ; and,
in the US, the \textquotedblleft Dotcom\textquotedblright\ bubble of the
1990's and the housing bubble between 1996 and 2006. Similar phenomena, with
observations undergoing a change in persistence or even more radical changes
in their nature (from stationary to explosive and vice versa), are also
encountered in applied sciences. For example, in epidemiology, the onset of
a pandemic is characterised by a sudden, explosive growth in the number of
cases, followed by a return to a stationary regime when the pandemic
subsides. Hence the importance of developing tools allowing to test for
changes in persistence, or a switch between regimes.
In particular, a research area where this issue has been paid particular
attention is financial econometrics, where several methodologies have been
developed to tests (ex-ante or ex-post) for the onset or collapse of a
financial bubble. In the interest of a concise discussion, we refer the
reader to the seminal articles on ex-post detection by phillips2011,
and phillips2015testing2, and also to skrobotov2023testing
for a review. In addition, several contributions deal with the real-time
detection of bubble episodes - see, inter alia,
homm2012testing, phillips2015testing, and a recent
contribution by whitehouse2023real. A common trait to this
literature is that it relies on an AutoRegressive (AR) framework as the
workhorse model. Using an AR specification has several advantages: it is a
parsimonious and well-studied set-up, and it naturally lends itself to
modelling both stationary and nonstationary regimes.
phillips2011dating show that an AR model with explosiveness is an
adequate representation for bubble behaviour under very general assumptions.
Moreover, an AR specification lends itself to constructing tests for bubble
behaviour using the Dickey-Fuller test and its variants- e.g., the Augmented
DF test (ADF; see diba1988theory), the sup-ADF test (
phillips2011; phillips2011dating), and the generalized
sup-ADF test (phillips2015testing2; phillips2015testing
). From a technical viewpoint, however, using an AR model is fraught with
difficulties when monitoring for changes from an explosive to a stationary
regime, although several promising solutions have been proposed such as the
reverse regression approach by phillips2018financial. In addition to
the ability of detecting changes, ensuring a timely detection is important.
To the best of our knowledge, no optimality results exist; indeed, typical
procedures are based on unweighted CUSUM (or related) statistics,
which are not designed to ensure optimal detection timings (see e.g.
aue2004delay).
Main contributions of this paper
We address the general issue of online, real-time detection of changes in
persistence and also between regimes (i.e., from stationarity to
nonstationarity and vice versa) by using a Random Coefficient Autoregressive
(RCA) model, viz.
equation[equation omitted — 131 chars of source]
where $y_{0}$ denotes an initial value. The RCA model was firstly studied by
andel and nichollsquinn. It belongs in the wider class of
nonlinear models for time series (see fanyao), which have been
proposed \textquotedblleft as a reaction against the supremacy of linear
ones - a situation inherited from strong, though often implicit, Gaussian
assumptions\textquotedblright\ (akharif2003). The RCA\ model is
particularly well-suited to modelling time series with potentially explosive
behaviour; for example, in the seminal paper by diba1988theory, a
rational bubble is modelled as having an RCA dynamics (see their equation
(17)). Model ((ref)) also nests, as a special case corresponding to
having ${\Greekmath 010C} _{i}=1$, the so-called Stochastic Unit Root model (STUR; see
granger1997introduction), and it also allows for the possibility
of (conditional) heteroskedasticity in $y_{i}$; tsay1987 shows that
the widely popular ARCH\ model by engle1982 can be cast into the RCA
setup, which therefore can be viewed as a second-order equivalent. Finally,
a major advantage of ((ref)) compared to standard AR models is that it
is possible to construct estimators of ${\Greekmath 010C} _{0}$ that are always
asymptotically normal, irrespective of whether $y_{i}$ is stationary or
nonstationary (aue2011). Although the literature has developed
several contributions on ex-post changepoint detection using an RCA model
(e.g. horvath2022changepoint), to the best of our knowledge there
are still significant limitations in the context of online detection - e.g.,
na2010, li2015 and li2015b all consider sequential
changepoint detection using unweighted CUSUM-based statistics, but only
under the maintained assumption of stationarity, which precludes the ability
to detect changes from stationary to exponential behaviour, and vice versa.
In this paper, we fill the gaps discussed above, by proposing a family of
statistics based on the Weighted Least Squares (WLS) estimator, and in
particular on the weighted CUSUM\ process of the WLS residuals,
designed to ensure a faster detection than unweighted statistics. We study
the standard\ CUSUM process, and the so-called \textquotedblleft
Page-CUSUM\textquotedblright\ (fremdt2015page); and both
\textquotedblleft open-ended\textquotedblright\ and \textquotedblleft
closed-ended\textquotedblright\ procedures, where sequential monitoring goes
on indefinitely, or stops at a pre-specified point in time, respectively. We
make at least five contributions to the current literature on online
changepoint detection. First, we derive the limiting distribution of our
statistics under the closed-ended case; typically, in the literature, the
critical values obtained under the open-ended case are employed even for the
closed-ended case, as a (conservative) choice, ultimately leading to loss of
power. Second, we study the case of a closed-ended procedure with a
\textquotedblleft very short\textquotedblright\ monitoring horizon, adapting
the boundary function for this case, and deriving the corresponding limiting
distribution; this case has not been considered in the literature before,
but it is of pratical relevance because the researcher may prefer to carry
out monitoring for a short time, and then - in the absence of changepoints -
restart the procedure afresh. Third, in the case of the standardised
CUSUM,\footnote{
We define \textquotedblleft standardised CUSUM\textquotedblright\ the CUSUM\
process weighted using weights proportional to its standard deviation, as
opposed to the \textquotedblleft weighted CUSUM\textquotedblright\ which
uses lighter weights - see also below for a formal definition.} we propose
an approximation to compute critical values which offers a superior
alternative to asymptotic critical values, whose accuracy is marred by the
notoriously weak convergence to the Extreme Value Distribution; simulations
show that our approximation works extremely well even in small samples, and
for all cases considered, offering size control and short detection delays.
Fourth, we derive the limiting distribution of the weighted
Page-CUSUM statistics, showing also that such a limit is a well-defined
random variable. Fifth, as well as studying the basic RCA\ model, we also
develop the full-blown theory (irrespective of whether $y_{i}$ is stationary
or not) for the case where there are covariates in ((ref)); to the
best of our knowledge, this is the first contribution to deal with this
case. As a final remark, we would like to add that a major advantage of the
RCA\ set-up is that our statistics can be employed under both stationarity
and explosiveness with no modifications required; indeed, no prior knowledge
on the stationarity or not of the observations is required. Hence, our
methodology can be applied to detect changes in the persistence of a
stationary series, or changes from stationarity to a non-stationary regime,
or vice versa from a non-stationary regime to a stationary one. This has
important practical consequences, allowing for e.g. faster responses from
public health authorities in the presence of a pandemic, or from policy
makers in the presence of inflationary shocks, or a more accurate date
stamping of bubble onsets and collapses.
The remainder of the paper is organised as follows. We introduce our main
model, and the test statistics, in Section (ref). The asymptotics
under the null and the alternative is reported in Section (ref).
We consider the extension of the RCA model to the case of exogenous
regressors in Section (ref). Monte Carlo evidence is in Section
(ref); Section (ref) contains two empirical
applications, to Covid-19 hospitalisation data and house prices. Section (ref) concludes.
NOTATION. Henceforth, we use: \textquotedblleft $\rightarrow $
\textquotedblright\ for the ordinary limit; \textquotedblleft $\overset{
\mathcal{P}}{\rightarrow }$\textquotedblright\ for convergence in
probability; \textquotedblleft a.s.\textquotedblright\ for \textquotedblleft
almost surely\textquotedblright ; \textquotedblleft $\overset{a.s.}{
\rightarrow }$\textquotedblright\ for almost sure convergence; and
\textquotedblleft $\left\Vert \cdot \right\Vert $\textquotedblright\ for the
Euclidean norm of vectors and matrices. Finally, $\left\{ W\left( t\right)
,0\leq t\leq 1\right\} $ denotes a standard Wiener process. Other notation
is introduced later on in the paper.
Sequential monitoring of RCA\ models
Recall the RCA model
equation[equation omitted — 129 chars of source]
It is well-known (aue2006) that, in ((ref)), the stationarity
or lack thereof of $y_{i}$ is determined by the value of $E\log \left\vert
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert $:
itemize• if $-\infty \leq E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$, then $y_{i}$ converges exponentially fast to a
strictly stationary solution $\left\{ \overline{y}_{i},-\infty <i<\infty
\right\} $ for all initial values $y_{0}$;
• if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$,
then $y_{i}$ is nonstationary with $\left\vert y_{i}\right\vert \overset{a.s.
}{\rightarrow }\infty $ exponentially fast (berkes2009);
• if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$,
then $\left\vert y_{i}\right\vert \overset{\mathcal{P}}{\rightarrow }\infty $
, but at a rate slower than exponential (see Lemma A.4 in HT2016).
The following assumption must hold under all three cases above.
assumption$\{\left( {\Greekmath 010F} _{i,1},{\Greekmath 010F} _{i,2}\right) ,-\infty
<i<\infty \}$ are independent and identically distributed random variables
with (i) $E{\Greekmath 010F} _{i,1}=E{\Greekmath 010F} _{i,2}=0$; (ii) $
0<E{\Greekmath 010F} _{i,1}^{2}={\Greekmath 011B} _{1}^{2}<\infty $ and $0<E{\Greekmath 010F}
_{i,2}^{2}={\Greekmath 011B} _{2}^{2}<\infty $; (iii) $E{\Greekmath 010F}
_{i,1}{\Greekmath 010F} _{i,2}=0$; (iv) $E|{\Greekmath 010F} _{i,1}|^{{\Greekmath 0117} }<\infty $
and $E|{\Greekmath 010F} _{i,2}|^{{\Greekmath 0117} }<\infty $ for some ${\Greekmath 0117} >2$.
We further assume that the autoregressive parameter ${\Greekmath 010C} _{i}$ is constant
over the training segment $\left\{ y_{i},1\leq i\leq m\right\} $
assumption${\Greekmath 010C} _{i}={\Greekmath 010C} _{0}$ for $1\leq i\leq m$.
The requirement in Assumption (ref) is known as the
non-contamination assumption (see CSW96). We subsequently
test for the null hypothesis that, as new data come in after $m$, ${\Greekmath 010C}
_{i} $ remains constant, viz.
equation[equation omitted — 112 chars of source]
The WLS\ estimator using the observations on the training segment $\left\{
y_{i},1\leq i\leq m\right\} $ is
equation[equation omitted — 193 chars of source]
Standard weighted CUSUM-based detectors
We define the CUSUM\ process of the WLS\ residuals as
equation[equation omitted — 268 chars of source]
Heuristically, under the null of no change, the residuals have zero mean;
hence, the partial sum process $Z_{m}\left( k\right) $ - customarily known
as the detector - should also fluctuate around zero with increasing
variance. Conversely, in the presence of a break (at, say, $k^{\ast }$), $
\widehat{{\Greekmath 010C} }_{m}$ is a biased estimator for the \textquotedblleft
new\textquotedblright\ autoregressive parameter ${\Greekmath 010C} _{m+k^{\ast }+1}$;
thus, $Z_{m}\left( k\right) $ should have a drift term. Hence, a break is
flagged if $Z_{m}\left( k\right) $ exceeds a threshold. We call such a
threshold the boundary function, and propose the following family
equation[equation omitted — 213 chars of source]
In ((ref)), $0\leq {\Greekmath 0120} \leq 1/2$, and $\mathscr{s}$ is defined as
equation[equation omitted — 502 chars of source]
with ${\Greekmath 011B} _{1}^{2}$ and ${\Greekmath 011B} _{2}^{2}$ defined in Assumption (ref)
, and
equation*[equation* omitted — 251 chars of source]
where recall that $\left\{ \overline{y}_{i},-\infty <i<\infty \right\} $ is
the stationary solution of ((ref)).
On account of ((ref)) and ((ref)), a changepoint is found
at a stopping time ${\Greekmath 011C} _{m,{\Greekmath 0120} }$ defined as
equation[equation omitted — 425 chars of source]
The constant $c_{{\Greekmath 010B} ,{\Greekmath 0120} }$ in ((ref)) is chosen so as to
ensure that: (a) under the null, the procedure-wise probability of Type I\
Error does not exceed a user-chosen value ${\Greekmath 010B} $, viz. $
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }=\right. $ $\left. \infty
|H_{0}\right\} ={\Greekmath 010B} $; and (b) under the alternative, $\lim_{m\rightarrow
\infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }<\infty |H_{A}\right\} =1$.
In ((ref)), the monitoring goes on indefinitely (\textquotedblleft
open-ended\textquotedblright ). On the other hand, in some applications it
may be desirable to stop the sequential monitoring procedure after $m^{\ast
} $ period (\textquotedblleft closed-ended\textquotedblright ), e.g. in order to extend or
update the training period. In this case, we use the same detector $Z_{m}\left( k\right) $
defined in ((ref)), but we modify ((ref)) as
equation[equation omitted — 472 chars of source]
with boundary function
equation[equation omitted — 228 chars of source]
The boundary function $g_{m,{\Greekmath 0120} }^{\ast }\left( k\right) $ is suitable for
the case where the monitoring horizon $m^{\ast }$ is \textquotedblleft
long\textquotedblright , i.e. when it goes on for a period which is at least
proportional (or more than proportional) to the size of the training sample $
m$. If a shorter monitoring horizon is considered, where $m^{\ast }=o\left(
m\right) $, then we use the same detector as above, $Z_{m}\left( k\right) $,
but the boundary function needs to be modified as
equation[equation omitted — 224 chars of source]
In this case, the stopping rule is defined as
equation[equation omitted — 480 chars of source]
Page-CUSUM detectors
In a series of recent contributions, fremdt2015page,
kirch2022asymptotic and kirch2022sequential study a
different family of detectors, known as the \textquotedblleft
Page-CUSUM\textquotedblright\ processes, designed to offer a shorter
detection delay:
equation[equation omitted — 302 chars of source]
Intuitively, this family of detectors searches for the \textquotedblleft
worst-case scenario\textquotedblright\ at each point in time $k$, and
therefore should guarantee faster detection in the presence of a
changepoint. Consistently with the approach studied in this paper, we
consider weighted versions of $Z_{m}^{\dagger }\left( k\right) $;
the corresponding stopping rules are defined as:
equation[equation omitted — 457 chars of source]
with $g_{m,{\Greekmath 0120} }\left( k\right) $ defined in ((ref)), for an
open-ended procedure (replacing the critical value $c_{{\Greekmath 010B} ,{\Greekmath 0120} }$ with $
c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\dagger }$);
equation[equation omitted — 500 chars of source]
with $g_{m,{\Greekmath 0120} }^{\ast }\left( k\right) $ defined in ((ref)), for
the case of a closed-ended procedure with a long monitoring horizon
(replacing the critical value $c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\ast }$ with $c_{{\Greekmath 010B}
,{\Greekmath 0120} }^{\ast \dagger }$); and
equation[equation omitted — 513 chars of source]
with $\overline{g}_{m,{\Greekmath 0120} }\left( k\right) $ defined in ((ref)),
for the case of a closed-ended procedure with a short monitoring horizon
(replacing the critical value $\overline{c}_{{\Greekmath 010B} ,{\Greekmath 0120} }$ with $\overline{
c}_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\dagger }$).
Asymptotics
We begin by listing a set of technical assumptions, which complement
Assumption (ref) and are required in the case of nonstationarity, $
E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert \geq 0$.
assumptionIf $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert \geq
0 $, it holds that: (i) ${\Greekmath 010F} _{0,2}$ has a bounded density;
(ii) $\{{\Greekmath 010F} _{i,1},-\infty <i<\infty \}$ and $\{{\Greekmath 010F}
_{i,2},-\infty <i<\infty \}$ are independent.
assumptionIf $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$,
it holds that $P\left\{ \left( {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right)
y_{0}+{\Greekmath 010F} _{0,2}=x\right\} =0$ for all $-\infty <x<\infty $.
Assumption (ref) is required specifically in order to derive the
anti-concentration bound in ((ref)). Assumption (ref) ensures
that $\left\vert y_{i}\right\vert \overset{a.s.}{\rightarrow }\infty $,
ruling out that it could be identically equal to zero (see
berkes2009).
Asymptotics under the null
We derive the weak limits of our test statistics. Results differ depending
on the choice of the weight ${\Greekmath 0120} $, on whether an open-ended or a
closed-ended monitoring scheme is used (and, in the latter case, on the
length of the monitoring horizon), and on whether the detector is
constructed using the standard CUSUM or the Page-CUSUM. In all cases, we
derive nuisance free limiting distributions, from which critical values can
be obtained by simulation for a given desired nominal significance level, $
{\Greekmath 010B} $.
Weighted standard CUSUM-based detectors
We begin by studying the standard CUSUM detectors defined in Section (ref), starting with the open-ended case, also studied in
lajos04 in the context of a linear regression.
theoremWe assume that Assumptions (ref) and (ref)
hold, and either: (i) $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$ holds; or (ii) $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert =0$ and Assumption (ref) hold; or (iii) $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$ and Assumptions (ref)-(ref) hold. Then, under $H_{0}$ it holds that, for all ${\Greekmath 0120}
<1/2 $
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }=\infty \right\}
=P\left\{ \sup_{0<u\leq 1}\frac{\left\vert W\left( u\right) \right\vert }{
u^{{\Greekmath 0120} }}<c_{{\Greekmath 010B} ,{\Greekmath 0120} }\right\} .
\end{equation*}
We now turn to the closed-ended case. We begin by considering the case of (
(ref)), where the monitoring goes on for a sufficient amount of
time:
equation[equation omitted — 346 chars of source]
In this case, we use the boundary function $g_{m,{\Greekmath 0120} }^{\ast }\left(
k\right) $\ defined in ((ref)), and the corresponding stopping
rule ((ref)).\ Define $m_{\ast }=m_{0}/\left( 1+m_{0}\right) $ if $
m_{0}<\infty $, and $m_{\ast }=1$ if $m_{0}=\infty $.
theoremWe assume that the conditions of Theorem (ref), and ((ref)), are satisfied. Then, under $H_{0}$ it holds that, for all ${\Greekmath 0120}
<1/2$
\begin{equation}
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }^{\ast }=\infty \right\}
=P\left\{ \sup_{0<u\leq m_{\ast }}\frac{\left\vert W\left( u\right)
\right\vert }{u^{{\Greekmath 0120} }}<c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\ast }\right\} .
\end{equation}
We now study the case of ((ref)), in a closed-ended set-up where
monitoring stops after very few steps, viz.
equation[equation omitted — 198 chars of source]
In this case, we use the boundary function $\overline{g}_{m,{\Greekmath 0120} }\left(
k\right) $ defined in ((ref)), and the corresponding stopping
rule defined in ((ref)).
theoremWe assume that the conditions of Theorem (ref) and
((ref)) are satisfied. Then, under $H_{0}$ it holds that, for
all ${\Greekmath 0120} <1/2$
\begin{equation}
\lim_{m\rightarrow \infty }P\left\{ \overline{{\Greekmath 011C} }_{m,{\Greekmath 0120} }=\infty
\right\} =P\left\{ \sup_{0<u\leq 1}\frac{\left\vert W\left( u\right)
\right\vert }{u^{{\Greekmath 0120} }}<\overline{c}_{{\Greekmath 010B} ,{\Greekmath 0120} }\right\} .
\end{equation}
We now turn to the case ${\Greekmath 0120} =1/2$, studying the closed-ended monitoring
procedure under both ((ref)) and ((ref)). Define
equation[equation omitted — 265 chars of source]
and
equation[equation omitted — 214 chars of source]
theoremWe assume that the conditions of Theorem (ref) are satisfied.
Then, under $H_{0}$ for all $-\infty <x<\infty $:
\begin{itemize}
• if ((ref)) holds, then it holds that $\lim_{m\rightarrow
\infty }P\left\{ {\Greekmath 011C} _{m,0.5}^{\ast }=m^{\ast }\right\} $ $=$ $\exp \left(
-\exp \left( -x\right) \right) $;
• if ((ref)) holds, then it holds that $
\lim_{m\rightarrow \infty }P\left\{ \overline{{\Greekmath 011C} }_{m,0.5}=m^{\ast
}\right\} $ $=$ $\exp \left( -\exp \left( -x\right) \right) $.
\end{itemize}
Upon inspecting the proofs of Theorems (ref)-(ref) and
(ref), the limiting distributions of the weighted CUSUM with ${\Greekmath 0120} <1/2$,
and of the standardised CUSUM with ${\Greekmath 0120} =1/2$ are asymptotically
independent,\footnote{
Intuitively, this is because $W\left( \cdot \right) $ has independent
increments, and the limiting distribution, in the case of $0\leq {\Greekmath 0120} <1/2$,
is determined by the \textquotedblleft central\textquotedblright\ values of $
W\left( \cdot \right) $; conversely, when ${\Greekmath 0120} =1/2$, the limiting law is
determined by values at the very beginning of $W\left( \cdot \right) $.} and
therefore the two procedures, in principle, can be combined.
Theorem (ref) offers an explicit formula to compute asymptotic critical
values; however, these are bound to be inaccurate due to the slow
convergence to the Extreme Value distribution. In particular, simulations
show that, in finite samples, asymptotic critical values overstate the true
values thus leading to low power. A possible correction can be proposed, similarly to gombay, as follows. Define $
h_{m^{\ast }}=h_{m^{\ast }}\left( m^{\ast }\right) $ such that, as $m^{\ast
}\rightarrow \infty $
equation[equation omitted — 177 chars of source]
and let ${\Greekmath 011E} _{m}=\left( m^{\ast }+h_{m^{\ast }}\right) /\left( 2h_{m^{\ast
}}\right) $. Let also $\widehat{c}_{{\Greekmath 010B} ,0.5}\rightarrow \infty $ denote
the solution of
equation[equation omitted — 332 chars of source]
theoremWe assume that the conditions of Theorem (ref) are
satisfied. Then, replacing $c_{{\Greekmath 010B} ,0.5}^{\ast }$\ and $\overline{c}
_{{\Greekmath 010B} ,0.5}$\ with $\widehat{c}_{{\Greekmath 010B} ,0.5}$ defined in ((ref)
), it holds that $\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,0.5}^{\ast
}=m^{\ast }\right\} $ $=$ ${\Greekmath 010B} $ and $\lim_{m\rightarrow \infty }P\left\{
\overline{{\Greekmath 011C} }_{m,0.5}=m^{\ast }\right\} ={\Greekmath 010B} $ respectively.
The choice of $h_{m^{\ast }}$\ is a matter of tuning; qualitatively, as $
h_{m^{\ast }}$ increases, critical values become smaller (thus making the
procedure more conservative) and vice versa. Our simulations indicate that $
h_{m^{\ast }}=\left( \log m^{\ast }\right) ^{1/2}$ yields the best results
in terms of size and power.
Weighted Page-CUSUM detectors
We now consider the use of the Page-CUSUM detector $Z_{m}^{\dagger }\left(
k\right) $ defined in ((ref)), using the stopping rules defined in ((ref))-((ref)). Let $\left\{ W_{1}\left( x\right) ,x\geq
0\right\} $\ and $\left\{ W_{2}\left( x\right) ,x\geq 0\right\} $\ denote
two independent standard Wiener processes.
theoremWe assume that the conditions of Theorem (ref) are
satisfied. Then, under $H_{0}$, for all ${\Greekmath 0120} <1/2$
\begin{itemize}
• it holds that
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }^{\dagger }=\infty
\right\} =P\left\{ \sup_{0<x<\infty }\frac{\sup_{0\leq t\leq x}\left\vert
\left( W_{2}\left( x\right) -W_{2}\left( t\right) \right) -\left( x-t\right)
W_{1}\left( 1\right) \right\vert }{\left( 1+x\right) \left( x/\left(
1+x\right) \right) ^{{\Greekmath 0120} }}<c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\dagger }\right\} ;
\end{equation*}
• if, in addition, ((ref)) holds, then it holds that
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120} }^{\dagger \ast }=\infty
\right\} =P\left\{ \sup_{0<x\leq m_{0}}\frac{\sup_{0\leq t\leq x}\left\vert
\left( W_{2}\left( x\right) -W_{2}\left( t\right) \right) -\left( x-t\right)
W_{1}\left( 1\right) \right\vert }{\left( 1+x\right) \left( x/\left(
1+x\right) \right) ^{{\Greekmath 0120} }}<c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\dagger \ast }\right\} ;
\end{equation*}
• if, in addition, ((ref)) holds, then it holds that
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ \overline{{\Greekmath 011C} }_{m,{\Greekmath 0120} }^{\dagger
}=\infty \right\} =P\left\{ \sup_{0<x\leq 1}\frac{\sup_{0\leq t\leq
x}\left\vert \left( W\left( x\right) -W\left( t\right) \right) \right\vert }{
x^{{\Greekmath 0120} }}<\overline{c}_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\dagger }\right\} .
\end{equation*}
\end{itemize}
LRV\ estimation
In order to apply all the results above, we require an estimate of $
\mathscr{s}^{2}$ defined in ((ref)). This can be constructed using the
data in the training sample as
equation[equation omitted — 196 chars of source]
corollaryUnder the conditions of Theorem (ref), it holds that $
\widehat{\mathscr{s}}_{m}^{2}\overset{\mathcal{P}}{\rightarrow }\mathscr{s}
^{2}$.
We note that $\widehat{\mathscr{s}}_{m}^{2}$ does not depend on ${\Greekmath 0120} $, so
the result in Corollary (ref) can be applied for all $0\leq {\Greekmath 0120}
\leq 1/2$, and for both open-ended and closed-ended procedures.
Asymptotics under the alternative
We consider the following alternative, where the deterministic part of the
autoregressive coefficient of ((ref)) undergoes a change
equation[equation omitted — 325 chars of source]
where ${\Greekmath 010C} _{0}\neq {\Greekmath 010C} _{A}$ and $k^{\ast }$ is the time of change. In (
(ref)), we do not put any constraints on the values of ${\Greekmath 010C}
_{0}$ and ${\Greekmath 010C} _{A}$. Hence, under ((ref)), the observations
could transition from a stationary regime to another stationary regime (if
both $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$ and $E\log
\left\vert {\Greekmath 010C} _{A}+{\Greekmath 010F} _{0,1}\right\vert <0$); from a nonstationary
regime to another nonstationary regime (if both $E\log \left\vert {\Greekmath 010C}
_{0}+{\Greekmath 010F} _{0,1}\right\vert \geq 0$ and $E\log \left\vert {\Greekmath 010C}
_{A}+{\Greekmath 010F} _{0,1}\right\vert \geq 0$); or either regime can be stationary
and the other one nonstationary (which arises if $E\log \left\vert {\Greekmath 010C}
_{0}+{\Greekmath 010F} _{0,1}\right\vert <0$ and $E\log \left\vert {\Greekmath 010C}
_{A}+{\Greekmath 010F} _{0,1}\right\vert \geq 0$, implying a switch from stationarity
to nonstationarity, or if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert \geq 0$ and $E\log \left\vert {\Greekmath 010C} _{A}+{\Greekmath 010F}
_{0,1}\right\vert <0$, implying a switch from nonstationarity to
stationarity). We entertain the possibility that the amplitude of change may
depend on the (training) sample size $m$, thus defining
equation[equation omitted — 89 chars of source]
theoremWe assume that ((ref)) holds with $k^{\ast
}=O\left( m\right) $. Under the conditions of Theorem (ref), if it
holds that
\begin{equation}
\lim_{m\rightarrow \infty }m^{1/2}\left\vert \Delta _{m}\right\vert =\infty ,
\end{equation}
then it holds that $\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,{\Greekmath 0120}
}<\infty |H_{A}\right\} =1$, for all ${\Greekmath 0120} <1/2$. Under the conditions of
Theorem (ref), if it holds that
\begin{equation}
\lim_{m\rightarrow \infty }\frac{m^{1/2}\left\vert \Delta _{m}\right\vert }{
\sqrt{\log \log m}}=\infty ,
\end{equation}
then it holds that $\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 011C} _{m,0.5}^{\ast
}<\infty |H_{A}\right\} =1$. The same results hold under the conditions of
Theorem (ref); and under the conditions of Theorem (ref)
upon replacing $m$ with $m^{\ast }$ in ((ref)) and ((ref)). The same results also hold, for ${\Greekmath 0120} <1/2$, using the
procedures based on the Page-CUSUM detector $Z_{m}^{\dagger }\left( k\right)
$ defined in ((ref))-((ref)).
Condition ((ref)) entails that $\left\vert \Delta
_{m}\right\vert $ can drift to zero, but not too fast (i.e., power is
ensured as long as breaks are \textquotedblleft not too
small\textquotedblright ), for all ${\Greekmath 0120} <1/2$. When using ${\Greekmath 0120} =1/2$,
condition ((ref)) suggests that there is a (minor) loss of power. A
straightforward extension of the proofs in aue2004delay and
aue2008monitoring would yield that the detection delay is
proportional to $m^{\left( 1-2{\Greekmath 0120} \right) /\left( 2\left( 1-{\Greekmath 0120} \right)
\right) }$ when ${\Greekmath 0120} <1/2$, and to $\log \log m$ when ${\Greekmath 0120} =1/2$, thus
indicating that heavier weights ensure faster detection.
Monitoring the RCA\ model with covariates
In a recent contribution, astill2023using argue in favour of adding
covariates to the basic AR specification, showing theoretically and
empirically that this results in better (and quicker) detection of bubble
episodes. Hence, we modify ((ref)) as
equation[equation omitted — 192 chars of source]
where $y_{0}$ is an initial value and $\mathbf{x}_{i}\in \mathbb{R}^{p}$.
Equation ((ref)) is, essentially, a dynamic model with exogenous
covariates, with $\mathbf{{\Greekmath 0115} }_{0}$ constant over time.
In order to monitor for the stability of the autoregressive coefficient, we
propose again a detector based on the WLS loss function
equation[equation omitted — 253 chars of source]
The estimators of ${\Greekmath 010C} _{0}$ and $\mathbf{{\Greekmath 0115} }_{0}$ are defined as $
\left( \widehat{{\Greekmath 010C} }_{m},\widehat{\mathbf{{\Greekmath 0115} }}_{m}\right) =\arg
\min_{{\Greekmath 010C} ,\mathbf{{\Greekmath 0115} }}\mathcal{G}_{m}\left( {\Greekmath 010C} ,\mathbf{{\Greekmath 0115} }
\right) $, and satisfy
equation[equation omitted — 361 chars of source]
which suggests the following detector
equation[equation omitted — 263 chars of source]
The following assumptions complement Assumptions (ref)-(ref).
assumption(i) $E\left\Vert \mathbf{x}_{i}\right\Vert ^{{\Greekmath 0114}
_{1}}<\infty $ for some ${\Greekmath 0114} _{1}>4$; (ii) $\mathbf{x}_{i}=
\mathbf{g}\left( {\Greekmath 0111} _{i},{\Greekmath 0111} _{i-1},...\right) $, where $\mathbf{g}:
\mathcal{S}^{\infty }\rightarrow \mathbb{R}^{p}$ is a non-random, measurable
function and $\left\{ {\Greekmath 0111} _{i},-\infty <i<\infty \right\} $ are
i.i.d. random variables with values in the measurable space $\mathcal{S}$
and $\left( E\left\Vert \mathbf{x}_{i}-\mathbf{x}_{i,j}^{\ast }\right\Vert
^{{\Greekmath 0114} _{1}}\right) ^{1/{\Greekmath 0114} _{1}}\leq c_{0}j^{-{\Greekmath 0114} _{2}}$, with some
$c_{0}>0$ and ${\Greekmath 0114} _{2}>2$, where $\mathbf{x}_{i,j}^{\ast }=\mathbf{g}
\left( {\Greekmath 0111} _{i},...,{\Greekmath 0111} _{i-j+1},{\Greekmath 0111} _{i-j,i,j}^{\ast },{\Greekmath 0111}
_{i-j-1,i,j}^{\ast }...\right) $ where $\left\{ {\Greekmath 0111} _{\ell ,i,j}^{\ast
},-\infty <\ell ,i,j<\infty \right\} $ are i.i.d. random copies of $
{\Greekmath 0111} _{0}$, independent of $\left\{ {\Greekmath 0111} _{i},-\infty <i<\infty \right\} $.
assumption$\left\{ \left( {\Greekmath 010F} _{i,1},{\Greekmath 010F} _{i,2}\right)
,-\infty <i<\infty \right\} $ and $\left\{ {\Greekmath 0111} _{i},-\infty <i<\infty
\right\} $ are independent.
assumptionIf $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$
, it holds that $P\left\{ \left( {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right) y_{0}+
\mathbf{{\Greekmath 0115} }^{\intercal }\mathbf{x}_{0}+{\Greekmath 010F} _{0,2}=x\right\} =0$
for all $-\infty<x<\infty$.
Assumption (ref) states that the regressors $\mathbf{x}_{i}$ form a
decomposable Bernoulli shift - i.e., a weakly dependent, stationary process
which can be well-approximated by an $m$-dependent sequence. The concepts of
Bernoulli shift and decomposability appeared first in
ibragimov1962some; see also wu2005 and berkeshormann
. Bernoulli shifts have proven a convenient way to model dependent time
series, mainly due to their generality and to the fact that they are much
easier to verify than e.g. mixing conditions: aue09 and
linliu, inter alia, provide numerous examples of such DGPs,
which include ARMA models, ARCH/GARCH sequences, and other nonlinear time
series models (such as e.g. random coefficient autoregressive models and
threshold models). Indeed, under stationarity, $y_{i}$ itself can be
approximated by a decomposable Bernoulli shift (
horvath2022changepoint). Assumption (ref) states that the
exogenous variables $\mathbf{x}_{i}$ are independent of the innovations $
{\Greekmath 010F} _{i,1}$ and ${\Greekmath 010F} _{i,2}$, and Assumption (ref) is
similar to Assumption (ref), ensuring $\left\vert y_{i}\right\vert
\overset{a.s.}{\rightarrow }\infty $.
Finally, we note that, in the presence of covariates, we need to exclude the
boundary case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$;
this is because we would need an exact (and large enough) rate of divergence
for $\left\vert y_{i}\right\vert $ as $i\rightarrow \infty $, but this
result is not available in the case $E\log |{\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}|=0$
(see also Theorem 4 in HT2019, and the discussion thereafter).
\newline
The boundary function is defined as
equation[equation omitted — 302 chars of source]
where $c_{{\Greekmath 010B} ,{\Greekmath 0120} }^{\left( x\right) }$ is a critical value, and
equation[equation omitted — 476 chars of source]
equation*[equation* omitted — 447 chars of source]
with
equation[equation omitted — 388 chars of source]
where $\mathbf{a}$, $\mathbf{Q}$ and $\mathbf{C}$ are defined in ((ref))-(
(ref)) in the Supplement. The stopping rule is
equation[equation omitted — 494 chars of source]
and
equation[equation omitted — 507 chars of source]
for an open-ended and a closed-ended monitoring procedure respectively.
theoremWe assume that Assumptions (ref), (ref), and (ref) are satisfied, and either (i) $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$, or (ii) $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert >0$ and Assumption (ref) hold. Then, under $H_{0}$,
the results of Theorems (ref), (ref)\ and (ref) hold
for ${\Greekmath 011C} _{m,{\Greekmath 0120} }^{\left( x\right) }$, ${\Greekmath 011C} _{m,{\Greekmath 0120} }^{\ast \left(
x\right) }$ and $\overline{{\Greekmath 011C} }_{m,{\Greekmath 0120} }^{\left( x\right) }$\
respectively.
theoremWe assume that the conditions of Theorem (ref) are
satisfied. Then, for ${\Greekmath 0120} =1/2$, under $H_{0}$, the same results as in
Theorem (ref) hold.
Along the same lines as in Section (ref), it is possible to
construct weighted monitoring schemes based on the detector
equation[equation omitted — 391 chars of source]
theoremWe assume that Assumptions (ref), (ref), and
(ref), and ((ref)), are satisfied, and either (i) $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, or (ii) $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$ and Assumption (ref) hold. Then, under $H_{0}$, the results of Theorem (ref)
hold.
In all the results above, the limiting behaviour of the stopping time is the
same as in the absence of covariates; however, this does not mean that these
do not play a role, since they build into the recursion that defines $y_{i}$
. As far as Theorem (ref) is concerned, the same approximation for
critical values as in ((ref)) can be used.
Under the alternative that the deterministic part of the autoregressive root
changes,
equation[equation omitted — 441 chars of source]
the same results as in Section (ref) hold, as summarised in
the following theorem.
theoremWe assume that the conditions of Theorem (ref)
are satisfied. Then, under ((ref)), the same results as in Theorem
(ref) hold.
Simulations
We provide some Monte Carlo evidence and guidelines on implementation;
further details and results are reported in Section (ref) in the
Supplement. We consider the following Data Generating Process, based on ((ref))
equation[equation omitted — 158 chars of source]
for $1\leq i\leq m+1,000$, where we simulate ${\Greekmath 010F} _{i,1}$ and ${\Greekmath 010F}
_{i,2}$ as independent of one another and i.i.d. with distributions
$N\left( 0,{\Greekmath 011B} _{1}^{2}\right) $ and $N\left( 0,{\Greekmath 011B} _{2}^{2}\right) $
respectively, discarding the first $1,000$ observations to avoid dependence
on initial conditions. We used ${\Greekmath 011B} _{1}^{2}=0.01$ in all experiments,
and we have considered three cases: in Case I, we set ${\Greekmath 010C}
_{0}=0.5$, with $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{i,1}\right\vert
=-0.717$, corresponding to a stationary regime; in Case II, we set $
{\Greekmath 010C} _{0}=1.05$, with $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{i,1}\right\vert =0.044$, corresponding to a mildly explosive regime; and
in Case III, we set ${\Greekmath 010C} _{0}=1$, with $E\log \left\vert {\Greekmath 010C}
_{0}+{\Greekmath 010F} _{i,1}\right\vert =-0.007$, indicating a stationary, but
\textquotedblleft nearly non-stationary\textquotedblright\ process (this
case corresponds to the STUR model). The variance of the idiosyncratic shock
is ${\Greekmath 011B} _{2}^{2}=0.5$ in Case I, and ${\Greekmath 011B} _{2}^{2}=0.1$ in Cases II
and III; in unreported simulations, using different
values does not result in any significant changes, save for the (expected)
fact that tests have better properties (in terms of size and power) for
smaller values of ${\Greekmath 011B} _{2}^{2}$. When covariates are used, we set $
{\Greekmath 0115} _{0}=1$ and generate $x_{i}$ as i.i.d.$N\left( 0,1\right) $
. Critical values (for a nominal level equal to $5\%$) are computed using
the results in Theorem (ref) when using the weighted CUSUM with ${\Greekmath 0120}
<1/2$, and Theorem (ref)(ii) when using Page-CUSUM
statistics. When using the weighted CUSUM with ${\Greekmath 0120} =1/2$, we use both the
asymptotic critical values $c_{{\Greekmath 010B} ,0.5}$\ defined in ((ref)),
and the approximation $\widehat{c}_{{\Greekmath 010B} ,0.5}$\ defined as the solution
of ((ref)), with $h_{m^{\ast }}=\left( \log m^{\ast }\right) ^{1/2}$
. Results are based on $1,000$ replications.
Empirical rejection frequencies are in Tables (ref)-(ref),
where we consider the case where, in ((ref)), ${\Greekmath 0115} _{0}=0$ - i.e., a
\textquotedblleft pure\textquotedblright\ RCA without covariates. In the
case of stationarity (Table (ref)), the procedure-wise probability
of Type I Errors is always controlled when using ${\Greekmath 0120} =1/2$; the asymptotic
critical values $c_{{\Greekmath 010B} ,0.5}$\ defined in ((ref)) lead to
under-rejection, as can be expected in light of the slow convergence to the
asymptotic distribution; conversely, their approximation using $\widehat{c}
_{{\Greekmath 010B} ,0.5}$\ defined as the solution of ((ref)) achieves size
control in all cases considered. When using ${\Greekmath 0120} <1/2$, both in the case of
the CUSUM and the Page-CUSUM, the procedure-wise probability of Type I
Errors is also controlled, but larger sample sizes $m$ are required. In the
explosive case (Table (ref)), our procedures tend to under-reject
whenever using ${\Greekmath 0120} =1/2$ (both with $c_{{\Greekmath 010B} ,0.5}$\ and $\widehat{c}
_{{\Greekmath 010B} ,0.5}$), although this seems to slowly improve as $m$ increases,
for all lengths of the monitoring horizon $m^{\ast }$; results are less
conservative when using ${\Greekmath 0120} <1/2$, again both in the case of the CUSUM and
the Page-CUSUM. On the other hand, in the STUR case (Table (ref)),
empirical rejection frequencies tend to be higher than in the other cases.
The procedure-wise probability of Type I Errors is controlled in all cases
when using ${\Greekmath 0120} =1/2$ and $c_{{\Greekmath 010B} ,0.5}$, whereas using $\widehat{c}
_{{\Greekmath 010B} ,0.5}$\ requires either large $m$ ($\geq 200$), or not overly long
monitoring horizons when $m<200$ (in those cases, using $m^{\ast }\leq m$
always results in size control). When ${\Greekmath 0120} <1/2$, size control is more
problematic and the procedure tends to be oversized, unless $m^{\ast }$ is
\textquotedblleft small\textquotedblright\ compared to $m$. Whilst results
are broadly similar for the CUSUM and the Page-CUSUM, we note that the
latter yields marginally improved size control over the former.
The main message of Tables (ref)-(ref) is that, broadly
speaking, using the CUSUM with ${\Greekmath 0120} =1/2$ seems the preferred solution
across all cases considered. The choice between $c_{{\Greekmath 010B} ,0.5}$\ and $
\widehat{c}_{{\Greekmath 010B} ,0.5}$ essentially depends on $m$ (and $m^{\ast }$), but
in the vast majority of the cases considered, using $\widehat{c}_{{\Greekmath 010B}
,0.5}$ offers excellent size control without having an overly conservative
procedure. Our results suggest avoiding overly long monitoring horizons when
$m\leq 100$. In these cases, monitoring can be carried out firstly over a
short horizon and, if no changepoints are detected, the procedure can be
started afresh including the previous monitoring horizon within the training
sample. In Tables (ref)-(ref) in the Supplement, we
report empirical rejection frequencies in the presence of covariates in ((ref)). Results are broadly similar, but empirical rejection frequencies
increase in all cases considered. In the stationary case (Table (ref)), results are essentially the same, and, in the explosive case
(Table (ref)), the increase in empirical rejection frequencies
leads to improvements, making the procedure less conservative. The latter
result is interesting, and it suggests that sequential monitoring during a
bubble phase may benefit from including control variables in the price
dynamics. On the other hand, results worsen in the STUR case (Table (ref)), and the procedures tend to (sometimes massively) over-reject.
The best results are obtained with ${\Greekmath 0120} =1/2$ and $c_{{\Greekmath 010B} ,0.5}$, which
achieves size control at least when $m>50$ (or when $m\leq 50$, but the
monitoring horizon is not too long, i.e. $m^{\ast }\leq m$). This suggests
that, when covariates are included in the basic RCA specification, ${\Greekmath 0120}
=1/2 $ and $c_{{\Greekmath 010B} ,0.5}$ should be employed - especially when trying to detect the inception of a bubble from a near
stationary regime.
We would like to emphasize that all the cases considered above are fully
under the researcher's control: whether to include covariates or not, and
the length of the monitoring horizon $m^{\ast }$, can be decided a
priori; as mentioned above, preliminary analysis on $y_{i}$ during the
training period offers further help.
table*[table* omitted — 11,724 chars of source]
table*[table* omitted — 11,726 chars of source]
table*[table* omitted — 11,723 chars of source]
Under the alternative, monitoring is carried out for $m+1\leq i\leq
m+m^{\ast }$, with the same specifications as in Cases I-III and
equation[equation omitted — 197 chars of source]
We set: $\Delta =0.5$ under Case I, with ${\Greekmath 010C} _{A}=0.75$ and $E\log
\left\vert {\Greekmath 010C} _{A}+{\Greekmath 010F} _{i,1}\right\vert =-0.298$, thus having a
change in persistence with $y_{i}$ stationary under the null and the
alternative; $\Delta =-0.1$ under Case II, with ${\Greekmath 010C} _{A}=0.969$ and $
E\log \left\vert {\Greekmath 010C} _{A}+{\Greekmath 010F} _{i,1}\right\vert =-0.063$, thus having
a change from nonstationarity to stationarity; and $\Delta =0.1$ under Case III, with ${\Greekmath 010C} _{A}=1.1$ and $
E\log \left\vert {\Greekmath 010C} _{A}+{\Greekmath 010F} _{i,1}\right\vert =0.089$, thus having
a change from stationarity to nonstationarity. Median delays and empirical rejection frequencies for $m=200$,
under the case of no covariates (${\Greekmath 0115} _{0}=0$), are in Table (ref).
table*[table* omitted — 6,458 chars of source]
Under stationarity, using ${\Greekmath 0120} =0.45$ yields the best results in terms of
delay and power, with little difference between the CUSUM and the Page-CUSUM
(with the latter occasionally delivering higher power, if not shorter
detection delays); results are anyway satisfactory also when using ${\Greekmath 0120}
=1/2 $ with $\widehat{c}_{{\Greekmath 010B} ,0.5}$, which is always either the best or
the second best in terms of detection delay. The same results are observed
in the explosive and in the STUR cases. The latter is particularly
remarkable: using ${\Greekmath 0120} =1/2$ with $\widehat{c}_{{\Greekmath 010B} ,0.5}$ delivers
essentialy the same performance as using ${\Greekmath 0120} =0.45$; however, according to
Table (ref), the latter choice yields an oversized procedure, thus
making its performance under the alternative less reliable. Hence, Table (ref) essentially indicates that using ${\Greekmath 0120} =1/2$ with $\widehat{c}
_{{\Greekmath 010B} ,0.5}$ yields the best results in terms of timeliness of detection
and power. As a final remark, detection delays worsen as $m^{\ast }$
increases; this is a natural phenomenon, since critical values (see e.g.
Corollary (ref)) increase with $m^{\ast }$, thus making detection,
ceteris paribus, more infrequent. In Table (ref) in the
Supplement, we report median delays and empirical rejection frequencies in
the presence of covariates in the basic RCA specification. Our guidelines
based on size control suggest using ${\Greekmath 0120} =1/2$ with $c_{{\Greekmath 010B} ,0.5}$ in
this case; median delays appear very satisfactory, although the cases ${\Greekmath 0120}
=1/2$ with $\widehat{c}_{{\Greekmath 010B} ,0.5}$ and especially ${\Greekmath 0120} =0.45$ perform
better in several cases.
In conclusion, the results in this section show that online changepoint
detection in an RCA\ model based on weighted CUSUM statistics seems to work
very well both under stationarity and nonstationarity. Broadly speaking, in
the latter case using the standardised CUSUM (i.e., ${\Greekmath 0120} =1/2$) is
the preferred choice; in the former case, choosing ${\Greekmath 0120} $ close to (but
smaller than) $1/2$, appears to yield the best compromise between size
control and timely detection.
Empirical applications: finding bubbles in RCA\ models
We validate our approach through two empirical applications, both involving
(potentially) nonstationary data. In Section (ref), we consider a
\textquotedblleft pure\textquotedblright\ RCA model with no covariates, and
use it to detect daily Covid-19 hospitalisations; in Section (ref),
we consider and RCA model with covariates, and use it to detect changes in
the dynamics of house prices.
Sequential monitoring of Covid-19 hospitalisations
We consider daily data on Covid-19 hospitalisations. There is a huge
literature on the application of time series methods to the reduced form of
epidemiological models; shtatland, inter alia, advocate
using a low-order autoregression as an approximation of the popular SIR\
model, especially as a methodology for the early detection of outbreaks; and
jeremy apply the RCA model to a similar dataset, detecting several
changepoints. In this context, it is important to check whether the
observations change from an explosive to a stationary regime (meaning that
the epidemic is slowing down), or vice versa whether they change from a
stationary to an explosive regime (corresponding to a surge in the
epidemic). Our dataset consists of daily data for England recorded between
March 19th, 2020, and January 30th, 2021, i.e. spanning the period from
approximately the first lockdown (which was announced on March 23rd, 2020),
until after the third and last lockdown of January 6th, 2021. We transform
the series into logs (plus one since on some days the number of
hospitalisation is zero); no further pre-processing is applied.\footnote{
The data are available from
\url{https://ourworldindata.org/grapher/uk-daily-covid-admissions?tab=chart
&stackMode=absolute&time=2020-03-29..latest®ion=World}
See also
\url{https://www.instituteforgovernment.org.uk/sites/default/files/2022-12/timeline-coronavirus-lockdown-december-2021.pdf}
, for a timeline of the UK Government decisions on lockdown and closures.}
We use a \textquotedblleft pure\textquotedblright\ RCA\ specification with
no covariates. The purpose of our exercise is to ascertain whether public
health authorities, back in 2020, could have benefited from the use of a
sequential monitoring procedure to flag changes in the dynamics of daily
hospitalisations, thus informing their decisions. We have used ${\Greekmath 0120} =1/2$
in $g_{m,{\Greekmath 0120} }\left( k\right) $ in ((ref)); based on the empirical
rejection frequencies reported in Tables (ref)-(ref), we
use the critical values $\widehat{c}_{{\Greekmath 010B} ,0.5}$ defined in ((ref));\footnote{
Results with different values of ${\Greekmath 0120} $ - and with ${\Greekmath 0120} =1/2$ and
asymptotic critical values - are available upon request.} in all scenarios
we set the length of the monitoring horizon always equal to the training
sample size, i.e. $m=m^{\ast }$, which, according to the results in Tables
(ref)-(ref), always ensures size control.
table*[table* omitted — 1,811 chars of source]
By way of preliminary analysis (and also to assess how our online detection
methodology fares), in Section (ref) in the Supplement we
apply the test by horvath2022changepoint to the whole sample (Table
(ref)). In particular, after the closure of the education and
hospitality sectors in all UK nations announced on March 23rd, 2020 (and
implemented 3 days later), a changepoint is found at April 10th, 2020,
indicating that the lockdown had started to \textquotedblleft
bite\textquotedblright\ after that date; subsequently, another changepoint
is found towards the end of August, which can be naturally interpreted as
the beginning of the second wave in the UK, after an increase in travelling
during the holiday season. Hence, we use, as training sample, the period
between April 11th, 2020 and August 15th, 2020, with $m=127$. We find
evidence of a changepoint on August 28th, 2020. As can be seen in Table (ref) in the Supplement, the ex-post test by
horvath2022changepoint finds a break at August 26th. Clearly, a
direct comparison between the two tests is not meaningful, since ex-post
detection uses the information contained in the full sample, whereas online
detection cannot make use of it - thus putting the latter at a disadvantage
compared to the former. Still, there is (only) a two days delay between the
two procedures. Moreover, the August changepoint was officially acknowledged
by the PM on September 18th, 2020; hence, our sequential monitoring
procedure could have brought forward public health decisions. The value of $
{\Greekmath 010C} $ after the break is above $1$, indicating an explosive dynamics in
Covid-19 hospitalisations. Table (ref) in the Supplement
indicates that there was a further break on October 29th, 2020,
corresponding to the lockdown at the end of that month. Hence, we restart
our monitoring procedure, and we use the training sample August 29th, 2020
till October 29th, 2020, with $m=61$; under an explosive regime, this should
suffice to ensure size control and short detection delay, according to the
results in Tables (ref) and (ref). A changepoint is
flagged on November 4th, 2020, with a decline in ${\Greekmath 010C} $ indicating the
effect of the closures and also of the growing concerns about a second wave.
The break is detected very close to (and indeed before) the
lockdown, suggesting that lockdowns tended to occur when a turning point in
hospitalisations had already occurred, or was \textquotedblleft in the
making\textquotedblright . Such evidence can be read in conjunction with the
results in Table (ref) in the Supplement, and also with
wood2021, who, albeit with a different methodology and focus, finds
similar results for hospital deaths. Finally, we carry out monitoring using
a training sample between November 5th, 2020, till December 31st, 2020, thus
having $m=58$. We find a changepoint on January 27th, 2021, i.e. two weeks
later the break found with the ex-post test by horvath2022changepoint
, and three weeks later after the national lockdown announced on January
6th, 2021.
In conclusion, the empirical evidence presented above shows that our
RCA-based approach to online changepoint detection is suitable to detect the
onset (and the receding) of a pandemic with short delays, thus being a
recommended item in the toolbox of public health decision-makers.
Sequential monitoring of housing prices
We apply our sequential detection procedures to the online detection of a
change in housing prices in Los Angeles at the end of the first decade of
the century. horvath2022changepoint apply an RCA-based, ex-post
changepoint test, and find evidence of such a bubble starting around
February 4th, 2009, when, after a period of \textquotedblleft hard
landing\textquotedblright , prices stabilised;\footnote{
See Section (ref) for a plot of the data.} we also refer to
a related paper by zenhya, who use monthly data. We use Los Angeles
as a case study to check how timely online detection is, and also to assess
the robustness of our results to the choice of the training and monitoring
sample sizes, and the benefit of adding covariates. In our application,
following horvath2022changepoint, we use (logs of) daily housing
prices.\footnote{
We use the daily data constructed by bollerslev, and we refer to
that paper for a description of the datasets.}
All our monitoring exercises start at January 15th, 2009;
horvath2022changepoint find no changepoints between May 4th, 2006,
and February 3rd, 2009, which entails that the non-contamination assumption
during the training period is satisfied in all cases considered. We monitor
for changepoints using several alternative models. In addition to the basic
RCA specification, with no covariates, we also use different combinations of
regressors, including: two variables that are closely related to the
risk-free interest rate, taking into account the opportunity cost of capital
(the Moody's Seasoned Aaa Corporate Bond Yield, and the 10 Year US Treasury
Constant Maturity Rate); a measure of volatility (namely, the VXO volatility
index); and a measure of real economic activity (we use the
Lewis-Mertens-Stock Weekly Economic Indicator, WEI\footnote{
See lewis2022measuring for a thorough description.}). All regressors
are taken from the FRED St Louis website. The risk-free interest rate
proxies and the volatility measure are transformed into logs. Applying
standard unit root tests to these explanatory variables, we find
overwhelming evidence of a unit root in all of them during the period March
28th, 2008, corresponding to the earliest starting point for the training
sample, and October 30th, 2009, corresponding to the latest ending point for
the monitoring horizon (see Section (ref) in the Supplement
for details); hence, we employ their first differences. As far as the WEI is
concerned, it comes at a weekly frequency, and we use its weekly value for
each day by way of disaggregation; other disaggregation methods could be
employed following the Mixed-Data Sampling literature (MIDAS; see e.g.
ghysels2018mixed), e.g. using a weighted average interpolation,
but we found that these did not make virtually any difference in our results
(in fact, marginally worsening the detection delay). No further
pre-processing is carried out. As far as implementation is concerned, we
have used ${\Greekmath 0120} =1/2$ in $g_{m,{\Greekmath 0120} }^{\left( x\right) }\left( k\right) $ in
((ref)); in the case considered, the data are \textquotedblleft
nearly\textquotedblright\ non-stationary during the training period, and
therefore, based on Table (ref), we use the asymptotic critical
values $c_{{\Greekmath 010B} ,0.5}$.
table*[table* omitted — 4,716 chars of source]
Results in Table (ref) show that adding covariates can
potentially lead to meaningful improvements in terms of detection delay: a
measure of economic activity such as the WEI index, in particular, seems to
contain relevant information to model the dynamics of house prices. We also
note that detection delays seem to be around $4$ months, which may be a
consequence of the relatively small change in ${\Greekmath 010C} $ before and after the
change. Interestingly, results are unaffected by the size of the training
sample $m$, but they do differ if $m^{\ast }$ changes. This is a purely
mechanical effect, due to the increase in the asymptotic critical values as $
m^{\ast }$ increases, as also noted in Section (ref).
Discussion and conclusions
We propose a family of weighted CUSUM statistics for the online detection of
changepoints in a Random Coefficient Autoregressive model. Our statistics
are, in particular, based on the CUSUM\ process of the WLS\ residuals, and
we study both the standard CUSUM, and the so-called Page-CUSUM monitoring
schemes, which is designed to offer higher power/shorter detection delay. In
the case of the standard CUSUM, we also study the standardised version using
${\Greekmath 0120} =1/2$, obtaining, under the null, a Darling-Erd\H{o}s limit theorem.
In this case, seeing as the asymptotic critical values are a poor
approximation leading to an overly conservative procedure, we also propose
an approximation which works well in finite samples, avoiding
overrejections. As our simulations show, the use of weighted statistics is
particularly beneficial under the alternative, with detection delays
decreasing as ${\Greekmath 0120} $ increases. Whilst, for the ease of exposition, we
focus on the RCA\ case with no covariates, we also extend our theory to
include exogenous regressors, which are allowed to be weakly dependent
according to a very general definition of dependence. Simulations show that
our procedures broadly guarantee size control; indeed, our experiments
indicate that, for any given training sample size $m$ and monitoring horizon
$m^{\ast }$, it is always possible to choose the appropriate weighing scheme
to ensure the best balance between size control and timely detection. This
is reinforced by our empirical illustrations, showing that when our
methodology is applied to the online detection of epidemiological and
housing data, it manages to find breaks very quickly, even when compared
against ex-post detection methodologies.
Importantly, building on the well-known fact that, in an RCA\ model, WLS\
inference on the deterministic part of the autoregressive parameter is
always Gaussian, irrespective of whether the observations form a stationary
or nonstationary sequence, our monitoring procedures can be applied to
virtually any type of data: stationary, or with an explosive dynamics, or on
the boundary between the two regimes, with no modifications required. Hence,
our methodology is particularly suited, as a leading example, to the
detection of both the onset, or the collapse, of a bubble (when using
financial data), or of a pandemic (when using epidemiological data). Other
cases also can be considered, e.g. monitoring for changes in the persistence
of a stationary series such as inflation, and the extension of the basic RCA
specification to include covariates should enhance the applicability of our
methodology.
adjustwidth{-5pt}{-5pt}
{ {\
} }
\setcounter{section}{0} \setcounter{subsection}{-1}
\setcounter{subsubsection}{-1} \setcounter{equation}{0} \setcounter{lemma}{0}
\setcounter{theorem}{0}
Further Monte Carlo evidence and guidelines
table*[table* omitted — 11,914 chars of source]
table*[table* omitted — 11,857 chars of source]
table*[table* omitted — 11,794 chars of source]
table*[table* omitted — 6,570 chars of source]
\setcounter{subsection}{-1} \setcounter{subsubsection}{-1}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Further empirical evidence
Further empirical evidence on UK Covid-19 hospitalisation data
We report a graph of the logs of (one plus) the daily hospitalisation data
with the identified changepoints in Figure (ref).
figure[figure omitted — 197 chars of source]
We have conducted, by way of comparison, an ex-post changepoint detection
exercise, applying the techniques developed in horvath2022changepoint
to the whole sample. We only report results obtained using R\'{e}nyi
statistics (corresponding to using a weighted version of the CUSUM process
with weights ${\Greekmath 0114} =0.51$, $0.55$, $0.65$, $0.75$, $0.85$ and $1$ - see
horvath2022changepoint for details).\footnote{
Using other weighing schemes give very similar results, available upon
request.} As far as breakdates are concerned, we pick the ones corresponding
to the \textquotedblleft majority vote\textquotedblright\ across ${\Greekmath 0114} $,
although discrepancies are, when present, in the region of few days ($2-5$
at most). We use binary segmentation, as also discussed in
horvath2022changepoint, to detect multiple breaks.
table*[table* omitted — 2,078 chars of source]
Further empirical evidence on housing data
We report some preliminary information on our data. In Table (ref), we report the outcome of a standard unit root test on the
three covariates used in our exercise.
table*[table* omitted — 2,336 chars of source]
In Figure (ref), we plot housing prices in Los Angeles between
March 28th, 2008, and October 30th, 2009.
figure[figure omitted — 201 chars of source]
\setcounter{subsection}{-1} \setcounter{subsubsection}{-1}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Preliminary lemmas
We will use the following facts and notation: \textquotedblleft $\overset{
\mathcal{D}}{\rightarrow }$\textquotedblright\ denotes convergence in
distribution; \textquotedblleft $\overset{\mathcal{D}}{=}$
\textquotedblright\ denotes equality in distribution; $c_{1}$, $c_{2}$, ...
denote positive, finite constants which do not depend on sample sizes, and
whose values may change from line to line.
Recall ((ref)) under $H_{0}$
equation*[equation* omitted — 118 chars of source]
If $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, define the
stationary solution
equation[equation omitted — 201 chars of source]
with the convention that $\prod_{\oslash }=0$. Finally, let
equation[equation omitted — 101 chars of source]
lemmaWe assume that Assumption (ref) is satisfied. Under $
H_{0} $, it holds that
(i) if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, then
\begin{align}
&\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) -\frac{1}{ma_{3}}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{
y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right) \right\vert =O_{P}\left(
\frac{1}{m}\right) , \\
&\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}
\right) -\frac{1}{ma_{3}}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{
y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) \right\vert =O_{P}\left( \frac{1}{
m}\right) ;
\end{align}
(ii) if either $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$
and Assumption (ref) holds, or $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert >0$ and Assumption (ref) holds, then
\begin{align}
&\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) -\frac{1}{m}\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\right\vert =O_{P}\left(
m^{-1/2-{\Greekmath 0110} }\right) , \\
&\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}
\right) \right\vert =O_{P}\left( m^{-1/2-{\Greekmath 0110} }\right) ,
\end{align}
for some ${\Greekmath 0110} >0$.
\begin{proof}
We begin by showing ((ref))-((ref)). Under $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, aue2006 show
that there exist a ${\Greekmath 0114} >0$ and a $0<c<1$ such that
\begin{equation*}
E\left\vert y_{i}-\overline{y}_{i}\right\vert ^{{\Greekmath 0114} }=O\left(
c^{i}\right) ,
\end{equation*}
as $i\rightarrow \infty $. Thus, by elementary algebra
\begin{equation*}
\sum_{i=2}^{\infty }\left\vert {\Greekmath 010F} _{i,1}\right\vert \left\vert \frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}-\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}\right\vert \leq \sum_{i=2}^{\infty }\left\vert {\Greekmath 010F}
_{i,1}\right\vert \left\vert y_{i-1}^{2}-\overline{y}_{i-1}^{2}\right\vert
\leq \sum_{i=2}^{\infty }\left\vert {\Greekmath 010F} _{i,1}\right\vert \left\vert
y_{i-1}-\overline{y}_{i-1}\right\vert \left( \left\vert y_{i-1}\right\vert
+\left\vert \overline{y}_{i-1}\right\vert \right) .
\end{equation*}
Since we can assume that ${\Greekmath 0114} <1$, it follows that
\begin{align*}
& E\left( \sum_{i=2}^{\infty }\left\vert {\Greekmath 010F} _{i,1}\right\vert
\left\vert \frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}-\frac{\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}\right\vert \right) ^{{\Greekmath 0114} /2} \\
\leq & \sum_{i=2}^{\infty }\left( E\left\vert {\Greekmath 010F} _{i,1}\right\vert
^{{\Greekmath 0114} /2}\right) E\left( \left\vert y_{i-1}-\overline{y}_{i-1}\right\vert
^{{\Greekmath 0114} /2}\left( \left\vert y_{i-1}\right\vert +\left\vert \overline{y}
_{i-1}\right\vert \right) ^{{\Greekmath 0114} /2}\right) \\
\leq & \sum_{i=2}^{\infty }\left( E\left\vert {\Greekmath 010F} _{i,1}\right\vert
^{{\Greekmath 0114} /2}\right) \left( E\left\vert y_{i-1}-\overline{y}_{i-1}\right\vert
^{{\Greekmath 0114} }\right) ^{1/2}\left( E\left\vert y_{i-1}\right\vert ^{{\Greekmath 0114}
}+E\left\vert \overline{y}_{i-1}\right\vert ^{{\Greekmath 0114} }\right) ^{1/2} \\
<& \infty ,
\end{align*}
having used Assumption (ref). Hence by Markov's inequality it follows
that
\begin{equation}
\sum_{i=2}^{\infty }\left\vert {\Greekmath 010F} _{i,1}\right\vert \left\vert \frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}-\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}\right\vert =O_{P}\left( 1\right) ,
\end{equation}
and by the same logic it also follows that
\begin{equation*}
\sum_{i=2}^{\infty }\left\vert \frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}-\frac{
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left(
1\right) .
\end{equation*}
By Lemmas D.1-D.4 in horvath2022changepoint, the sequence $\overline{
y}_{i-1}^{2}/\left( 1+\overline{y}_{i-1}^{2}\right) $ is a decomposable
Bernoulli shift with all moments; hence, by Proposition 4.1 in
berkeshormann it follows that
\begin{equation*}
\left\vert \sum_{i=2}^{m}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}-ma_{3}\right\vert =O_{P}\left( m^{1/2}\right) ,
\end{equation*}
where $a_{3}$ is defined in ((ref)), and similarly
\begin{equation*}
\left\vert \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left( m^{1/2}\right) .
\end{equation*}
Equation ((ref)) now follows; ((ref)) follows also from
exactly the same logic.
We now turn to showing ((ref)) and ((ref)). When $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$, Lemma A.4 in
HT2016 implies that
\begin{equation}
P\left\{ \left\vert y_{i}\right\vert \leq i^{\overline{{\Greekmath 0114} }}\right\}
\leq ci^{-\overline{{\Greekmath 0114} }};
\end{equation}
when $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$,
berkes2009 show that $\left\vert y_{i}\right\vert \rightarrow \infty
$ a.s. exponentially fast, which implies ((ref)). Hence by ((ref)) it follows that
\begin{equation*}
\sum_{i=2}^{m}E\left\vert \frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}-1\right\vert
=\sum_{i=2}^{m}E\left\vert \frac{1}{1+y_{i-1}^{2}}\right\vert I\left(
\left\vert y_{i}\right\vert \leq i^{\overline{{\Greekmath 0114} }}\right)
+\sum_{i=2}^{m}E\left\vert \frac{1}{1+y_{i-1}^{2}}\right\vert I\left(
\left\vert y_{i}\right\vert >i^{\overline{{\Greekmath 0114} }}\right) =O\left( m^{1-
\overline{{\Greekmath 0114} }}\right) .
\end{equation*}
By the independence between ${\Greekmath 010F} _{i,1}$ and $y_{i-1}$ and by
Assumption (ref), it follows that
\begin{equation*}
E\left( \sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\left( \frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}
-1\right) \right) ^{2}=\sum_{i=2}^{m}E{\Greekmath 010F} _{i,1}^{2}E\left( \frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}-1\right) ^{2}=O\left( m^{1-\overline{{\Greekmath 0114} }
}\right) ,
\end{equation*}
and similarly
\begin{equation*}
E\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}\right)
^{2}=O\left( m^{1-\overline{{\Greekmath 0114} }}\right) .
\end{equation*}
The proof of ((ref)) and ((ref)) is now complete.
\end{proof}
Consider now the decomposition
equation[equation omitted — 352 chars of source]
where $\widehat{{\Greekmath 010C} }_{m}$ is the WLS\ estimator computed using $\left\{
y_{1},...,y_{m}\right\} $.
In the next lemma, we obtain asymptotic representations for the terms in (
(ref)).
lemmaWe assume that Assumption (ref) is satisfied. Under $
H_{0} $:
(i) if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, then
\begin{align}
&\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}\frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}-ka_{3}\right\vert =O_{P}\left( 1\right) ,
\\
&\max_{1\leq k<\infty }\left\vert \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F}
_{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left(
1\right) , \\
&\max_{1\leq k<\infty }\left\vert \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F}
_{i,2}y_{i-1}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left(
1\right) ,
\end{align}
for all ${\Greekmath 0111} >0$;
(ii) if either $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$
and Assumption (ref) holds, or $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert >0$ and Assumption (ref) holds, then
\begin{align}
&\max_{1\leq k<\infty }k^{-1}\left\vert \sum_{i=m+1}^{m+k}\frac{y_{i-1}^{2}}{
1+y_{i-1}^{2}}-k\right\vert =O_{P}\left( m^{-{\Greekmath 0110} }\right) ,
\\
&\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}\frac{
{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}{\Greekmath 010F}
_{i,1}\right\vert =O_{P}\left( m^{-{\Greekmath 0110} }\right) , \\
&\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}\frac{
{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}\right\vert =O_{P}\left( m^{-{\Greekmath 0110}
}\right) ,
\end{align}
for some ${\Greekmath 0110} >0$ and for all ${\Greekmath 0111} >0$.
\begin{proof}
We begin by considering the stationary case $E\log \left\vert {\Greekmath 010C}
_{0}+{\Greekmath 010F} _{0,1}\right\vert <0$. On account of the proof of Lemma (ref), ((ref)) follows if we show
\begin{equation*}
\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}\frac{
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}-ka_{3}\right\vert
=O_{P}\left( 1\right) .
\end{equation*}
This follows immediately, since $\overline{y}_{i-1}^{2}/\left( 1+\overline{y}
_{i-1}^{2}\right) $ is a decomposable Bernoulli shift with all moments, and
the result is implied by the strong approximation in aue2014.
Further, ((ref)) follows immediately from ((ref)); ((ref)) can be shown by the same logic.
Consider now the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert \geq 0$. By ((ref))
\begin{equation*}
E\sum_{i=m+1}^{\infty }\frac{1}{i}\frac{1}{1+y_{i-1}^{2}}=O\left( m^{-
\widehat{{\Greekmath 0114} }}\right) ,
\end{equation*}
for all $\widehat{{\Greekmath 0114} }<\overline{{\Greekmath 0114} }$. Hence, Abel's summation
formula yields
\begin{equation*}
\frac{1}{k}\sum_{i=m+1}^{m+k}\frac{1}{1+y_{i-1}^{2}}=\sum_{i=m+1}^{m+k}\frac{
1}{i}\frac{1}{1+y_{i-1}^{2}}-\frac{1}{k}\sum_{i=m+1}^{m+k-1}\left( \left(
i+1\right) -i\right) \left( \sum_{j=m+1}^{i}\frac{1}{j}\frac{1}{1+y_{j-1}^{2}
}\right) .
\end{equation*}
Given that
\begin{equation*}
\frac{1}{k}\sum_{i=m+1}^{m+k-1}E\left( \sum_{j=m+1}^{i}\frac{1}{j}\frac{1}{
1+y_{j-1}^{2}}\right) \leq E\sum_{j=m+1}^{\infty }\frac{1}{j}\frac{1}{
1+y_{j-1}^{2}}=O\left( m^{-\widehat{{\Greekmath 0114} }}\right) ,
\end{equation*}
((ref)) follows from Markov's inequality. Letting $\mathcal{F}_{i}$
be the ${\Greekmath 011B} $-field generated by $\left\{ \left( {\Greekmath 010F} _{j,1},{\Greekmath 010F}
_{j,2}\right) ,j\leq i\right\} $, note that
\begin{equation*}
E\left( \left. \frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}\right\vert \mathcal{F}
_{i-1}\right) =0,
\end{equation*}
and therefore the sequence ${\Greekmath 010F} _{i,1}/\left( 1+y_{i-1}^{2}\right) $ is
a martingale difference sequence. Also, using the Burkholder's inequality
(see e.g. Theorem 2.10 in hallheyde) and ((ref))
\begin{align}
&E\left\vert \sum_{i=m+1}^{m+k}E\left[ \left. \left( \frac{{\Greekmath 010F} _{i,1}}{
1+y_{i-1}^{2}}\right) ^{2}\right\vert \mathcal{F}_{i-1}\right] \right\vert
^{{\Greekmath 0117} } \\
\leq &c_{1}E\left( \sum_{i=m+1}^{m+k}E\left( \frac{1}{1+y_{i-1}^{2}}\right)
^{2}\right) ^{{\Greekmath 0117} /2}\leq c_{2}k^{{\Greekmath 0117} /2-1}\sum_{i=m+1}^{m+k}\left( E\left(
\frac{1}{\left( 1+y_{i-1}^{2}\right) ^{{\Greekmath 0117} }}\right) \right) \notag \\
\leq &c_{2}k^{{\Greekmath 0117} /2-1}\sum_{i=m+1}^{m+k}\left( E\left( \frac{1}{\left(
1+y_{i-1}^{2}\right) ^{{\Greekmath 0117} }}I\left( \left\vert y_{i}\right\vert \leq i^{
\overline{{\Greekmath 0114} }}\right) \right) +E\left( \frac{1}{\left(
1+y_{i-1}^{2}\right) ^{{\Greekmath 0117} }}I\left( \left\vert y_{i}\right\vert >i^{
\overline{{\Greekmath 0114} }}\right) \right) \right) \notag \\
\leq &k^{{\Greekmath 0117} /2-1}\sum_{i=m+1}^{m+k}\left( c_{3}i^{-\overline{{\Greekmath 0114} }
}+c_{4}i^{-2{\Greekmath 0117} \overline{{\Greekmath 0114} }}\right) \leq c_{5}\frac{k^{{\Greekmath 0117} /2}}{m^{
\overline{{\Greekmath 0114} }}}. \notag
\end{align}
Similarly, we have
\begin{equation}
\sum_{i=m+1}^{m+k}E\left\vert \frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}
\right\vert ^{{\Greekmath 0117} }\leq c_{6}\sum_{i=m+1}^{m+k}E\left\vert \frac{1}{
1+y_{i-1}^{2}}\right\vert ^{{\Greekmath 0117} }\leq c_{7}\frac{k}{m^{\overline{{\Greekmath 0114} }}}.
\end{equation}
Using ((ref)) and ((ref)), and Rosenthal's maximal
inequality for martingale difference sequences (see e.g. Theorem 2.12 in
hallheyde), it follows that
\begin{equation}
E\max_{1\leq j\leq k}\left\vert \sum_{i=m+1}^{m+j}\frac{{\Greekmath 010F} _{i,1}}{
1+y_{i-1}^{2}}\right\vert ^{{\Greekmath 0117} }\leq c_{8}\frac{k^{{\Greekmath 0117} /2}}{m^{\overline{
{\Greekmath 0114} }}}.
\end{equation}
We now show ((ref)) by noting that
\begin{align*}
&P\left\{ \max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}
\frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}\right\vert >x\right\} \\
\leq &\sum_{\ell =0}^{\infty }P\left\{ \max_{\exp \left( \ell \right) \leq
k\leq \exp \left( \ell +1\right) }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}
\frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}\right\vert >x\right\} \\
\leq &\sum_{\ell =0}^{\infty }P\left\{ \max_{\exp \left( \ell \right) \leq
k\leq \exp \left( \ell +1\right) }\left\vert \sum_{i=m+1}^{m+k}\frac{
{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}\right\vert >x\exp \left( \ell \left( \frac{1
}{2}+{\Greekmath 0111} \right) \right) \right\} \\
\leq &c_{9}x^{-{\Greekmath 0117} }\sum_{\ell =0}^{\infty }\exp \left( -{\Greekmath 0117} \ell \left(
\frac{1}{2}+{\Greekmath 0111} \right) \right) E\max_{1\leq k\leq \exp \left( \ell
+1\right) }\left\vert \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}
\right\vert ^{{\Greekmath 0117} } \\
\leq &c_{10}x^{-{\Greekmath 0117} }m^{-\overline{{\Greekmath 0114} }}\sum_{\ell =0}^{\infty }\exp
\left( -{\Greekmath 0117} \ell \left( \frac{1}{2}+{\Greekmath 0111} \right) +\frac{{\Greekmath 0117} }{2}\left( \ell
+1\right) \right) ,
\end{align*}
whence ((ref)) follows immediately with ${\Greekmath 0110} =\overline{{\Greekmath 0114} }$
. Equation ((ref)) can be shown using the same logic.
\end{proof}
lemmaWe assume that Assumption (ref) is satisfied. Under $
H_{0} $
(i) if $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, then we
can define two independent standard Wiener processes $\left\{ W_{m,1}\left(
k\right) ,1\leq k\leq m\right\} $ and $\left\{ W_{m,2}\left( k\right) ,1\leq
k<\infty \right\} $, whose distribution does not depend on $m$, such that
\begin{align}
& \max_{1\leq k<m}k^{-1/2+{\Greekmath 0110} }\left\vert \sum_{i=2}^{m}\left( \frac{
{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{
{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) -
\mathscr{s}^{1/2}W_{m,1}\left( k\right) \right\vert \\
=& O_{P}\left( 1\right) , \notag \\
& \max_{1\leq k<\infty }k^{-1/2+{\Greekmath 0110} }\left\vert \sum_{i=m+1}^{m+k}\left(
\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{
{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) -
\mathscr{s}^{1/2}W_{m,2}\left( k\right) \right\vert \\
=& O_{P}\left( 1\right) , \notag
\end{align}
for some ${\Greekmath 0110} >0$;
(ii) if either $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert =0$
and Assumption (ref) holds, or $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert >0$ and Assumption (ref) holds, then
\begin{align}
& \max_{1\leq k\leq m}k^{-1/2+{\Greekmath 0110} }\left\vert \sum_{i=1}^{k}{\Greekmath 010F}
_{i,1}-{\Greekmath 011B} _{1}W_{m,1}\left( k\right) \right\vert =O_{P}\left( 1\right) ,
\\
& \max_{1\leq k<\infty }k^{-1/2+{\Greekmath 0110} }\left\vert \sum_{i=m+1}^{m+k}{\Greekmath 010F}
_{i,1}-{\Greekmath 011B} _{2}W_{m,2}\left( k\right) \right\vert =O_{P}\left( 1\right) ,
\end{align}
for some ${\Greekmath 0110} >0$.
\begin{proof}
horvath2022changepoint show that $\left( {\Greekmath 010F} _{i,1}\overline{y}
_{i-1}^{2}+{\Greekmath 010F} _{i,2}\overline{y}_{i-1}\right) /\left( 1+\overline{y}
_{i-1}^{2}\right) $ is a decomposable Bernoulli shift under $-\infty \leq
E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$. Hence, the
strong approximation shown in aue2014 immediately yields ((ref)) and ((ref)). Equations ((ref)) and ((ref)) follow directly from KMT1 and KMT2.
\end{proof}
Let
equation[equation omitted — 745 chars of source]
lemmaLet ${\Greekmath 010C} _{m}$\ be a sequence such that, as $m\rightarrow
\infty $, ${\Greekmath 010D} _{m}\rightarrow \infty $ with ${\Greekmath 010D} _{m}=o\left(
m\right) $. Then, if assumptions of Theorem (ref) are satisfied, it holds
that under $H_{0}$
\begin{equation*}
\max_{{\Greekmath 010D} _{m}\leq k\leq m^{\ast }}\frac{\left\vert Z_{m}\left( k\right)
-\Gamma _{m}\left( k\right) \right\vert }{m^{1/2}\left( 1+\frac{
k}{m}\right) \left( \frac{k}{m+k}\right) ^{1/2}}=O_{P}\left(
{\Greekmath 010C} _{m}^{{\Greekmath 0110} -1/2}\right) ,
\end{equation*}
for some $0<{\Greekmath 0110} <1/2$.
\begin{proof}
Upon following the proof of ((ref)), it can be shown that there
exists a $0<{\Greekmath 0110} <1/2$ such that
\begin{equation*}
\max_{1\leq k\leq m^{\ast }}\left( k^{{\Greekmath 0110} }+\frac{k}{m}m^{{\Greekmath 0110} }\right)
^{-1}\left\vert Z_{m}\left( k\right) -\Gamma _{m}\left( k\right) \right\vert
=O_{P}\left( 1\right) .
\end{equation*}
Hence we have
\begin{align*}
& \max_{{\Greekmath 010D} _{m}\leq k\leq m^{\ast }}\frac{\left\vert Z_{m}\left(
k\right) -\Gamma _{m}\left( k\right) \right\vert }{m^{1/2}\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{1/2}} \\
=& O_{P}\left( 1\right) \max_{{\Greekmath 010D} _{m}\leq k\leq m^{\ast }}\frac{k^{{\Greekmath 0110}
}+\frac{k}{m}m^{{\Greekmath 0110} }}{m^{1/2}\left( 1+\frac{k}{m}\right)
\left( \frac{k}{m+k}\right) ^{1/2}} \\
=& O_{P}\left( {\Greekmath 010D} _{m}^{{\Greekmath 0110} -1/2}\right) +O_{P}\left( m^{{\Greekmath 0110}
-1/2}\right) =O_{P}\left( {\Greekmath 010D} _{m}^{{\Greekmath 0110} -1/2}\right) .
\end{align*}
\end{proof}
lemmaWe assume that the conditions of Theorem (ref) hold. Let
\begin{equation*}
{\Greekmath 010D} _{m^{\ast }}=O\left( \exp \left( \log \left( m^{\ast }\right)
^{1-{\Greekmath 010F} }\right) \right) ,
\end{equation*}
with ${\Greekmath 010F} >0$ and arbitrarily small. Then, under $H_{0}$, on a suitably
enlarged space, it is possible to construct two independent Wiener processes
$\left\{ W_{m,1}\left( k\right) ,1\leq k\leq T_{m}\right\} $ and $\left\{
W_{m,2}\left( k\right) ,1\leq k\leq m\right\} $\ whose distribution does not
depend on $m$, such that
\begin{equation*}
\max_{{\Greekmath 010D} _{m^{\ast }}\leq k\leq m^{\ast }}\left\vert \frac{\left\vert
Z_{m}\left( k\right) \right\vert }{g_{m,0.5}\left( k\right) }-\frac{
\left\vert W_{m,2}\left( k\right) -\frac{k}{m}W_{m,1}\left(
m\right) \right\vert }{g_{m,0.5}\left( k\right) }\right\vert =O_{P}\left(
\exp \left( -c_{0}\log \left( m^{\ast }\right) ^{1-{\Greekmath 010F} }\right) \right)
,
\end{equation*}
for some $0<c_{0}<1/2$.
\begin{proof}
The proof follows from the same arguments as Lemma (ref), of which
this lemma is a special case.
\end{proof}
We now report some preliminary results to prove the main results in Section
(ref). We begin by studying the WLS\ estimator $\widehat{{\Greekmath 010C} }
_{m}$. Define
equation*[equation* omitted — 203 chars of source]
and the diagonal matrix
equation*[equation* omitted — 193 chars of source]
Then it holds that
equation*[equation* omitted — 175 chars of source]
where $\mathbf{Y}_{m}=\left( y_{2},y_{3},...,y_{m}\right) ^{\intercal }$.
Using the recursion defined in ((ref)), we obtain
equation*[equation* omitted — 190 chars of source]
having defined $\mathbf{b}_{0}=\left( {\Greekmath 010C} _{0},\mathbf{{\Greekmath 0115} }
_{0}^{\intercal }\right) ^{\intercal }$ and
equation*[equation* omitted — 231 chars of source]
Based on the above, under the condition for stationarity $E\log \left\vert
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, it can be verified that
equation*[equation* omitted — 292 chars of source]
has a unique stationary, causal solution. Consider the variables
align[align omitted — 530 chars of source]
and define
equation[equation omitted — 95 chars of source]
equation[equation omitted — 129 chars of source]
and
equation[equation omitted — 173 chars of source]
lemmaWe assume that $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$, and that Assumptions (ref), (ref) and (ref) are satisfied. Then it holds that
\begin{equation*}
\widehat{\mathbf{b}}_{m}-\mathbf{b}_{0}=\frac{1}{m}\mathbf{Q}
^{-1}\sum_{i=2}^{m}\mathbf{{\Greekmath 0111} }_{i}+o_{P}\left( m^{-1/2-{\Greekmath 0110} }\right) ,
\end{equation*}
for some ${\Greekmath 0110} >0$, where $\mathbf{{\Greekmath 0111} }_{i}$ and $\mathbf{Q}$ are defined
in ((ref)) and ((ref)).
\begin{proof}
We begin by writing explicitly the solution of ((ref)) as
\begin{equation}
\overline{y}_{i}=\sum_{\ell =0}^{\infty }\left( \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}\right) \right) \left( \mathbf{x}_{i-\ell
}^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}\right) ,
\end{equation}
with the convention that $\prod_{\oslash }=0$. With minor modifications of
the arguments in aue2006, it can be shown that there exist a ${\Greekmath 0114}
>0$ and a constant $0<c<1$\ such that
\begin{equation}
E\left\vert y_{i}-\overline{y}_{i}\right\vert ^{{\Greekmath 0114} }=O\left(
c^{i}\right) ,
\end{equation}
as $i\rightarrow \infty $. Using ((ref)) it can be shown that
\begin{equation*}
\left\Vert \mathbf{Q}_{m}^{\intercal }\mathbf{W}_{m}\mathbf{Q}_{m}-\overline{
\mathbf{Q}}_{m}\right\Vert =O_{P}\left( 1\right) ,
\end{equation*}
where
\begin{equation*}
\overline{\mathbf{Q}}_{m}=\sum_{i=2}^{m}\overline{\mathbf{z}}_{i}\overline{
\mathbf{z}}_{i}^{\intercal },
\end{equation*}
and $\overline{\mathbf{z}}_{i}$ is constructed in the same way as $\mathbf{z}
_{i}$ defined in ((ref)), replacing $y_{i}$ with $\overline{y}_{i}$. We
now show that $\overline{y}_{i}$ defined in ((ref)) is a decomposable
Bernoulli shift. Indeed, let
\begin{equation*}
\overline{y}_{i,k}=\sum_{\ell =0}^{k}\left( \prod_{j=1}^{\ell }\left( {\Greekmath 010C}
_{0}+{\Greekmath 010F} _{i-j,1}\right) \right) \left( \mathbf{x}_{i-\ell }^{\intercal
}\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}\right) +\sum_{\ell
=k+1}^{\infty }\left( \prod_{j=1}^{\ell }\left( {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{i-j,1}^{\ast }\right) \right) \left( \mathbf{x}_{i-\ell ,k}^{\intercal }
\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}^{\ast }\right) ,
\end{equation*}
where for $\ell \geq 0$
\begin{equation*}
\mathbf{x}_{i-\ell ,k}=\left\{
\begin{array}{ll}
\mathbf{g}\left( {\Greekmath 0111} _{i-\ell },{\Greekmath 0111} _{i-\ell -1},...,{\Greekmath 0111} _{k},{\Greekmath 0111}
_{k-1}^{\ast },{\Greekmath 0111} _{k-2}^{\ast },...\right) & \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{if }\ell <i-k, \\
\mathbf{g}\left( {\Greekmath 0111} _{i-\ell }^{\ast },{\Greekmath 0111} _{i-\ell -1}^{\ast },...\right)
& \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{if }\ell \geq i-k,
\end{array}
\right.
\end{equation*}
the ${\Greekmath 0111} _{j}^{\ast }$s are independent copies of ${\Greekmath 0111} _{0}$, $\left(
{\Greekmath 010F} _{j,1}^{\ast },{\Greekmath 010F} _{j,2}^{\ast }\right) $ are independent
copies of $\left( {\Greekmath 010F} _{0,1},{\Greekmath 010F} _{0,2}\right) $, and the
sequences $\left\{ {\Greekmath 0111} _{j},-\infty <j<\infty \right\} $, $\left\{ {\Greekmath 0111}
_{j}^{\ast },-\infty <j<\infty \right\} $, $\left\{ \left( {\Greekmath 010F}
_{j,1},{\Greekmath 010F} _{j,2}\right) ,-\infty <j<\infty \right\} $ and $\left\{
\left( {\Greekmath 010F} _{j,1}^{\ast },{\Greekmath 010F} _{j,2}^{\ast }\right) ,\right. $ $
\left. -\infty <j<\infty \right\} $ are independent. Defining $u_{i-\ell }=
\mathbf{x}_{i-\ell }^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}$
, and recalling Assumptions (ref) and (ref), by the same
arguments as in aue2006 we can show that, under $E\log \left\vert
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$, there exists a ${\Greekmath 0114} >0$ such
that
\begin{equation*}
E\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert ^{{\Greekmath 0114} }<1.
\end{equation*}
Using ${\Greekmath 0114} <1$, we have
\begin{align*}
&E\left\vert \sum_{\ell =k+1}^{\infty }\left( \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}\right) \right) \left( \mathbf{x}_{i-\ell
}^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}\right) \right\vert
^{{\Greekmath 0114} /2} \\
\leq &\sum_{\ell =k+1}^{\infty }E\left( \left\vert \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}\right) \right\vert ^{{\Greekmath 0114} /2}\left\vert
\mathbf{x}_{i-\ell }^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell
,2}\right\vert ^{{\Greekmath 0114} /2}\right) \\
\leq &\sum_{\ell =k+1}^{\infty }\left( E\left\vert \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}\right) \right\vert ^{{\Greekmath 0114} }\right)
^{1/2}\left( E\left\vert \mathbf{x}_{i-\ell }^{\intercal }\mathbf{{\Greekmath 0115} }
_{0}+{\Greekmath 010F} _{i-\ell ,2}\right\vert ^{{\Greekmath 0114} }\right) ^{1/2} \\
=&\sum_{\ell =k+1}^{\infty }\left( E\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert ^{{\Greekmath 0114} }\right) ^{\ell /2}\left( E\left\vert \mathbf{x}
_{0}^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{0,2}\right\vert ^{{\Greekmath 0114}
}\right) ^{1/2} \\
\leq &c_{1}\sum_{\ell =k+1}^{\infty }{\Greekmath 011A} ^{\ell /2}\leq c_{2}c_{3}^{k},
\end{align*}
where ${\Greekmath 011A} =E\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert ^{{\Greekmath 0114} }$,
and $0<c_{3}<1$, having used Assumptions (ref) and (ref). By
the same token, we have
\begin{align*}
&E\left\vert \sum_{\ell =k+1}^{\infty }\left( \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}^{\ast }\right) \right) \left( \mathbf{x}
_{i-\ell ,k}^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{i-\ell ,2}^{\ast
}\right) \right\vert ^{{\Greekmath 0114} /2} \\
\leq &\sum_{\ell =k+1}^{\infty }E\left( \left\vert \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}^{\ast }\right) \right\vert ^{{\Greekmath 0114}
/2}\left\vert \mathbf{x}_{i-\ell ,k}^{\intercal }\mathbf{{\Greekmath 0115} }
_{0}+{\Greekmath 010F} _{i-\ell ,2}^{\ast }\right\vert ^{{\Greekmath 0114} /2}\right) \\
\leq &\sum_{\ell =k+1}^{\infty }\left( E\left\vert \prod_{j=1}^{\ell }\left(
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{i-j,1}^{\ast }\right) \right\vert ^{{\Greekmath 0114} }\right)
^{1/2}\left( E\left\vert \mathbf{x}_{i-\ell ,k}^{\intercal }\mathbf{{\Greekmath 0115} }
_{0}+{\Greekmath 010F} _{i-\ell ,2}^{\ast }\right\vert ^{{\Greekmath 0114} }\right) ^{1/2} \\
=&\sum_{\ell =k+1}^{\infty }\left( E\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert ^{{\Greekmath 0114} }\right) ^{\ell /2}\left( E\left\vert \mathbf{x}
_{0}^{\intercal }\mathbf{{\Greekmath 0115} }_{0}+{\Greekmath 010F} _{0,2}\right\vert ^{{\Greekmath 0114}
}\right) ^{1/2}\leq c_{4}c_{5}^{k},
\end{align*}
with $0<c_{5}<1$. Hence it holds that
\begin{equation}
E\left\vert \overline{y}_{i}-\overline{y}_{i,k}\right\vert ^{k}\leq
c_{6}c_{7}^{k},
\end{equation}
for some $c_{6}>0$ and $0<c_{7}<1$, which shows that $\overline{y}_{i}$ is a
decomposable Bernoulli shift. This immediately yields, by the approximations
developed in aue2014, that
\begin{equation}
\left\Vert \frac{1}{m}\overline{\mathbf{Q}}_{m}-\mathbf{Q}\right\Vert
=O_{P}\left( m^{-1/2}\right) .
\end{equation}
We now turn to studying the numerator of $\widehat{{\Greekmath 010C} }_{m}-{\Greekmath 010C} _{0}$.
We begin with some preliminary results. Using ((ref)), it follows
that, for all ${\Greekmath 0114} _{3}>0$ and for $c_{7}<c_{9}<1$
\begin{align}
&E\left\vert \frac{\overline{y}_{i}^{2}}{1+\overline{y}_{i}^{2}}-\frac{
\overline{y}_{i,k}^{2}}{1+\overline{y}_{i,k}^{2}}\right\vert \\
\leq &E\left\vert \frac{\left\vert \overline{y}_{i}\right\vert +\left\vert
\overline{y}_{i,k}\right\vert }{\left( 1+\overline{y}_{i}^{2}\right) \left(
1+\overline{y}_{i,k}^{2}\right) }\left\vert \overline{y}_{i}-\overline{y}
_{i,k}\right\vert \right\vert ^{{\Greekmath 0114} _{3}} \notag \\
\leq &E\left( c_{8}\left\vert \overline{y}_{i}-\overline{y}_{i,k}\right\vert
I\left( \left\vert \overline{y}_{i}-\overline{y}_{i,k}\right\vert \leq
c_{9}^{k}\right) +c_{10}I\left( \left\vert \overline{y}_{i}-\overline{y}
_{i,k}\right\vert \geq c_{9}^{k}\right) \right) ^{{\Greekmath 0114} _{3}} \notag \\
\leq &c_{11}c_{9}^{k{\Greekmath 0114} _{3}}+c_{12}P\left( \left\vert \overline{y}_{i}-
\overline{y}_{i,k}\right\vert \geq c_{9}^{k}\right) \leq
c_{11}c_{9}^{k{\Greekmath 0114} _{3}}+c_{12}c_{9}^{-k}E\left\vert \overline{y}_{i}-
\overline{y}_{i,k}\right\vert \notag \\
\leq &c_{13}c_{14}^{k}, \notag
\end{align}
for some $0<c_{9}<1$. Using the same arguments, for all ${\Greekmath 0114} _{4}<{\Greekmath 0114}
_{1}$
\begin{equation}
E\left\Vert \frac{\mathbf{x}_{i}\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}
-\frac{\mathbf{x}_{i,k}\overline{y}_{i-1,k}}{1+\overline{y}_{i-1,k}^{2}}
\right\Vert ^{{\Greekmath 0114} _{4}}\leq c_{15}c_{16}^{k},
\end{equation}
and for all ${\Greekmath 0114} _{5}<{\Greekmath 0114} _{2}/2$
\begin{equation}
E\left\Vert \frac{\mathbf{x}_{i}\mathbf{x}_{i}^{\intercal }}{1+\overline{y}
_{i-1}^{2}}-\frac{\mathbf{x}_{i,k}\mathbf{x}_{i,k}^{\intercal }}{1+\overline{
y}_{i-1,k}^{2}}\right\Vert ^{{\Greekmath 0114} _{5}}\leq c_{17}c_{18}^{k},
\end{equation}
where $0<c_{16},c_{18}<1$. This entails that all the sequences studied above
are decomposable Benrnoulli shifts. Thus
\begin{equation*}
\left\Vert \mathbf{Q}_{m}^{\intercal }\mathbf{W}_{m}\mathbf{E}_{m}-\overline{
\mathbf{E}}_{m}\right\Vert =O_{P}\left( 1\right) ,
\end{equation*}
where
\begin{equation*}
\overline{\mathbf{E}}_{m}=\sum_{i=2}^{m}\mathbf{{\Greekmath 0111} }_{i},
\end{equation*}
and $\mathbf{{\Greekmath 0111} }_{i}$\ is defined in ((ref)).Repeating the arguments
above, it can also be shown that, for all ${\Greekmath 0114} _{6}<{\Greekmath 0114} _{1}$
\begin{equation*}
E\left\Vert \mathbf{{\Greekmath 0111} }_{i}-\mathbf{{\Greekmath 0111} }_{i,k}\right\Vert ^{{\Greekmath 0114}
_{6}}\leq c_{19}c_{20}^{k},
\end{equation*}
with $\mathbf{{\Greekmath 0111} }_{i,k}$ defined as the other coupling constructions
above and $0<c_{20}<1$. The final results now follows from the strong
approximation derived in aue2014.
\end{proof}
lemmaWe assume that $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$, and that Assumptions (ref), (ref) and (ref) are satisfied. Then it holds that
\begin{equation}
\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\Vert \sum_{i=m+1}^{m+k}\left(
y_{i-1},\mathbf{x}_{i}^{\intercal }\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}-k
\mathbf{a}\right\Vert =O_{P}\left( 1\right) ,
\end{equation}
for all ${\Greekmath 0111} >0$, and
\begin{equation}
\max_{1\leq k<\infty }\left\vert \sum_{i=m+1}^{m+k}\frac{\left( {\Greekmath 010F}
_{i,1}y_{i-1}+{\Greekmath 010F} _{i,2}\right) y_{i-1}}{1+y_{i-1}^{2}}
-\sum_{i=m+1}^{m+k}\frac{\left( {\Greekmath 010F} _{i,1}\overline{y}_{i-1}+{\Greekmath 010F}
_{i,2}\right) \overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right\vert
=O_{P}\left( 1\right) .
\end{equation}
\begin{proof}
The proof is based on the results derived in the proof of Lemma (ref)
. Equation ((ref)) follows from exactly the same argumens as the
proof of ((ref)), and ((ref)) follows from the proof of (
(ref))-((ref)).
\end{proof}
lemmaWe assume that $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$, and that Assumptions (ref), (ref) and (ref) are satisfied. Then, on a suitably enlarged probability space, it
is possible to define two independent Wiener processes $\left\{
W_{m,1}\left( k\right) ,1\leq k\leq m\right\} $ and $\left\{ W_{m,2}\left(
k\right) ,1\leq k<\infty \right\} $, whose distributions do not depend on $m$
, such that
\begin{equation*}
\left\vert \sum_{i=2}^{m}\mathbf{a}^{\intercal }\mathbf{Q{\Greekmath 0111} }_{i}-
\mathscr{s}_{x,1}W_{m,1}\left( m\right) \right\vert =O_{P}\left(
m^{1/2-{\Greekmath 0110} }\right) ,
\end{equation*}
and
\begin{equation*}
\max_{1\leq k<\infty }\frac{1}{k^{1/2-{\Greekmath 0110} }}\left\vert \sum_{i=m+1}^{m+k}
\frac{\left( {\Greekmath 010F} _{i,1}\overline{y}_{i-1}+{\Greekmath 010F} _{i,2}\right)
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}-\mathscr{s}_{x,2}W_{m,2}\left(
k\right) \right\vert =O_{P}\left( 1\right) ,
\end{equation*}
for some $0<{\Greekmath 0110} <1/2$, where $\mathscr{s}_{x,1}$ and $\mathscr{s}_{x,2}$
are defined in ((ref)).
\begin{proof}
In the proof of Lemma (ref) we have shown that $\mathbf{{\Greekmath 0111} }_{i}$
is a decomposable Bernoulli shift; the desired result follows from
aue2014.
\end{proof}
lemmaWe assume that $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert >0$, and that Assumptions (ref), (ref)-(ref) are satisfied. Then it holds that
\begin{equation*}
\left\Vert \widehat{\mathbf{b}}_{m}-\mathbf{b}_{0}\right\Vert =O_{P}\left(
m^{-1/2}\right) .
\end{equation*}
\begin{proof}
Recall that
\begin{equation*}
\widehat{\mathbf{b}}_{m}-\mathbf{b}_{0}=\left( \mathbf{Q}_{m}^{\intercal }
\mathbf{W}_{m}\mathbf{Q}_{m}\right) ^{-1}\mathbf{Q}_{m}^{\intercal }\mathbf{W
}_{m}\mathbf{E}_{m}.
\end{equation*}
Repeating the proof of Theorem 3.1 in berkes2009, it follows that $
\left\vert y_{i}\right\vert \rightarrow \infty $ a.s. exponentially fast;
this immediately yields
\begin{equation*}
\left\Vert \mathbf{Q}_{m}^{\intercal }\mathbf{W}_{m}\mathbf{Q}_{m}-\mathbf{B}
_{m}\right\Vert =O_{P}\left( 1\right) ,
\end{equation*}
where $\mathbf{B}_{m}$ is a $\left( p+1\right) \times \left( p+1\right) $
symmetric matrix with elements $\left\{ B_{i,j},1\leq i,j\leq p+1\right\} $
defined as
\begin{align*}
&B_{1,1} =m, \\
&\left( B_{1,2},...,B_{1,p+1}\right) =\sum_{i=2}^{\infty }\frac{\mathbf{x}
_{i}^{\intercal }y_{i-1}}{1+y_{i-1}^{2}}, \\
&\left\{ B_{i,j},2\leq i,j\leq p+1\right\} =\sum_{i=2}^{\infty }\frac{
\mathbf{x}_{i}\mathbf{x}_{i}^{\intercal }}{1+y_{i-1}^{2}}.
\end{align*}
Since we already know from the above that $\left\Vert \mathbf{E}
_{m}\right\Vert =O_{P}\left( m^{1/2}\right) $, the result follows
immediately.
\end{proof}
\setcounter{subsection}{-1} \setcounter{subsubsection}{-1}
\setcounter{equation}{0} \setcounter{lemma}{0} \setcounter{theorem}{0}
Proofs
proof[Proof of Theorem (ref)]
Recall ((ref)). We begin by showing that
\begin{equation}
\max_{1\leq k<\infty }\frac{\left\vert Z_{m}\left( k\right) -\Gamma
_{m}\left( k\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }}=o_{P}\left(
1\right) .
\end{equation}
We begin by considering the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$; we write
\begin{align*}
& \left( {\Greekmath 010C} _{0}-\widehat{{\Greekmath 010C} }_{m}\right) \sum_{i=m+1}^{m+k}\frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}+\frac{k}{m}\sum_{i=2}^{m}\left( \frac{{\Greekmath 010F}
_{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) \\
=& \left( {\Greekmath 010C} _{0}-\widehat{{\Greekmath 010C} }_{m}\right) \left( \sum_{i=m+1}^{m+k}
\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}-ka_{3}\right) \\
& -ka_{3}\left( \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) ^{-1}-\frac{1}{ma_{3}}\right) \left( \sum_{i=2}^{m}\left( \frac{
{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{
1+y_{i-1}^{2}}\right) \right) \\
& +\frac{k}{m}\sum_{i=2}^{m}\left( {\Greekmath 010F} _{i,1}\left( \frac{\overline{y}
_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}-\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) +{\Greekmath 010F} _{i,2}\left( \frac{\overline{y}_{i-1}}{1+\overline{y}
_{i-1}^{2}}-\frac{y_{i-1}}{1+y_{i-1}^{2}}\right) \right) \\
=& R_{m,1}\left( k\right) +R_{m,2}\left( k\right) +R_{m,3}\left( k\right) .
\end{align*}
Using Lemmas (ref) and (ref) with ${\Greekmath 0111} <1/2$
\begin{align*}
& \max_{1\leq k<\infty }\frac{\left\vert R_{m,1}\left( k\right) \right\vert
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( m^{-1}\right) \max_{1\leq k\leq M}\frac{k^{1/2+{\Greekmath 0111} }}{\left(
1+\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }} \\
& +O_{P}\left( m^{-1}\right) \max_{M<k<\infty }\frac{k^{1/2+{\Greekmath 0111} }}{\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }} \\
=& O_{P}\left( 1\right) \left( m^{-1/2}\max_{1\leq k\leq M}k^{{\Greekmath 0111}
}+\max_{M<k<\infty }k^{{\Greekmath 0111} -1/2}\right) =o_{P}\left( 1\right) .
\end{align*}
Using the same logic, it can also be shown that
\begin{align*}
\max_{1\leq k<\infty }\frac{\left\vert R_{m,2}\left( k\right) \right\vert }{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }}& =o_{P}\left( 1\right) , \\
\max_{1\leq k<\infty }\frac{\left\vert R_{m,3}\left( k\right) \right\vert }{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }}& =o_{P}\left( 1\right) .
\end{align*}
Using Lemma (ref), it follows that
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert \frac{k}{m}
\sum_{i=2}^{m}\left( \frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}
}{1+\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}\overline{y}
_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) -\frac{k}{m}\left(
a_{1}{\Greekmath 011B} _{1}^{2}+a_{2}{\Greekmath 011B} _{2}^{2}\right) ^{1/2}W_{m,1}\left(
m\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}\right)
\left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( 1\right) \max_{1\leq k<\infty }\frac{k}{m}\frac{m^{1/2-{\Greekmath 0110} }
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }} \notag \\
=& O_{P}\left( m^{-{\Greekmath 0110} }\right) \max_{1\leq k<\infty }\left( \frac{k}{m+k}
\right) ^{1-{\Greekmath 0120} }=o_{P}\left( 1\right) . \notag
\end{align}
By the same token, we can show that
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert \sum_{i=m+1}^{m+k}
\left( {\Greekmath 010F} _{i,1}\left( \frac{\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}-\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) \right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( 1\right) \max_{1\leq k<\infty }\frac{1}{m^{1/2}\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }} \notag \\
=& O_{P}\left( m^{-1/2}\right) \max_{1\leq k<\infty }\frac{m}{m+k}\left(
\frac{k}{m+k}\right) ^{-{\Greekmath 0120} }=O_{P}\left( m^{-1/2+{\Greekmath 0120} }\right)
=o_{P}\left( 1\right) , \notag
\end{align}
and
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert \sum_{i=m+1}^{m+k}
\left( {\Greekmath 010F} _{i,2}\left( \frac{\overline{y}_{i-1}}{1+
\overline{y}_{i-1}^{2}}-\frac{y_{i-1}}{1+y_{i-1}^{2}}\right)
\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}\right) \left(
\frac{k}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( 1\right) \max_{1\leq k<\infty }\frac{1}{m^{1/2}\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }} \notag \\
=& O_{P}\left( m^{-1/2}\right) \max_{1\leq k<\infty }\frac{m}{m+k}\left(
\frac{k}{m+k}\right) ^{-{\Greekmath 0120} }=O_{P}\left( m^{-1/2+{\Greekmath 0120} }\right)
=o_{P}\left( 1\right) , \notag
\end{align}
having used Lemma (ref). Similarly, by Lemma (ref)
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert \sum_{i=m+1}^{m+k}
\left( \frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}+{\Greekmath 010F}
_{i,2}\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) -\left(
a_{1}{\Greekmath 011B} _{1}^{2}+a_{2}{\Greekmath 011B} _{2}^{2}\right) ^{1/2}W_{m,2}\left(
k\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}\right)
\left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( 1\right) \max_{1\leq k<\infty }\frac{k^{1/2-{\Greekmath 0110} }}{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }}=o_{P}\left( 1\right) . \notag
\end{align}
Putting all together, ((ref)) has been shown for the stationary
case. Considering now the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert \geq 0$, write
\begin{align*}
& \left( {\Greekmath 010C} _{0}-\widehat{{\Greekmath 010C} }_{m}\right) \sum_{i=m+1}^{m+k}\frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}+\frac{k}{m}\sum_{i=2}^{m}{\Greekmath 010F} _{i,1} \\
=& \left( {\Greekmath 010C} _{0}-\widehat{{\Greekmath 010C} }_{m}\right) \left( \sum_{i=m+1}^{m+k}
\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}-k\right) \\
& -k\left( \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}-\frac{1}{m}\right) \left( \sum_{i=2}^{m}\left( \frac{{\Greekmath 010F}
_{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}
}\right) \right) \\
& -\frac{k}{m}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}
+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}\right) \\
=& R_{m,4}\left( k\right) +R_{m,5}\left( k\right) +R_{m,6}\left( k\right) .
\end{align*}
The arguments are similar to the above. Indeed, using Lemmas (ref)-
(ref)
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert R_{m,4}\left( k\right) \right\vert
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( m^{-1/2}\right) \max_{1\leq k<\infty }\frac{km^{-{\Greekmath 0110} }}{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }} \notag \\
=& O_{P}\left( m^{-{\Greekmath 0110} }\right) =o_{P}\left( 1\right) . \notag
\end{align}
Similarly it can be shown that
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert R_{m,5}\left( k\right) \right\vert
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }}=O_{P}\left( m^{-{\Greekmath 0110} }\right) =o_{P}\left( 1\right)
, \\
& \max_{1\leq k<\infty }\frac{\left\vert R_{m,6}\left( k\right) \right\vert
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }}=O_{P}\left( m^{-{\Greekmath 0110} +{\Greekmath 0111} }\right) =o_{P}\left(
1\right) ,
\end{align}
having chosen ${\Greekmath 0111} <{\Greekmath 0110} $ in the last equation. Lemma (ref) yields
\begin{equation}
\max_{1\leq k<\infty }\frac{\left\vert \frac{k}{m}
\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}-{\Greekmath 011B} _{1}\frac{k}{m}
W_{m,1}\left( m\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }}=O_{P}\left(
m^{{\Greekmath 0110} -1/2}\right) =o_{P}\left( 1\right) ,
\end{equation}
and
\begin{equation}
\max_{1\leq k<\infty }\frac{\left\vert \sum_{i=m+1}^{m+k}
{\Greekmath 010F} _{i,1}-{\Greekmath 011B} _{1} W_{m,2}\left( k\right) \right\vert
}{m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k
}{m+k}\right) ^{{\Greekmath 0120} }}=O_{P}\left( m^{{\Greekmath 0110} -1/2}\right) =o_{P}\left(
1\right) .
\end{equation}
similarly, by Lemma (ref)
\begin{align}
& \max_{1\leq k<\infty }\frac{\left\vert \sum_{i=m+1}^{m+k}
\frac{{\Greekmath 010F} _{i,1}}{1+y_{i-1}^{2}}\right\vert +\left\vert
\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{
1+y_{i-1}^{2}}\right\vert }{m^{1/2}\left( 1+\frac{k}{m}\right)
\left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }} \\
=& O_{P}\left( m^{-{\Greekmath 0110} }\right) \max_{1\leq k<\infty }\frac{k^{1/2+{\Greekmath 0111} }}{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }} \notag \\
=& O_{P}\left( m^{1/2-{\Greekmath 0110} }\right) \max_{1\leq k<\infty }\frac{k^{1/2+{\Greekmath 0111}
-{\Greekmath 0120} }}{\left( m+k\right) ^{1/2+{\Greekmath 0111} -{\Greekmath 0120} +1/2-{\Greekmath 0111} }}=O_{P}\left( m^{{\Greekmath 0111}
-{\Greekmath 0110} }\right) =o_{P}\left( 1\right) , \notag
\end{align}
having chosen ${\Greekmath 0111} <{\Greekmath 0110} $. Putting all together, ((ref)) now
follows for the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert
\geq 0$.
Let now
\begin{equation}
\Gamma \left( t\right) =\left\{
\begin{array}{ll}
\mathscr{s}^{1/2}\left\vert W_{2}\left( t\right) -tW_{1}\left( 1\right)
\right\vert & \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{if }E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\ holds} \\
{\Greekmath 011B} _{1}\left\vert W_{2}\left( t\right) -tW_{1}\left( 1\right) \right\vert
& \relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{if }E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert \geq 0
\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{\ holds}
\end{array}
\right. ,
\end{equation}
where $\left\{ W_{1}\left( k\right) ,1\leq k\leq m\right\} $ and $\left\{
W_{2}\left( k\right) ,1\leq k<\infty \right\} $ are two independent standard
Wiener processes. Using the fact that the distribution of $W_{m,1}\left(
\cdot \right) $ and $W_{m,2}\left( \cdot \right) $ does not depend on $m$,
and exploiting the scale transformation and the continuity of the Wiener
process
\begin{align*}
& \max_{1\leq k<\infty }\frac{\Gamma _{m}\left( k\right) }{m^{1/2}\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }} \\
& \overset{\mathcal{D}}{=}\max_{1\leq k<\infty }\frac{\Gamma \left(
\frac{k}{m}\right) }{\left( 1+\frac{k}{m}\right)
\left( \frac{ k/m}{\displaystyle1+ k/m
}\right) ^{{\Greekmath 0120} }} \\
& \overset{\mathcal{D}}{=}\sup_{0<t<\infty }\frac{\Gamma \left( t\right) }{
\left( 1+t\right) \left( \frac{t}{1+t}\right) ^{{\Greekmath 0120} }}.
\end{align*}
Computing the covariance kernel, it can be easily verified that
\begin{equation}
\left\{ \frac{W_{2}\left( t\right) -tW_{1}\left( 1\right) }{1+t},t\geq
0\right\} \overset{\mathcal{D}}{=}\left\{ W\left( \frac{t}{1+t}\right)
,t\geq 0\right\} ,
\end{equation}
where $W\left( \cdot \right) $ denotes a standard Wiener. Hence
\begin{equation*}
\max_{1\leq k<\infty }\frac{\Gamma _{m}\left( k\right) }{m^{1/2}\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{{\Greekmath 0120} }}\overset{\mathcal{D}}{=}\sup_{0<t<\infty }\frac{\mathscr{s}
\left\vert W\left( \frac{t}{1+t}\right) \right\vert }{\left(
\frac{t}{1+t}\right) ^{{\Greekmath 0120} }},
\end{equation*}
whence Theorem (ref) follows.
proof[Proof of Theorem (ref)]
Using exactly the same arguments as in the proof of Theorem (ref), it
follows that
\begin{equation}
\max_{1\leq k\leq m^{\ast }}\frac{\left\vert Z_{m}\left( k\right) -\Gamma
_{m}\left( k\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{{\Greekmath 0120} }}=o_{P}\left(
1\right) .
\end{equation}
Further, it is immediate to see that
\begin{align*}
& \max_{1\leq k\leq m^{\ast }}\frac{\Gamma _{m}\left( k\right) }{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{{\Greekmath 0120} }} \\
\overset{\mathcal{D}}{=}& \max_{1\leq k\leq m^{\ast }}\frac{\Gamma \left(
\frac{k}{m}\right) }{\left( 1+\frac{k}{m}\right)
\left( \frac{ k/m}{\displaystyle1+ k/m
}\right) ^{{\Greekmath 0120} }} \\
\overset{\mathcal{D}}{=}& \sup_{0<t<m_{0}}\frac{\Gamma \left( t\right) }{
\left( 1+t\right) \left( \frac{t}{1+t}\right) ^{{\Greekmath 0120} }}.
\end{align*}
Using ((ref)), it finally follows
\begin{equation*}
\sup_{0<t<m_{0}}\frac{\Gamma \left( t\right) }{\left( 1+t\right) \left(
\frac{t}{1+t}\right) ^{{\Greekmath 0120} }}\overset{\mathcal{D}}{=}
\sup_{0<t<m_{0}}\frac{\mathscr{s}\left\vert W\left( \frac{t}{1+t
}\right) \right\vert }{\left( \frac{t}{1+t}\right) ^{{\Greekmath 0120} }},
\end{equation*}
whence the desired result.
proof[Proof of Theorem (ref)]
We begin by noting that, repeating verbatim the proof of ((ref)) with ${\Greekmath 0120} =1/2$, it can be shown that
\begin{equation}
\max_{1\leq k\leq m^{\ast }}\frac{\left\vert Z_{m}\left( k\right) -\Gamma
_{m}\left( k\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{1/2}}=O_{P}\left(
1\right) .
\end{equation}
Recall also that the distribution of $\Gamma _{m}\left( k\right) $ does not
depend on $m$, so that
\begin{equation*}
\left\{ m^{-1/2}\Gamma _{m}\left( mt\right) ,t\geq 0\right\} \overset{
\mathcal{D}}{=}\left\{ \Gamma \left( t\right) ,t\geq 0\right\} ,
\end{equation*}
where $\Gamma \left( t\right) $ is defined in ((ref)); further
recall that, by ((ref))
\begin{equation*}
\left\{ \frac{1}{\mathscr{s}}\frac{\Gamma \left( t\right) }{1+t},t\geq
0\right\} \overset{\mathcal{D}}{=}\left\{ \left\vert W\left( \frac{t}{1+t}
\right) \right\vert ,t\geq 0\right\} .
\end{equation*}
We now report some results concerning $\Gamma _{m}\left( k\right) $. We
begin by studying
\begin{align}
& \frac{1}{\mathscr{s}}\max_{1\leq k\leq \log m}\frac{\Gamma _{m}\left(
k\right) }{m^{1/2}\left( 1+\frac{k}{m}\right) \left(
\frac{k}{m+k}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \frac{1}{\mathscr{s}}\max_{1/m\leq t\leq \left(
\log m\right) /m}\frac{\Gamma \left( t\right) }{\left( 1+t\right) \left(
\frac{t}{1+t}\right) ^{1/2}}\overset{\mathcal{D}}{=}
\max_{1/m\leq t\leq \left( \log m\right) /m}\frac{\left\vert W\left(
\frac{t}{1+t}\right) \right\vert }{\left( \frac{t}{
1+t}\right) ^{1/2}} \notag \\
\overset{\mathcal{D}}{=}& \max_{1/\left( m+1\right) \leq u\leq \left( \log
m\right) /\left( m+\log m\right) }\frac{\left\vert W\left( u\right)
\right\vert }{u^{1/2}}\overset{\mathcal{D}}{=}\max_{1\leq v\leq \log m}\frac{
\left\vert W\left( v\right) \right\vert }{v^{1/2}} \notag \\
=& O_{P}\left( \sqrt{\log \log \log m}\right) , \notag
\end{align}
where we have repeatedly used the scale transformation of the Wiener
process, and the Law of the Iterated Logarithm in the last passage. Similarly
\begin{align}
& \frac{1}{\mathscr{s}}\max_{m/\log m\leq k\leq m^{\ast }}\frac{\Gamma
_{m}\left( k\right) }{m^{1/2}\left( 1+\frac{k}{m}\right) \left(
\frac{k}{m+k}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \frac{1}{\mathscr{s}}\max_{1/\log m\leq t\leq
m^{\ast }/\log m}\frac{\Gamma \left( t\right) }{\left( 1+t\right) \left(
\frac{t}{1+t}\right) ^{1/2}}\overset{\mathcal{D}}{=}
\max_{1/\log m\leq t\leq m^{\ast }/\log m}\frac{\left\vert W\left(
\frac{t}{1+t}\right) \right\vert }{\left( \frac{t}{
1+t}\right) ^{1/2}} \notag \\
\overset{\mathcal{D}}{=}& \max_{1/\left( \log m+1\right) \leq u\leq m^{\ast
}/\left( m+m^{\ast }\right) }\frac{\left\vert W\left( u\right) \right\vert }{
u^{1/2}}\overset{\mathcal{D}}{=}\max_{1\leq v\leq m^{\ast }\left( \log
m+1\right) /\left( m+m^{\ast }\right) }\frac{\left\vert W\left( v\right)
\right\vert }{v^{1/2}} \notag \\
=& O_{P}\left( \sqrt{\log \log \frac{m^{\ast }\left( \log m+1\right) }{
m+m^{\ast }}}\right) =O_{P}\left( \sqrt{\log \log \log m}\right) . \notag
\end{align}
Finally, by the same token, note that
\begin{align*}
& \frac{1}{\mathscr{s}}\max_{\log m\leq k\leq m/\log m}\frac{\Gamma
_{m}\left( k\right) }{m^{1/2}\left( 1+\frac{k}{m}\right) \left(
\frac{k}{m+k}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \frac{1}{\mathscr{s}}\max_{\log m\leq k\leq m/\log
m}\frac{\Gamma _{m}\left( \frac{k}{m}\right) }{\left( 1+
\frac{k}{m}\right) \left( \frac{k}{m+k}\right)
^{1/2}} \\
\overset{\mathcal{D}}{=}& \frac{1}{\mathscr{s}}\max_{\left( \log m\right)
/m\leq t\leq 1/\log m}\frac{\Gamma \left( t\right) }{\left( 1+t\right)
\left( \frac{t}{1+t}\right) ^{1/2}}\overset{\mathcal{D}}{=}
\max_{\left( \log m\right) /m\leq t\leq 1/\log m}\frac{\left\vert W\left(
\frac{t}{1+t}\right) \right\vert }{\left( \frac{t}{
1+t}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \max_{\left( \log m\right) /\left( m+\log m\right)
\leq t\leq 1/\left( \log m+1\right) }\frac{\left\vert W\left( u\right)
\right\vert }{u^{1/2}}\overset{\mathcal{D}}{=}\max_{1\leq v\leq \left(
m+\log m\right) /\left( \left( 1+\log m\right) \log m\right) }\frac{
\left\vert W\left( v\right) \right\vert }{v^{1/2}},
\end{align*}
and using the Law of the Iterated Logarithm it follows that
\begin{equation}
\lim_{m\rightarrow \infty }\frac{1}{\sqrt{2\log \log \frac{
m+\log m}{\left( 1+\log m\right) \log m}}}\max_{1\leq v\leq \left( m+\log
m\right) /\left( \left( 1+\log m\right) \log m\right) }\frac{\left\vert
W\left( v\right) \right\vert }{v^{1/2}}=1\relax\ifmmode\expandafter\text@\else\expandafter\mbox\fi{ \ \ a.s.}
\end{equation}
Given that, as $m\rightarrow \infty $
\begin{equation*}
\frac{\log \log \frac{m+\log m}{\left( 1+\log m\right) \log m}}{
\log \log m}=1,
\end{equation*}
it follows that the term in ((ref)) dominates, and therefore, putting
all together
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ \max_{1\leq k\leq m^{\ast }}\frac{
Z_{m}\left( k\right) }{m^{1/2}\left( 1+\frac{k}{m}\right)
\left( \frac{k}{m+k}\right) ^{1/2}}=\max_{1\leq v\leq \left(
m+\log m\right) /\left( \left( 1+\log m\right) \log m\right) }\frac{
\left\vert W\left( v\right) \right\vert }{v^{1/2}}\right\} =1.
\end{equation*}
Using the Darling-Erd\H{o}s theorem (darling1956limit), it follows
that
\begin{align*}
& \lim_{m\rightarrow \infty }P\left\{ {\Greekmath 010D} \left( \log \frac{m+\log m}{
\left( 1+\log m\right) \log m}\right) \max_{1\leq v\leq \left( m+\log
m\right) /\left( \left( 1+\log m\right) \log m\right) }\frac{\left\vert
W\left( v\right) \right\vert }{v^{1/2}}\right. \\
\leq & \left. x+{\Greekmath 010E} \left( \log \frac{m+\log m}{\left( 1+\log m\right)
\log m}\right) \right\} =\exp \left( -\exp \left( -x\right) \right) .
\end{align*}
The desired result follows upon noting that, by elementary arguments
\begin{align*}
\left\vert {\Greekmath 010D} \left( \frac{m+\log m}{\left( 1+\log m\right) \log m}
\right) -{\Greekmath 010D} \left( m\right) \right\vert & \rightarrow 0, \\
\left\vert {\Greekmath 010E} \left( \frac{m+\log m}{\left( 1+\log m\right) \log m}
\right) -{\Greekmath 010E} \left( m\right) \right\vert & \rightarrow 0,
\end{align*}
as $m\rightarrow \infty $.
proof[Proof of Theorem (ref)]
We start with the proof of ((ref)), considering the case $E\log
\left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$. As in the proof of
Theorem (ref), it suffices to show that
\begin{equation*}
\max_{1\leq k\leq m^{\ast }}\frac{Z_{m}^{\ast }\left( k\right) }{\overline{g}
_{m,{\Greekmath 0120} }\left( k\right) }\overset{\mathcal{D}}{\rightarrow }\frac{1}{
\overline{c}_{{\Greekmath 010B} ,{\Greekmath 0120} }}\sup_{0\leq t\leq 1}\frac{\left\vert W\left(
t\right) \right\vert }{t^{{\Greekmath 0120} }},
\end{equation*}
where
\begin{align*}
Z_{m}^{\ast }\left( k\right) =& \left\vert \left( \sum_{i=2}^{m}\frac{
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right) ^{-1}\left(
\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+
\overline{y}_{i-1}^{2}}\right) \left( \sum_{i=m+1}^{m+k}\frac{\overline{y}
_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right) \right. \\
& +\left. \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}\overline{y}
_{i-1}}{1+\overline{y}_{i-1}^{2}}\right\vert ,
\end{align*}
where recall that $\overline{y}_{i}$\ is the stationary solution of ((ref)). Using the proofs of Lemmas (ref) and (ref), it follows
by routine calculations that
\begin{equation*}
\left\vert \left( \sum_{i=2}^{m}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}\right) ^{-1}-\frac{1}{ma_{3}}\right\vert =O_{P}\left( m\right) ,
\end{equation*}
and
\begin{equation*}
\left\vert \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}
}{1+\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left( m^{1/2}\right) ,
\end{equation*}
where $a_{3}$ is defined in ((ref)). The approximations in aue2014
yield
\begin{equation*}
\left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120} }\max_{1\leq k\leq m^{\ast }}\frac{1}{
k^{{\Greekmath 0120} }}\left\vert \sum_{i=m+1}^{m+k}\left( \frac{\overline{y}_{i-1}^{2}}{
1+\overline{y}_{i-1}^{2}}-a_{3}\right) \right\vert \overset{\mathcal{D}}{
\rightarrow }a_{4}\sup_{0\leq t\leq 1}\frac{\left\vert W\left( t\right)
\right\vert }{t^{{\Greekmath 0120} }},
\end{equation*}
where
\begin{equation*}
a_{4}=\sum_{h=-\infty }^{\infty }E\left[ \left( \frac{\overline{y}_{0}^{2}}{
1+\overline{y}_{0}^{2}}-a_{3}\right) \left( \frac{\overline{y}_{h}^{2}}{1+
\overline{y}_{h}^{2}}-a_{3}\right) \right] .
\end{equation*}
Thus we conclude
\begin{align*}
& \left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120} }\left( \sum_{i=2}^{m}\frac{\overline{y
}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right) ^{-1}\left\vert \sum_{i=2}^{m}
\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}
+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{y}
_{i-1}^{2}}\right\vert \max_{1\leq k\leq m^{\ast }}\frac{1}{k^{{\Greekmath 0120} }}
\sum_{i=m+1}^{m+k}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}} \\
=& O_{P}\left( m^{-1/2}\right) \left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120}
}\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{{\Greekmath 0120} }}\sum_{i=m+1}^{m+k}\frac{
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}} \\
=& O_{P}\left( m^{-1/2}\right) \left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120}
}k^{1-{\Greekmath 0120} } \\
& +O_{P}\left( m^{-1/2}\right) \left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120}
}\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{{\Greekmath 0120} }}\sum_{i=m+1}^{m+k}\left(
\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}-a_{3}\right) \\
=& O_{P}\left( \left( \frac{m^{\ast }}{m}\right) ^{1/2}+m^{-1/2}\right)
=o_{P}\left( 1\right) .
\end{align*}
Using aue2014, we can define two independent Wiener processes $
\left\{ W_{m,1}\left( x\right) ,x\geq 0\right\} $ and $\left\{ W_{m,2}\left(
x\right) ,x\geq 0\right\} $ such that
\begin{align*}
& \max_{1\leq k\leq m^{\ast }}\frac{1}{\left( m^{\ast }\right) ^{1/2-{\Greekmath 0120}
}k^{{\Greekmath 0120} }}\left\vert \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}\overline{y}
_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}-\left( a_{1}^{1/2}{\Greekmath 011B}
_{1}W_{m,1}\left( k\right) +a_{2}^{1/2}{\Greekmath 011B} _{2}W_{m,2}\left( k\right)
\right) \right\vert \\
=& o_{P}\left( 1\right) .
\end{align*}
By the scale transformation and the continuity of the Wiener process, it
follows that
\begin{eqnarray*}
&&\max_{1\leq k\leq m^{\ast }}\frac{1}{\left( m^{\ast }\right) ^{1/2-{\Greekmath 0120}
}k^{{\Greekmath 0120} }}\left\vert a_{1}^{1/2}{\Greekmath 011B} _{1}W_{m,1}\left( k\right)
+a_{2}^{1/2}{\Greekmath 011B} _{2}W_{m,2}\left( k\right) \right\vert \\
&&\overset{\mathcal{D}}{=}\max_{1/m^{\ast }\leq k/m^{\ast }\leq 1}\left(
\frac{k}{m^{\ast }}\right) ^{-{\Greekmath 0120} }\left\vert a_{1}^{1/2}{\Greekmath 011B}
_{1}W_{m,1}\left( \frac{k}{m^{\ast }}\right) +a_{2}^{1/2}{\Greekmath 011B}
_{2}W_{m,2}\left( \frac{k}{m^{\ast }}\right) \right\vert \\
&&\overset{\mathcal{D}}{\rightarrow }\sup_{0\leq u\leq 1}\frac{1}{t^{{\Greekmath 0120} }}
\left\vert a_{1}^{1/2}{\Greekmath 011B} _{1}W_{1}\left( t\right) +a_{2}^{1/2}{\Greekmath 011B}
_{2}W_{2}\left( t\right) \right\vert ,
\end{eqnarray*}
where $W_{1}$ and $W_{2}$ are independent Wiener processes. Since
\begin{equation*}
\left\{ a_{1}^{1/2}{\Greekmath 011B} _{1}W_{1}\left( t\right) +a_{2}^{1/2}{\Greekmath 011B}
_{2}W_{2}\left( t\right) ,t\geq 0\right\} \overset{\mathcal{D}}{=}\left\{
\mathscr{s}W\left( t\right) ,t\geq 0\right\} ,
\end{equation*}
where $\left\{ W\left( t\right) ,t\geq 0\right\} $ is a Wiener process, the
result follows.
Next we consider the case ${\Greekmath 0120} =1/2$, and we establish a Darling-Erd\H{o}s
limiting law for $Z_{m}^{\ast }\left( k\right) $. Firstly note that
\begin{align*}
&\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{1/2}}\left( \sum_{i=2}^{m}\frac{
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}\right) ^{-1}\left(
\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+
\overline{y}_{i-1}^{2}}\right) \sum_{i=m+1}^{m+k}\frac{\overline{y}_{i-1}^{2}
}{1+\overline{y}_{i-1}^{2}} \\
=&O_{P}\left( \left( \frac{m^{\ast }}{m}\right) ^{1/2}\right) ,
\end{align*}
\begin{equation*}
\frac{1}{\left( \log \log m^{\ast }\right) ^{1/2}}\max_{1\leq k\leq m^{\ast
}}\frac{1}{k^{1/2}}\left\vert \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{
{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right\vert
=O_{P}\left( 1\right) ,
\end{equation*}
and
\begin{equation*}
\frac{1}{\left( \log \log m^{\ast }\right) ^{1/2}}\max_{\log m^{\ast }\leq
k\leq m^{\ast }/\log m^{\ast }}\frac{1}{k^{1/2}}\left\vert \sum_{i=m+1}^{m+k}
\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}
+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{y}
_{i-1}^{2}}\right\vert \overset{\mathcal{P}}{\rightarrow }c>0.
\end{equation*}
The above entails that we need to consider the maximum of $Z_{m}^{\ast
}\left( k\right) $ over $\log m^{\ast }\leq k\leq m^{\ast }/\log m^{\ast }$.
We have
\begin{align*}
&\max_{\log m^{\ast }\leq k\leq m^{\ast }/\log m^{\ast }}\frac{1}{k^{1/2}}
\left( \sum_{i=2}^{m}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}
\right) ^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}
}{1+\overline{y}_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}\overline{y}
_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) \sum_{i=m+1}^{m+k}\frac{\overline{y}
_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}} \\
=&O_{P}\left( \left( \frac{m^{\ast }}{m}\right) ^{1/2}\left( \log m^{\ast
}\right) ^{-1/2}\right) .
\end{align*}
By the Law of the Iterated Logarithm, it follows that
\begin{equation*}
\max_{1\leq k\leq \log m^{\ast }}\frac{1}{k^{1/2}}\left\vert
\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+
\overline{y}_{i-1}^{2}}\right\vert =O_{P}\left( \left( \log \log \log
m^{\ast }\right) ^{1/2}\right) .
\end{equation*}
Hence we need to show that, for all $-\infty <x<\infty $
\begin{align*}
&\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 010D} \left( \log m^{\ast }\right)
\frac{1}{\mathscr{s}}\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{1/2}}\left\vert
\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+\overline{y}
_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+
\overline{y}_{i-1}^{2}}\right\vert \leq x+{\Greekmath 010E} \left( \log m^{\ast
}\right) \right\} \\
=&\exp \left( -\exp \left( -x\right) \right) ,
\end{align*}
which follows from the same logic as the proof of Theorem (ref).
We now turn to the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert \geq 0$. Following the proof of Lemma (ref), it can
be shown that
\begin{equation}
\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}-\frac{1}{m}\right\vert =O_{P}\left( m^{-3/2}\right) ,
\end{equation}
\begin{equation}
\left\vert \left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{
1+y_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{1+y_{i-1}^{2}}
\right) -\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\right\vert =O_{P}\left( 1\right) ,
\end{equation}
\begin{equation}
\max_{1\leq k<\infty }\left\vert \sum_{i=m+1}^{m+k}\frac{y_{i-1}^{2}}{
1+y_{i-1}^{2}}-k\right\vert =O_{P}\left( c^{m}\right) ,
\end{equation}
and
\begin{equation}
\max_{1\leq k<\infty }\left\vert \left( \sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F}
_{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}+\sum_{i=m+1}^{m+k}\frac{{\Greekmath 010F}
_{i,2}y_{i-1}}{1+y_{i-1}^{2}}\right) -\sum_{i=m+1}^{m+k}{\Greekmath 010F}
_{i,1}\right\vert =O_{P}\left( c^{m}\right) ,
\end{equation}
\ \ with some $0<c<1$. Thus we get
\begin{align*}
&\left( \sum_{i=2}^{m}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}
\right) ^{-1}\left\vert \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}\overline{y}
_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right\vert \left( m^{\ast
}\right) ^{-1/2+{\Greekmath 0120} }\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{{\Greekmath 0120} }}
\sum_{i=m+1}^{m+k}\frac{\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}} \\
=&O_{P}\left( m^{-1/2}\right) \left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120}
}\max_{1\leq k\leq m^{\ast }}\frac{1}{k^{{\Greekmath 0120} }}\left( k+c^{m}\right) \\
=&O_{P}\left( \left( \frac{m^{\ast }}{m}\right) ^{1/2}\right) =o_{P}\left(
1\right) .
\end{align*}
Our assumptions entail that
\begin{equation*}
\left( m^{\ast }\right) ^{-1/2+{\Greekmath 0120} }\max_{1\leq k\leq m^{\ast }}\frac{1}{
k^{{\Greekmath 0120} }}\left\vert \sum_{i=m+1}^{m+k}{\Greekmath 010F} _{i,1}\right\vert \overset{
\mathcal{D}}{\rightarrow }{\Greekmath 011B} _{1}\sup_{0\leq t\leq 1}\frac{\left\vert
W\left( t\right) \right\vert }{t^{{\Greekmath 0120} }},
\end{equation*}
where $\left\{ W\left( t\right) ,t\geq 0\right\} $ is a Wiener process; this
completes the proof of ((ref)). Considering the case ${\Greekmath 0120} =1/2$
, we can follows the same arguments as above, using ((ref))-((ref)).
We obtain
\begin{equation*}
\left\vert \max_{1\leq k<m^{\ast }}\frac{\left\vert Z_{m}^{\ast }\left(
k\right) \right\vert }{k^{1/2}}-\max_{\log m^{\ast }\leq k<m^{\ast }/\log
m^{\ast }}\frac{1}{k^{1/2}}\left\vert \sum_{i=m+1}^{m+k}{\Greekmath 010F}
_{i,1}\right\vert \right\vert =o_{P}\left( \left( \log \log m^{\ast }\right)
^{-1/2}\right) .
\end{equation*}
Hence we need to prove only that
\begin{equation*}
\lim_{m\rightarrow \infty }P\left\{ {\Greekmath 010D} \left( \log m^{\ast }\right)
\frac{1}{{\Greekmath 011B} _{1}}\max_{\log m^{\ast }\leq k<m^{\ast }/\log m^{\ast }}
\frac{1}{k^{1/2}}\left\vert \sum_{i=m+1}^{m+k}{\Greekmath 010F} _{i,1}\right\vert
\leq x+{\Greekmath 010E} \left( \log m^{\ast }\right) \right\} =\exp \left( -\exp
\left( -x\right) \right) ,
\end{equation*}
which is shown in csorgo1997.
proof[Proof of Theorem (ref)]
Since the distributions of $W_{m,1}\left( \cdot \right) $\ and $
W_{m,2}\left( \cdot \right) $\ do not depend on $m$, Corollary (ref)
entails that, for all $-\infty <x<\infty $
\begin{equation*}
P\left\{ \max_{h_{m^{\ast }}\leq k\leq m^{\ast }}\frac{Z_{m}\left( k\right)
}{g_{m,0.5}\left( k\right) }\geq x\right\} =P\left\{ \max_{h_{m^{\ast }}\leq
k\leq m^{\ast }}\frac{\left\vert W_{1}\left( k\right) -\frac{k}{
m}W_{2}\left( m\right) \right\vert }{m^{1/2}\left( 1+\frac{k}{m}
\right) \left( \frac{k}{m+k}\right) ^{1/2}}\geq x\right\}
+o\left( 1\right) ,
\end{equation*}
as $m^{\ast }\rightarrow \infty $. In turn, this entails that we can
construct critical values $\widehat{c}_{{\Greekmath 010B} ,0.5}$ based on
\begin{equation*}
P\left\{ \max_{h_{m^{\ast }}\leq k\leq m^{\ast }}\frac{\left\vert
W_{1}\left( k\right) -\frac{k}{m}W_{2}\left( m\right)
\right\vert }{m^{1/2}\left( 1+\frac{k}{m}\right) \left(
\frac{k}{m+k}\right) ^{1/2}}\geq \widehat{c}_{{\Greekmath 010B}
,0.5}\right\} ={\Greekmath 010B} .
\end{equation*}
Using the scale transformation for Wiener processes
\begin{align*}
& \max_{h_{m^{\ast }}\leq k\leq m^{\ast }}\frac{\left\vert W_{1}\left(
k\right) -\frac{k}{m}W_{2}\left( m\right) \right\vert }{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
m+k}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \max_{h_{m^{\ast }}/m^{\ast }\leq k/m^{\ast }\leq
1}\frac{\left( 1+\frac{k}{m}\right) \left\vert W\left(
\frac{k/m}{1+k/m}\right) \right\vert }{\left( 1+
\frac{k}{m}\right) \left( \frac{k/m}{1+k/m}\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \max_{h_{m^{\ast }}/m^{\ast }\leq {\Greekmath 011C} \leq 1}
\frac{\left\vert W\left( \frac{{\Greekmath 011C} }{1+{\Greekmath 011C} }\right)
\right\vert }{\left( \frac{{\Greekmath 011C} }{1+{\Greekmath 011C} }\right) ^{1/2}} \\
\overset{\mathcal{D}}{=}& \max_{h_{m^{\ast }}/\left( m^{\ast }+h_{m^{\ast
}}\right) \leq u\leq 1/2}\frac{\left\vert W\left( u\right) \right\vert }{
u^{1/2}}\overset{\mathcal{D}}{=}\max_{1\leq v\leq {\Greekmath 011E} _{m}}\frac{\left\vert
W\left( v\right) \right\vert }{v^{1/2}} \\
\overset{\mathcal{D}}{=}& \max_{1\leq v\leq \exp \left( \log {\Greekmath 011E}
_{m}\right) }\frac{\left\vert W\left( v\right) \right\vert }{v^{1/2}},
\end{align*}
where $W\left( \cdot \right) $\ is a standard Wiener process and ${\Greekmath 011E}
_{m}=\left( m^{\ast }+h_{m^{\ast }}\right) /\left( 2h_{m^{\ast }}\right) $.
Using equation (18) in vostrikova, we have
\begin{equation}
P\left\{ \max_{1\leq v\leq \exp \left( \log {\Greekmath 011E} _{m}\right) }\frac{
\left\vert W\left( v\right) \right\vert }{v^{1/2}}\geq \widehat{c}_{{\Greekmath 010B}
,0.5}\right\} \simeq \frac{\widehat{c}_{{\Greekmath 010B} ,0.5}\exp \left( -\frac{1}{2}
\widehat{c}_{{\Greekmath 010B} ,0.5}^{2}\right) }{\left( 2{\Greekmath 0119} \right) ^{1/2}}\left(
\log {\Greekmath 011E} _{m}+\frac{4-\log {\Greekmath 011E} _{m}}{\widehat{c}_{{\Greekmath 010B} ,0.5}^{2}}
+O\left( \widehat{c}_{{\Greekmath 010B} ,0.5}^{-4}\right) \right) , \notag
\end{equation}
as $\widehat{c}_{{\Greekmath 010B} ,0.5}\rightarrow \infty $. This proves the claim.
proof[Proof of Theorem (ref)]
The proof follows, with minor modifications, the proofs of the results
above, so we only outline its main passages. We begin with part (i)
, and consider the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$. Lemma (ref) entails that we need to prove only
that
\begin{align}
& \max_{1\leq k<\infty }\frac{1}{g_{m,{\Greekmath 0120} }\left( k\right) }\max_{1\leq
\ell \leq k}\left\vert \sum_{i=m+\ell }^{m+k}\left( \frac{{\Greekmath 010F} _{i,1}
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) \right. \\
& \left. -\frac{k-\ell }{m}\sum_{i=2}^{m}\left( \frac{{\Greekmath 010F} _{i,1}
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) \right\vert \notag \\
& \overset{\mathcal{D}}{\rightarrow }\sup_{0<x<\infty }\frac{\sup_{0\leq
t\leq x}\left\vert \left( W_{2}\left( x\right) -W_{2}\left( t\right) \right)
-\left( x-t\right) W_{1}\left( 1\right) \right\vert }{\left( 1+x\right)
\left( x/\left( 1+x\right) \right) ^{{\Greekmath 0120} }}, \notag
\end{align}
where recall that $\overline{y}_{i}$ is the stationary solution of ((ref)
). The approximations in Lemma (ref) imply
\begin{align*}
& \max_{1\leq k<\infty }\frac{1}{g_{m,{\Greekmath 0120} }\left( k\right) }\max_{1\leq
\ell \leq k}\left\vert \sum_{i=m+\ell }^{m+k}\left( \frac{{\Greekmath 010F} _{i,1}
\overline{y}_{i-1}^{2}}{1+\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}
\overline{y}_{i-1}}{1+\overline{y}_{i-1}^{2}}\right) -\frac{k-\ell }{m}
\sum_{i=2}^{m}\left( \frac{{\Greekmath 010F} _{i,1}\overline{y}_{i-1}^{2}}{1+
\overline{y}_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}\overline{y}_{i-1}}{1+\overline{
y}_{i-1}^{2}}\right) \right. \\
& \left. -\mathscr{s}\left( W_{m,2}\left( k\right) -W_{m,2}\left( \ell
\right) -\frac{k-\ell }{m}W_{m,1}\left( m\right) \right) \right\vert \\
=& o_{P}\left( 1\right) .
\end{align*}
By the scale transformation and the continuity of the Wiener process we have
\begin{align*}
& \max_{1\leq k<\infty }\left( \frac{k+m}{k}\right) ^{{\Greekmath 0120} }\frac{m}{m+k}
\max_{1\leq \ell \leq k}\left\vert \left( W_{m,2}\left( k\right)
-W_{m,2}\left( \ell \right) -\frac{k-\ell }{m}W_{m,1}\left( m\right) \right)
\right\vert \\
& \overset{\mathcal{D}}{\rightarrow }\sup_{0<x<\infty }\left( \frac{1+x}{x}
\right) ^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq x}\left\vert \left(
W_{2}\left( x\right) -W_{2}\left( t\right) \right) -\left( x-t\right)
W_{1}\left( 1\right) \right\vert ,
\end{align*}
whence the desired result.
Next we consider the nonstationary case. Applying Lemma (ref)
(ii), we can replace ((ref)) with the proof of
\begin{align*}
&\max_{1\leq k<\infty }\frac{1}{g_{m,{\Greekmath 0120} }\left( k\right) }\max_{1\leq \ell
\leq k}\left\vert \sum_{i=m+\ell }^{m+k}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{
1+y_{i-1}^{2}}-\frac{k-\ell }{m}\sum_{i=2}^{m}\frac{{\Greekmath 010F}
_{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}\right\vert \\
&\overset{\mathcal{D}}{\rightarrow }\sup_{0<x<\infty }\left( \frac{1+x}{x}
\right) ^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq x}\left\vert \left(
W_{2}\left( x\right) -W_{2}\left( t\right) \right) -\left( x-t\right)
W_{1}\left( 1\right) \right\vert ,
\end{align*}
which follows from the approximations in Lemma (ref)(ii).
We conclude our proof by showing that
\begin{equation}
P\left\{ \sup_{0<x<\infty }\left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x}
\sup_{0\leq t\leq x}\left\vert \left( W_{2}\left( x\right) -W_{2}\left(
t\right) \right) -\left( x-t\right) W_{1}\left( 1\right) \right\vert <\infty
\right\} =1.
\end{equation}
When $0<x\leq 1$, using Theorem 2.1 in garsia,\footnote{
See also Lemma 4.1 in csorgo1993.} it follows that there exists a
random variable ${\Greekmath 0110} $ such that $E\left\vert {\Greekmath 0110} \right\vert
^{p}<\infty $ for all $p\geq 1$ and
\begin{align*}
&\left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq
x}\left\vert \left( W_{2}\left( x\right) -W_{2}\left( t\right) \right)
\right\vert \\
\leq &\left\vert {\Greekmath 0110} \right\vert \left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{
1}{1+x}\sup_{0\leq t\leq x}\left\vert \left( \left( x-t\right) \log \left(
\frac{1}{x-t}\right) \right) ^{1/2}\right\vert
\end{align*}
a.s., whence
\begin{align}
&\left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq
x}\left\vert \left( W_{2}\left( x\right) -W_{2}\left( t\right) \right)
-\left( x-t\right) W_{1}\left( 1\right) \right\vert \\
\leq &\left\vert {\Greekmath 0110} \right\vert \left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{
1}{1+x}\sup_{0\leq t\leq x}\left\vert \left( \left( x-t\right) \log \left(
\frac{1}{x-t}\right) \right) ^{1/2}\right\vert +W_{1}\left( 1\right) \left(
\frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq x}\left\vert
x-t\right\vert . \notag
\end{align}
It is now easy to see that
\begin{equation*}
\left\vert {\Greekmath 0110} \right\vert \left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x
}\sup_{0\leq t\leq x}\left\vert \left( \left( x-t\right) \log \left( \frac{1
}{x-t}\right) \right) ^{1/2}\right\vert =O_{P}\left( 1\right) .
\end{equation*}
As far as the second term in ((ref)) is concerned, it immediately
follows that
\begin{equation*}
\left\vert W_{1}\left( 1\right) \right\vert \left( \frac{1+x}{x}\right)
^{{\Greekmath 0120} }\frac{1}{1+x}\sup_{0\leq t\leq x}\left\vert x-t\right\vert
=O_{P}\left( 1\right) \left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} -1}=O_{P}\left(
1\right) .
\end{equation*}
Also, by the Law of the Iterated Logarithm, it follows that
\begin{align*}
&\sup_{1\leq x<\infty }\left( \frac{1+x}{x}\right) ^{{\Greekmath 0120} }\frac{1}{1+x}
\sup_{0\leq t\leq x}\left\vert \left( W_{2}\left( x\right) -W_{2}\left(
t\right) \right) -\left( x-t\right) W_{1}\left( 1\right) \right\vert \\
\leq &\sup_{1\leq x<\infty }\frac{1}{x}2\sup_{0\leq t\leq x}\left\vert
W_{2}\left( x\right) \right\vert +\left\vert W_{1}\left( 1\right)
\right\vert <\infty ,
\end{align*}
a.s., whence ((ref)) follows.
Finally, as far as parts (ii) and (iii) of the theorem are
concerned, the proofs are based on the observation that
\begin{equation*}
\max_{1\leq k\leq m^{\ast }}\frac{1}{g_{m,{\Greekmath 0120} }^{\ast }\left( k\right) }
\max_{1\leq \ell \leq k}\frac{k-\ell }{m}\left\vert \sum_{i=2}^{m}\frac{
{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}+\frac{{\Greekmath 010F} _{i,2}y_{i-1}}{
1+y_{i-1}^{2}}\right\vert =o_{P}\left( 1\right) ,
\end{equation*}
and the same using $\overline{g}_{m,{\Greekmath 0120} }\left( k\right) $; hence, the
arguments above can be repeated with minor modifications.
proof[Proof of Corollary (ref)]
The result is shown e.g. in the proof of Theorem 3.4 in HT2016, or
Corollary 3.1 in horvath2022changepoint.
In order to prove the next set of results, we will make use of the following
decomposition, valid under ((ref))
align[align omitted — 740 chars of source]
with the convention that $\sum_{a}^{b}=0$ whenever $b<a$.
proof[Proof of Theorem (ref)]
Based on the results above, the theorem follows from standard arguments -
see e.g. Theorem 4.1 in horvath2022changepoint.
proof[Proof of Theorem (ref)]
We begin by decomposing the detector $Z_{m}^{X}\left( k\right) $ as
\begin{equation}
Z_{m}^{X}\left( k\right) =\left\vert \left( \mathbf{b}_{0}-\widehat{\mathbf{b
}}_{m}\right) ^{\intercal }\sum_{i=m+1}^{m+k}\left( y_{i-1},\mathbf{x}
_{i}^{\intercal }\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}+\sum_{i=m+1}^{m+k}
\frac{\left( {\Greekmath 010F} _{i,1}y_{i-1}+{\Greekmath 010F} _{i,2}\right) y_{i-1}}{
1+y_{i-1}^{2}}\right\vert .
\end{equation}
Henceforth, the proof is very similar to the proof of Theorem (ref),
and we only report the main passages where the two proofs differ.
Consider first the case $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F}
_{0,1}\right\vert <0$; using Lemmas (ref)-(ref) instead of
Lemmas (ref)-(ref), it can be shown along the same lines as in
the proof of Theorem (ref) that
\begin{equation*}
\max_{1\leq k<\infty }\frac{Z_{m}^{X}\left( k\right) }{m^{1/2}\left( 1+
\frac{k}{\mathscr{s}_{x}^{2}m}\right) \left( \frac{
k}{k+\mathscr{s}_{x}^{2}m}\right) ^{{\Greekmath 0120} }}\overset{\mathcal{D}}{\rightarrow
}\sup_{0<t<\infty }\frac{\left\vert -\mathscr{s}_{x,1}tW_{1}\left( 1\right) +
\mathscr{s}_{x,2}W_{2}\left( t\right) \right\vert }{\left( 1+
\frac{t}{\mathscr{s}_{x}^{2}}\right) \left( \frac{t}{t+
\mathscr{s}_{x}^{2}}\right) ^{{\Greekmath 0120} }},
\end{equation*}
where $\left\{ W_{1}\left( t\right) ,t\geq 0\right\} $ and $\left\{
W_{2}\left( t\right) ,t\geq 0\right\} $\ are two independent standard Wiener
processes. It is not hard to see that
\begin{equation*}
\sup_{0<t<\infty }\frac{\left\vert -\mathscr{s}_{x,1}tW_{1}\left( 1\right) +
\mathscr{s}_{x,2}W_{2}\left( t\right) \right\vert }{\left( 1+
\frac{t}{\mathscr{s}_{x}^{2}}\right) \left( \frac{t}{t+
\mathscr{s}_{x}^{2}}\right) ^{{\Greekmath 0120} }}\overset{\mathcal{D}}{=}
\sup_{0<u<\infty }\frac{\left\vert -\mathscr{s}_{x,1}\mathscr{s}
_{x}^{2}uW_{1}\left( 1\right) +\mathscr{s}_{x,2}W_{2}\left( \mathscr{s}
_{x}^{2}u\right) \right\vert }{\left( 1+u\right) \left( \frac{u
}{1+u}\right) ^{{\Greekmath 0120} }},
\end{equation*}
and that, for $u\leq v$
\begin{align*}
& E\left( \left( -\mathscr{s}_{x,1}\mathscr{s}_{x}^{2}uW_{1}\left( 1\right) +
\mathscr{s}_{x,2}W_{2}\left( \mathscr{s}_{x}^{2}u\right) \right) \left( -
\mathscr{s}_{x,1}\mathscr{s}_{x}^{2}vW_{1}\left( 1\right) +\mathscr{s}
_{x,2}W_{2}\left( \mathscr{s}_{x}^{2}v\right) \right) \right) \\
=& \mathscr{s}_{x,1}^{2}\left( \mathscr{s}_{x}^{2}\right) ^{2}uv+\mathscr{s}
_{x,2}^{2}\mathscr{s}_{x}^{2}u=\frac{\mathscr{s}_{x,2}^{4}}{\mathscr{s}
_{x,1}^{2}}\left( uv+u\right) .
\end{align*}
Hence it follows that
\begin{equation*}
\left\{ \frac{-\mathscr{s}_{x,1}\mathscr{s}_{x}^{2}uW_{1}\left( 1\right) +
\mathscr{s}_{x,2}W_{2}\left( \mathscr{s}_{x}^{2}u\right) }{1+u},u\geq
0\right\} \overset{\mathcal{D}}{=}\left\{ \frac{\mathscr{s}_{x,2}^{2}}{
\mathscr{s}_{x,1}}W\left( u\right) ,u\geq 0\right\} ,
\end{equation*}
where $\left\{ W\left( u\right) ,u\geq 0\right\} $\ is an independent
standard Wiener process. This completes the proof when $E\log \left\vert
{\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert <0$.
When $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert >0$, consider (
(ref)) again. Seeing as
\begin{equation}
\left\Vert \sum_{i=m+1}^{\infty }\frac{\mathbf{x}_{i}y_{i-1}}{1+y_{i-1}^{2}}
\right\Vert =O_{P}\left( 1\right) ,
\end{equation}
it is easy to see that
\begin{align*}
& \left\vert \left( \mathbf{b}_{0}-\widehat{\mathbf{b}}_{m}\right)
^{\intercal }\left( \sum_{i=m+1}^{m+k}\left( y_{i-1},\mathbf{x}
_{i}^{\intercal }\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}
\left( y_{i-1},\mathbf{0}_{p}^{\intercal }\right) \frac{y_{i-1}}{
1+y_{i-1}^{2}}\right) \right\vert \\
\leq & \left\Vert \mathbf{b}_{0}-\widehat{\mathbf{b}}_{m}\right\Vert
\left\Vert \sum_{i=m+1}^{m+k}\left( y_{i-1},\mathbf{x}_{i}^{\intercal
}\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}\left( y_{i-1},
\mathbf{0}_{p}^{\intercal }\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}\right\Vert
\\
=& O_{P}\left( m^{-1/2}\right) ,
\end{align*}
where $\mathbf{0}_{p}$ is a $p$-dimensional vector of zeros. Similarly,
using ((ref)) and standard algebra, it follows that
\begin{equation*}
\left\Vert \left( \mathbf{b}_{0}-\widehat{\mathbf{b}}_{m}\right) ^{\intercal
}-\left( \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) ,\mathbf{0}_{p}^{\intercal }\right) \right\Vert =O_{P}\left(
m^{-1/2}\right) ,
\end{equation*}
and by ((ref))
\begin{equation*}
\max_{1\leq k<\infty }\frac{1}{k}\left\vert \left( \sum_{i=2}^{m}\frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}\right) ^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F}
_{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}\right) \left( \sum_{i=m+1}^{m+k}\frac{
y_{i-1}^{2}}{1+y_{i-1}^{2}}-k\right) \right\vert =O_{P}\left( m^{-1/2-{\Greekmath 0110}
}\right) ,
\end{equation*}
for some ${\Greekmath 0110} >0$, and similarly to ((ref))-((ref))
\begin{equation*}
\left\vert \left( \sum_{i=2}^{m}\frac{y_{i-1}^{2}}{1+y_{i-1}^{2}}\right)
^{-1}\left( \sum_{i=2}^{m}\frac{{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}
\right) -\frac{1}{m}\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\right\vert =O_{P}\left(
m^{1/2-{\Greekmath 0110} }\right) .
\end{equation*}
Thus, putting all together
\begin{equation*}
\max_{1\leq k<\infty }\frac{1}{k}\left\vert \left( \mathbf{b}_{0}-\widehat{
\mathbf{b}}_{m}\right) ^{\intercal }\sum_{i=m+1}^{m+k}\left( y_{i-1},\mathbf{
x}_{i}^{\intercal }\right) \frac{y_{i-1}}{1+y_{i-1}^{2}}-\frac{k}{m}
\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\right\vert =O_{P}\left( m^{-1/2-{\Greekmath 0110} }\right)
.
\end{equation*}
Finally, similarly to ((ref)) it can be shown
\begin{equation*}
\max_{1\leq k<\infty }k^{-1/2-{\Greekmath 0111} }\left\vert \sum_{i=m+1}^{m+k}\frac{
{\Greekmath 010F} _{i,1}y_{i-1}^{2}}{1+y_{i-1}^{2}}-\sum_{i=m+1}^{m+k}{\Greekmath 010F}
_{i,1}\right\vert =O_{P}\left( m^{-{\Greekmath 0110} }\right) ,
\end{equation*}
for some ${\Greekmath 0110} >0$ and for all ${\Greekmath 0111} >0$. Putting all together and
recalling that, when $E\log \left\vert {\Greekmath 010C} _{0}+{\Greekmath 010F} _{0,1}\right\vert
>0$, $\mathscr{s}_{x}^{2}=1$, it follows that
\begin{equation*}
\max_{1\leq k<\infty }\frac{\left\vert Z_{m}^{X}\left( k\right) -\left\vert
\sum_{i=m+1}^{m+k}{\Greekmath 010F} _{i,1}-\frac{k}{m}
\sum_{i=2}^{m}{\Greekmath 010F} _{i,1}\right\vert \right\vert }{
m^{1/2}\left( 1+\frac{k}{m}\right) \left( \frac{k}{
k+m}\right) ^{{\Greekmath 0120} }}=o_{P}\left( 1\right) .
\end{equation*}
Hereafter, the final result follows by making appeal to the proof of Theorem
(ref).
proof[Proof of Theorem (ref)]
The proof follows immediately from the approximations derived above, and
from the proof of Theorem (ref).
proof[Proof of Theorem (ref)]
The proof follows by the same arguments as the proof of Theorem (ref), and we therefore omit it to save space.
proof[Proof of Theorem (ref)]
The proof follows from the same arguments as in the case with no covariates.