Approximation conjecture for the ARMA point process by INARMA processes
Approximation conjecture for the ARMA point process by INARMA processes
Let be an ARMA point process with immigration rate and piecewise continuous intensity . For , let be i.i.d. Poisson random variables with mean , and set and . Under the summability conditions
there is a stationary integer-valued time series satisfying
Approximation conjecture. There exists such that, for every , the process above is a stationary INARMA process, and the family of point processes
for Borel sets converges weakly to as . Here weak convergence means vague convergence of the induced measures, equivalently convergence of finite-dimensional distributions. This conjecture formalizes the expected asymptotic equivalence between aggregated INARMA processes and the ARMA point process; the existence of the infinite-order INARMA process follows under the stated summability condition, while the asserted weak convergence as the bin width tends to zero is the substantive approximation claim.
Progress summary
A reader-written construction claims to refute the conjecture by making the sampled process fail to exist on arbitrarily fine meshes, but it is unverified and targets a statement removed from the final paper.
Wheatley, Schatz, and Sornette formulated the conjecture in 2018: sufficiently fine discretizations should produce stationary infinite-order INARMA processes converging to the ARMA point process. Their preprint explicitly says that a rigorous proof is beyond its scope.
Known results
- Under the stated summability conditions, the infinite-order INARMA process exists.
- The analogous INAR-to-Hawkes weak-convergence result was already known.
- Aggregated Neyman–Scott processes were reported as approximable by INMA processes.
Posted attempt
A reader-written construction chooses a smooth, integrable reproduction kernel whose point samples have divergent lattice sums for every mesh , claiming that the sampled stationary process then fails to exist and thereby refuting the original universal-small-mesh assertion. It also proposes stronger tail assumptions or cell-average coefficients as repairs. The attempt has not been independently verified, and it concerns the conjecture in the withdrawn 2018 preprint; the final 2022 article reportedly removed that integer-valued-time-series discussion.
Current status (as of August 2026): The 2018 conjecture remains unproved in the primary source, while a reader-written counterexample claim gives unverified evidence against its original formulation; the status of any repaired approximation theorem remains open.
Sources
Sources & referencesView supporting material
Primary source
Spencer Wheatley, Michael Schatz and Didier Sornette, “The ARMA Point Process and its Estimation”, arXiv:1806.09948 (2018).
Solutions 1
Sign in to submit a solution.
Source-history caveat. This conjecture appears in the 2018 preprint cited by this database entry, but was removed from the final 2022 journal article: its Appendix A4 explicitly says the discussion of integer-valued time series was removed. The counterexample below addresses the withdrawn preprint statement, not an assertion retained in the published revision. It also exposes the same erroneous sampled-subcriticality assertion in a separate 2016 published lemma.
The preprint assumes a nonnegative piecewise-continuous reproduction kernel with
and claims that the sampled INARMA process exists and is stationary for every sufficiently small mesh , using reproduction coefficients
Choose an even smooth bump with and . For integers , set
and define
The bump supports are disjoint and locally finite. Thus is nonnegative, , bounded, globally Lipschitz, and tends to zero at infinity. Indeed,
Writing , dyadic grouping gives
Consequently
and even
Take the moving-average kernel to be zero and any positive immigration rate. The continuous-time stationary point process exists by strict subcriticality.
Nevertheless, for every positive integer , take . The sampling lattice contains every integer, and . Therefore
Hence there is no stationary sampled process for any of the arbitrarily fine meshes , disproving the asserted existence of a universal sufficiently-small-mesh interval.
In fact nonexistence does not require assuming a finite stationary mean. If are the independent Poisson immigration counts, then . Since
Kolmogorov's convergence criterion gives
The offspring contributions at lags consequently have infinite total conditional Poisson intensity, so the putative finite-valued recursion is impossible almost surely.
A direct repair is to assume the stronger tail condition
It makes the lattice-sum tails uniformly small and restores
An unconditional repair requiring only integrability is to replace point samples by cell averages
Then for every mesh. Rounding the immigrant times and offspring delays in the same continuous-time branching trees gives exactly these cell-average offspring intensities; truncating after finitely many generations and using the geometric tail of the subcritical family proves vague convergence to the original point process as .
Original withdrawn conjecture: Wheatley, Schatz, and Sornette, https://arxiv.org/abs/1806.09948 . Final published revision removing it: https://doi.org/10.1016/j.ecosta.2021.11.002 , Appendix A4. The same false automatic lattice-summability step appears in Kirchner, Hawkes and INAR(∞) processes, Lemma 1, https://doi.org/10.1016/j.spa.2016.02.008 .