Approximation conjecture for the ARMA point process by INARMA processes

Let NN be an ARMA point process with immigration rate bcbc and piecewise continuous intensity c6c6. For c3>0c3>0, let (b5i)iZ(b5_i)_{i\in\mathbb Z} be i.i.d. Poisson random variables with mean bcΔbc\Delta, and set θ~k=Δθ(kΔ)\widetilde{\theta}_k=\Delta\theta(k\Delta) and ϕ~j=Δϕ(jΔ)\widetilde{\phi}_j=\Delta\phi(j\Delta). Under the summability conditions

k=1θ~k<,j=1ϕ~j<1,\sum_{k=1}^{\infty}\widetilde{\theta}_k<\infty,\qquad \sum_{j=1}^{\infty}\widetilde{\phi}_j<1,

there is a stationary integer-valued time series X(Δ)X^{(\Delta)} satisfying

Xl(Δ)=ϵl+k=1θ~kϵlk+j=1ϕ~jXlj(Δ),lZ.X_{l}^{(\Delta)}=\epsilon_{l}+\sum_{k=1}^{\infty}\widetilde{\theta}_{k}\circ\epsilon_{l-k}+\sum_{j=1}^{\infty}\widetilde{\phi}_{j}\circ X_{l-j}^{(\Delta)},\qquad l\in\mathbb Z.

Approximation conjecture. There exists δ(0,)\delta\in(0,\infty) such that, for every Δ(0,δ)\Delta\in(0,\delta), the process above is a stationary INARMA process, and the family of point processes

NΔ(A)=n ⁣:nΔAXnΔN^\Delta(A)=\sum_{n\colon n\Delta\in A}X_n^\Delta

for Borel sets ARA\subseteq\mathbb R converges weakly to NN as Δ0\Delta\rightarrow0. 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

Solved

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 Δ=1/m\Delta=1/m, 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

Counterexample

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 ϕ\phi with

0ϕ(t)dt<1\int_0^\infty\phi(t)\,dt<1

and claims that the sampled INARMA process exists and is stationary for every sufficiently small mesh Δ>0\Delta>0, using reproduction coefficients

ϕ~j=Δϕ(jΔ).\widetilde\phi_j=\Delta\phi(j\Delta).

Choose an even smooth bump ψCc((1,1))\psi\in C_c^\infty((-1,1)) with 0ψ10\le\psi\le1 and ψ(0)=1\psi(0)=1. For integers n2n\ge2, set

r(n)=log2n,an=12r(n)(r(n)+1),wn=an16,r(n)=\lfloor\log_2n\rfloor,\qquad a_n=\frac1{2^{r(n)}(r(n)+1)}, \qquad w_n=\frac{a_n}{16},

and define

ϕ(t)=n=2anψ(tnwn).(1)\phi(t) =\sum_{n=2}^\infty a_n\psi\left(\frac{t-n}{w_n}\right). \tag{1}

The bump supports are disjoint and locally finite. Thus ϕ\phi is nonnegative, CC^\infty, bounded, globally Lipschitz, and tends to zero at infinity. Indeed,

ϕ16ψ.\|\phi'\|_\infty \le16\|\psi'\|_\infty.

Writing J=11ψ(u)du2J=\int_{-1}^1\psi(u)\,du\le2, dyadic grouping gives

n=2r2r+11an=1r+1,n=2r2r+11an2=12r(r+1)2.\sum_{n=2^r}^{2^{r+1}-1}a_n =\frac1{r+1}, \qquad \sum_{n=2^r}^{2^{r+1}-1}a_n^2 =\frac1{2^r(r+1)^2}.

Consequently

0ϕ(t)dt=J16r=112r(r+1)2<18<1,\int_0^\infty\phi(t)\,dt =\frac J{16} \sum_{r=1}^\infty\frac1{2^r(r+1)^2} <\frac18<1,

and even

0tϕ(t)dt<.\int_0^\infty t\phi(t)\,dt<\infty.

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 mm, take Δ=1/m\Delta=1/m. The sampling lattice contains every integer, and ϕ(n)=an\phi(n)=a_n. Therefore

j1Δϕ(jΔ)1mn=2an=1mr=11r+1=.(2)\sum_{j\ge1}\Delta\phi(j\Delta) \ge \frac1m\sum_{n=2}^\infty a_n = \frac1m\sum_{r=1}^\infty\frac1{r+1} =\infty. \tag{2}

Hence there is no stationary sampled process for any of the arbitrarily fine meshes Δ=1/m\Delta=1/m, disproving the asserted existence of a universal sufficiently-small-mesh interval.

In fact nonexistence does not require assuming a finite stationary mean. If ϵi\epsilon_i are the independent Poisson immigration counts, then XiϵiX_i\ge\epsilon_i. Since

nan=,nan2<,\sum_na_n=\infty, \qquad \sum_na_n^2<\infty,

Kolmogorov's convergence criterion gives

n2anϵmn=almost surely.\sum_{n\ge2}a_n\epsilon_{-mn}=\infty \quad\text{almost surely}.

The offspring contributions at lags mnmn 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

k0supt[k,k+1]ϕ(t)<.\sum_{k\ge0} \sup_{t\in[k,k+1]}\phi(t)<\infty.

It makes the lattice-sum tails uniformly small and restores

Δj1ϕ(jΔ)0ϕ(t)dt.\Delta\sum_{j\ge1}\phi(j\Delta) \longrightarrow\int_0^\infty\phi(t)\,dt.

An unconditional repair requiring only integrability is to replace point samples by cell averages

ϕ^j(Δ)=(j1)ΔjΔϕ(t)dt.\widehat\phi_j(\Delta) =\int_{(j-1)\Delta}^{j\Delta}\phi(t)\,dt.

Then jϕ^j=ϕ<1\sum_j\widehat\phi_j=\int\phi<1 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 Δ0\Delta\downarrow0.

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 .

0 endorsements
Shivam Patel ·