Pith. sign in

REVIEW 1 major objections 5 minor 36 references

Iterations of dependent random maps and exogeneity in nonlinear dynamics

T0 review · 1 major / 5 minor · reviewed 2026-08-14 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Backward iteration of dependent random maps yields unique stationary, ergodic nonlinear autoregressions with exogenous covariates.

desk verdict A genuinely new and mostly sound framework for dependent random maps with exogenous covariates, but the GARCH application is mis-specified as written and the core theorems deserve a careful referee. read the letter →

arxiv 1908.00845 v3 pith:G2UCL447 submitted 2019-08-02 math.ST stat.TH

Max Zinsou Debaly , Lionel Truquet This is my paper · ORCID
classification math.STstat.TH MSC 62M1060G0560G10
keywords timeseriesrandommapsergodicitydependenceexogenouscovariatesconditionalcontractionbackwarditerationsfunctionalmeasure
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper establishes a general existence, uniqueness, stationarity, and ergodicity theorem for nonlinear autoregressive processes with exogenous covariates. The driving mechanism is the convergence of backward iterations of dependent random maps: under a conditional contraction in expectation that is uniform over blocks of $m$ iterates, the backward iterates $f_t^{t-s}(x)$ converge in $L^p$ and almost surely to a limit independent of the starting point $x$, and that limit defines the stationary solution $X_t$. The same conclusion is extended to $q$-lag recursions $X_t=F(X_{t-1},\ldots,X_{t-q},\zeta_t)$ under the spectral-radius condition $\rho(A_1+\cdots+A_q)<1$. The paper also bounds the functional dependence measure of the solution, so standard limit theorems apply; this yields concrete conditions for CHARN, GARCH, Poisson autoregressions, dynamic binary choice, and categorical time series.

What carries the argument

The central object is the backward iteration of dependent random maps, $f_t^s=f_t\circ\cdots\circ f_s$, whose limit $f_t^{-\infty}(x)=\lim_{s\to\infty}f_t^{t-s}(x)$ is used to build the stationary solution. The load-bearing identity is the block contraction in Assumption A2: for each $t$, almost surely, $E[d^p(f_t^{t+m-1}(x),f_t^{t+m-1}(y))\mid\mathcal{F}_{t-1}]\le\kappa^p d^p(x,y)$ for a fixed $\kappa<1$, together with a one-step $L$-Lipschitz bound. Iterating this bound block by block gives geometric decay of $L^p$ distances between backward iterates, which yields convergence, independence of the starting state, and uniqueness. For $q$-lag recursions the same mechanism is run through the companion matrix $B$ built from $A_1,\ldots,A_q$; the condition $\rho(A_1+\cdots+A_q)<1$ implies $\rho(B)<1$, producing a block contraction on the product state space.

What would settle it

For the linear recursion $X_t=\kappa(Z_{t-1})X_{t-1}+\varepsilon_t$, take a stationary ergodic covariate process with $E\log\kappa(Z_0)<0$, $P(\kappa(Z_0)\ge1)>0$, and dependence such that $E[\prod_{i=1}^j\kappa(Z_{t-i})]$ does not decay to zero, as constructed in Section 2.2. The paper predicts the series solution fails to converge in $L^1$; verifying whether the backward iterations still converge in $L^1$ for such a process would delineate exactly how far beyond A2 the method can go. For $q$-lag models, the analogous test is to find a covariates-dependent model where $\rho(A_1(z)+\cdots+A_q(z))<1$ for every $z$ but $\sup_z\rho(A_1(z)+\cdots+A_q(z))\ge1$, and ask whether a stationary non-anticipative solution with a finite moment still exists.

Watch

Extended reading notes

Core claim

On its own terms, the paper proves Theorem 2: whenever Assumptions A1 and A2 hold, for every $t$ and every starting state $x$ the backward iterates $f_t^{t-s}(x)$ converge almost surely and in $L^p$ to a limit $X_t(x)$ that does not depend on $x$; the process $((X_t,\zeta_t))$ is stationary, is ergodic whenever $(\zeta_t)$ is, and is the unique non-anticipative solution of $X_t=f_t(X_{t-1})$ satisfying $\sup_t E[d^p(X_t,x_0)]<\infty$. Theorem 4 transfers the statement to $q$-lag recursions through a companion-matrix argument, with the checkable condition $\rho(A_1+\cdots+A_q)<1$. The paper further shows that the functional dependence coefficients of $X$ decay geometrically in the lag, up to a convolution term inherited from the covariate process, and gives a central limit theorem for partial sums of functions of the solution. The intended advance is to replace the classical contraction-on-average or Lyapunov-exponent condition by a conditional expectation contraction that is straightforward to verify when exogenous regressors enter the dynamic.

Load-bearing premise

The entire existence and uniqueness proof depends on Assumption A2, namely that the same contraction factor $\kappa<1$ bounds the conditional expectation of the distance after every block of $m$ iterates, uniformly over all states and all times. If that uniform bound fails, the argument collapses even when the covariate process is stationary and ergodic; the paper's linear example shows that a weaker log-moment condition $E\log\kappa(Z_0)<0$ is not enough for $L^1$ convergence.

Editorial extensions

If this is right

  • Any recursion satisfying A1-A2 has exactly one stationary non-anticipative solution with a finite $p$-th moment, and initializing from that solution makes the process stationary and ergodic.
  • For $q$-lag autoregressions, existence and uniqueness reduce to checking $\rho(A_1+\cdots+A_q)<1$, which is explicit for CHARN, GARCH with covariates, PARX, and other models in Section 4.
  • The functional dependence coefficients of the solution decay at least geometrically with the lag, up to a convolution term coming from the covariate process, so the central limit theorem in Theorem 5 applies to partial sums of Lipschitz functions of the process.
  • The framework works with predetermined regressors — the noise at time $t$ independent of the past, but possibly influencing future covariates — rather than requiring strict exogeneity.
  • Under strict exogeneity, Theorem 3 replaces the uniform contraction by the log-moment condition $E\log\kappa(Z_0)<0$, at the cost of losing unconditional moments and simple higher-lag conditions.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper notes A1-A2 do not require stationarity of $(\zeta_t)$; an editor's extension is that the same backward-iteration construction may define nonstationary or locally stationary solutions, although laws of large numbers would need separate assumptions.
  • For categorical models the convergence of backward iterations is literal path coalescence; this suggests a constructive perfect-simulation or regeneration algorithm for categorical time series with covariates, extending the simple $q=1$ illustration.
  • The linear counterexample indicates that the dependence structure of $\kappa(Z_t)$ matters as much as its marginal moments; a sharper research target is a condition on the tail of products along stationary paths that is between $\|\kappa(Z_0)\|_\infty<1$ and $E\log\kappa(Z_0)<0$.
  • The functional-dependence bounds rely only on Lipschitz dependence of the map on the covariate coordinate (A3' or B4), so the same route should yield CLTs for quasi-likelihood estimation in PARX, GARCH-X, and related observation-driven models with covariates not listed in the paper.
Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

1 major / 5 minor

Summary. The paper develops a general existence and uniqueness theory for stationary, ergodic, and moment-bounded solutions of nonlinear autoregressions with exogenous covariates, viewed as backward iterations of dependent random maps. The central result, Theorem 2, replaces the classical average contraction condition with a contraction in conditional expectation, yielding Lp and almost sure convergence of backward iterations, uniqueness among non-anticipative solutions with finite p-th moment, and stationarity/ergodicity. Theorem 4 extends this to q-lag recursions under a matrix spectral-radius condition. Section 3 provides bounds on Wu's functional dependence measure and a central limit theorem. The framework is applied to CHARN, GARCH, Poisson autoregressions, binary choice, and categorical time series models.

Significance. If the main theorems are correct, this is a useful and broadly applicable framework: it gives explicit, checkable sufficient conditions for stationarity, ergodicity, moments, and functional-dependence estimates for nonlinear time series with covariates, and it covers both predetermined and strictly exogenous regressors. The paper is honest about the strength of its uniform contraction assumption, and Section 2.2 gives a concrete example showing that a weaker tail condition does not in general suffice for L1 convergence. The central proof strategy is coherent and the statements of Theorems 2 and 4 are internally consistent; no fitted parameters or reverse-engineered predictions appear. However, the GARCH verification in Section 6.8 contains a substantive mismatch with the stated model, so the application section needs correction before the paper can be accepted as is.

major comments (1)
  1. [§6.8, Eq. (12) and Proposition 4] The verification of Assumption B3 for the GARCH model does not correspond to the recursion (12). In (12), h_t is F_{t-1}-predictable and satisfies h_t = π'Z_{t-1} + Σ_{j=1}^q β_j h_{t-j} + Σ_{j=1}^q α_j^+(Y_{t-j}^+)^δ + α_j^-(Y_{t-j}^-)^δ, with no current ε_t term. But the proof defines F_2(y,ζ_t) = (ε_t^+)^δ y_{1,1}, F_3(y,ζ_t) = (ε_t^-)^δ y_{1,1}, and includes (α_1^+(ε_t^+)^δ + α_1^-(ε_t^-)^δ) y_{1,1} in F_1. This makes the state component corresponding to Y_t^± equal to (ε_t^±)^δ times the previous value y_{1,1}, rather than (ε_t^±)^δ h_t. The displayed matrices A_1 and A_j are therefore not the Lipschitz matrices for the recursion X_t = ((Y_t^+)^δ, (Y_t^-)^δ, h_t) arising from (12), and the assertion that G1-G2 with γ<1 implies B3 is not established as written. A corrected verification should define F_2 and F_3 through the current h_t coordinate (or, with a suitable state ordering, through F_1 containing no current ε_t term) and recompute the spectral radius; the rank-one structure of the resulting matrix sum suggests that γ<1 may still be the right condition, but this needs to be proved.
minor comments (5)
  1. [§6.1, Eq. (22)] The display 'Σ_{s,t∈Z, s≤t} ‖d(y, f_t^s(x))‖_p < ∞' cannot hold as written over the infinite bi-infinite index set; the intended statement is presumably that the telescoping series is summable uniformly in t, e.g. sup_{t∈Z} Σ_{i≥0} ‖d(f_t^{t-i}(x), f_t^{t-i-1}(x))‖_p < ∞.
  2. [§3.1, after Assumption A3] The sentence 'An immediate consequence of Assumption A4' should refer to Assumption A3, since A4 is introduced later.
  3. [§4.2, Proposition 4] In the definition H_t = ((Y_t^+)^δ, (Y_t^+)^δ, h_t), the second coordinate is presumably (Y_t^-)^δ; otherwise the state vector has a duplicate component.
  4. [§6.5, Proof of Proposition 2] The text 'Using Assumptions A5-B5' refers to assumptions that are not named in the paper; it should reference Assumptions A4 and B4.
  5. [§6.4, Proof of Theorem 4] The sentence 'A2 is satisfied with d = d' appears to contain a typographical omission; the new metric should be denoted by a different symbol, such as d with a tilde, to distinguish it from the original distance d.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: main existence theorems derive limits from explicit contraction assumptions; self-citation is non-load-bearing.

full rationale

The paper's central derivation is self-contained rather than circular. Theorem 2 assumes A1-A2 (uniform conditional contraction in Lp) and proves by direct backward-iteration estimates in Section 6.1 that the iterates f_t^{t-s}(x) form a Cauchy sequence in Lp and almost surely; the stationary/ergodic solution and its uniqueness are consequences of this construction, not inputs. Assumption A2 does not contain the conclusion: it is a contraction condition on the random maps, and the proof constructs X_t(x) as the limit of backward iterates. The q-lag Theorem 4 reduces to Theorem 2 via the companion matrix B, and the spectral radius condition rho(A1+...+Aq)<1 is used to verify A2, not assumed as existence of a stationary solution. Theorem 3 similarly derives convergence from E log kappa(Z0)<0 via the classical Brandt series. Propositions 1-2 bound the Wu functional-dependence coefficients using the same assumptions, with external limit theorems (Wu 2005) invoked only for the CLT. The only self-citation, Fokianos and Truquet (2019), is used as a comparison for categorical time series and is not load-bearing for the main results. Section 2.2 explicitly flags the tail-condition limitation, but that is an acknowledged boundary of the method, not a disguised input. The GARCH example discrepancy noted by the reviewer (F1 involving epsilon_t while h_t is predictable) is a correctness/application-level issue, not a circularity; it does not make the main theorem derive its conclusion from itself.

Assumptions & free parameters 0 free parameters · 7 assumptions · 0 invented entities

The paper introduces no fitted constants and no invented entities. Its central claims rest on explicit uniform contraction assumptions (A2, B3) plus standard external results (Elton, Brandt, Wu, Kallenberg). The assumptions are checkable in examples but strong; the paper itself discusses their limitations.

assumptions (7)
  • standard math Regular conditional distributions exist for (zeta_t,...,zeta_{t+m-1}) given F_{t-1} on Polish spaces.
    Interprets the pointwise conditional bounds in A2; cited to Kallenberg (2006), Chapter 5.
  • domain assumption A1-A2: bounded one-step displacement in Lp and uniform m-step contraction in conditional expectation with constants L and kappa<1.
    Main sufficient condition for Theorem 2; uniform in t and state, stronger than ordinary average contraction; load-bearing.
  • standard math Theorem 1 of Elton (1990): negative Lyapunov exponent implies a.s. convergence of backward iterations of Lipschitz random maps.
    Used for binary choice and categorical examples, not reproved in the paper.
  • standard math Brandt (1986): stationary solution of Y_t=kappa(Z_{t-1})Y_{t-1}+b_{t-1}(x) exists when E log kappa(Z0)<0.
    Used in the proof of Theorem 3 for strictly exogenous regressors.
  • domain assumption B3: matrices A_i with nonnegative entries and rho(A1+...+Aq)<1 bound the conditional Lp increments of the q-lag recursion.
    The spectral radius condition is the contraction assumption behind Theorem 4.
  • domain assumption A4: the covariate process has a Bernoulli shift representation with i.i.d. innovations paired with the noise.
    Needed to define and control the functional dependence measure in Section 3.
  • standard math Wu (2005) functional dependence CLT and invariance principle.
    Theorem 5 is a corollary of this external result.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Iterations of dependent random maps and exogeneity in nonlinear dynamics." pith.science (2026). https://pith.science/paper/G2UCL447

@misc{pith2026190800845,
  author       = {Pith},
  title        = {Pith review of: Iterations of dependent random maps and exogeneity in nonlinear dynamics},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/G2UCL447}},
  note         = {Machine review of arXiv:1908.00845}
}
read the original abstract

We discuss existence and uniqueness of stationary and ergodic nonlinear autoregressive processes when exogenous regressors are incorporated in the dynamic. To this end, we consider the convergence of the backward iterations of dependent random maps. In particular, we give a new result when the classical condition of contraction on average is replaced with a contraction in conditional expectation. Under some conditions, we also derive an explicit control of the functional dependence of Wu (2005) which guarantees a wide range of statistical applications. Our results are illustrated with CHARN models, GARCH processes, count time series, binary choice models and categorical time series for which we provide many extensions of existing results.

Figures

Figures reproduced from arXiv: 1908.00845 by the authors.

Figure 1
Figure 1. Illustration of the convergence for N = 3 modalities and q = 1 lag When q ≥ 2, our assumptions guarantee that it is possible to get q times successively the value 1 for the time series whatever the previous values. A coalescence property for the paths will then also occur in this case. 31 [PITH_FULL_IMAGE:figures/full_fig_p031_1.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

  1. [1]

    Agosto, G

    A. Agosto, G. Cavaliere, D. Kristensen, and A. Rahbek. Modeling corporate defaults: Poisson autoregressions with exogenous covariates (parx). Journal of Empirical Finance, 38: 0 640--663, 2016

    work page 2016

  2. [2]

    D.W.K. Andrews. Non-strong mixing autoregressive processes. Journal of Applied Probability, 21 0 (4): 0 930--934, 1984

    work page 1984

  3. [3]

    Borovkov

    A.A. Borovkov. Ergodicity and stability of stochastic processes. J. Wiley, 1998

    work page 1998

  4. [4]

    Bougerol and N

    P. Bougerol and N. Picard. Strict stationarity of generalized autoregressive processes. The Annals of Probability, pages 1714--1730, 1992

    work page 1992

  5. [5]

    A. Brandt. The stochastic equation y n+ 1= a n y n+ b n with stationary coefficients. Advances in Applied Probability, 18 0 (1): 0 211--220, 1986

    work page 1986

  6. [6]

    Chamberlain

    G. Chamberlain. The general equivalence of granger and sims causality. Econometrica: Journal of the Econometric Society, pages 569--581, 1982

    work page 1982

  7. [7]

    R. A. Davis and H. Liu. Theory and inference for a class of nonlinear models with application to time series of counts. Statistica Sinica, pages 1673--1707, 2016

    work page 2016

  8. [8]

    R. M. de Jong and T. Woutersen. Dynamic time series binary choice. Econometric Theory, 27 0 (4): 0 673--702, 2011

    work page 2011

Show all 36 references
  1. [9]

    Diaconis and D

    P. Diaconis and D. Freedman. Iterated random functions. SIAM review, 41 0 (1): 0 45--76, 1999

    1999

  2. [10]

    J. L. Doob. Measure theory, volume 143. Springer Science & Business Media, 2012

    2012

  3. [11]

    P. Doukhan. Mixing: properties and examples. Number 85 in Lecture Notes in Statistics. Springer-Verlag, New York, 1994

    1994

  4. [12]

    J. H. Elton. A multiplicative ergodic theorem for lipschitz maps. Stochastic Processes and their Applications, 34 0 (1): 0 39--47, 1990

    1990

  5. [13]

    R. F. Engle, D. F. Hendry, and J-F. Richard. Exogeneity. Econometrica: Journal of the Econometric Society, pages 277--304, 1983

    1983

  6. [14]

    Fokianos and L

    K. Fokianos and L. Truquet. On categorical time series models with covariates. Stochastic processes and their applications, 129 0 (9): 0 3446--3462, 2019

    2019

  7. [15]

    Francq and L

    C. Francq and L. Q. Thieu. Qml inference for volatility models with covariates. Econometric Theory, 35 0 (1): 0 37--72, 2019

    2019

  8. [16]

    H \"a rdle and A

    W. H \"a rdle and A. Tsybakov. Local polynomial estimators of the volatility function in nonparametric autoregression. Journal of econometrics, 81 0 (1): 0 223--242, 1997

    1997

  9. [17]

    H \"a rdle, A

    W. H \"a rdle, A. Tsybakov, and L. Yang. Nonparametric vector autoregression. Journal of Statistical Planning and Inference, 68 0 (2): 0 221--245, 1998

    1998

  10. [18]

    Iosifescu

    M. Iosifescu. Iterated function systems: A critical survey. Univ., 2009

    2009

  11. [19]

    Kallenberg

    O. Kallenberg. Foundations of modern probability. Springer Science & Business Media, 2006

    2006

  12. [20]

    Kauppi and P

    H. Kauppi and P. Saikkonen. Predicting us recessions with dynamic binary response models. The Review of Economics and Statistics, 90 0 (4): 0 777--791, 2008

    2008

  13. [21]

    G. Letac. A contraction principle for certain markov chains and its applications. Contemp. Math, 50: 0 263--273, 1986

    1986

  14. [22]

    Liu and W

    W. Liu and W. B. Wu. Simultaneous nonparametric inference of time series. The Annals of Statistics, 38 0 (4): 0 2388--2421, 2010 a

    2010

  15. [23]

    Liu and W.B

    W. Liu and W.B. Wu. Asymptotics of spectral density estimates. Econometric Theory, 26 0 (4): 0 1218--1245, 2010 b

    2010

  16. [24]

    L \"u tkepohl

    H. L \"u tkepohl. New introduction to multiple time series analysis. Springer Science & Business Media, 2005

    2005

  17. [25]

    R. S. Pedersen and A. Rahbek. Testing garch-x type models. Econometric Theory, pages 1--36, 2018

    2018

  18. [26]

    Propp and D.B

    J.G. Propp and D.B. Wilson. Exact sampling with coupled markov chains and applications to statistical mechanics. Random Structures & Algorithms, 9 0 (1-2): 0 223--252, 1996

    1996

  19. [27]

    J. R. Russell and R. F. Engle. A discrete-state continuous-time model of financial transactions prices and times: The autoregressive conditional multinomial--autoregressive conditional duration model. Journal of Business & Economic Statistics, 23 0 (2): 0 166--180, 2005

    2005

  20. [28]

    C. A. Sims. Money, income, and causality. The American economic review, 62 0 (4): 0 540--552, 1972

    1972

  21. [29]

    O. Stenflo. Markov chains in random environments and random iterated function systems. Transactions of the American Mathematical Society, 353 0 (9): 0 3547--3562, 2001

    2001

  22. [30]

    O. Stenflo. A survey of average contractive iterated function systems. Journal of Difference Equations and Applications, 18 0 (8): 0 1355--1380, 2012

    2012

  23. [31]

    W. B. Wu. Nonlinear system theory: Another look at dependence. Proceedings of the National Academy of Sciences, 102 0 (40): 0 14150--14154, 2005

    2005

  24. [32]

    W. B. Wu. Strong invariance principles for dependent random variables. The Annals of Probability, 35 0 (6): 0 2294--2320, 2007

    2007

  25. [33]

    W. B. Wu and X. Shao. Limit theorems for iterated random functions. Journal of Applied Probability, 41 0 (2): 0 425--436, 2004

    2004

  26. [34]

    W. B. Wu, Y. Huang, and Y. Huang. Kernel estimation for time series: An asymptotic theory. Stochastic Processes and their Applications, 120 0 (12): 0 2412--2431, 2010

    2010

  27. [35]

    Wu and Y.N

    W.B. Wu and Y.N. Wu. Performance bounds for parameter estimates of high-dimensional linear models with correlated errors. Electronic Journal of Statistics, 10 0 (1): 0 352--379, 2016

    2016

  28. [36]

    Xiao and W

    H. Xiao and W. B. Wu. Covariance matrix estimation for stationary time series. The Annals of Statistics, 40 0 (1): 0 466--493, 2012

    2012

Pith tools

Reviewed August 14, 2026 · model on record in the stance chip above.