Near-unit-root persistence of symmetric stable autoregressive sequences
arXiv:2608.17927
Abstract
Persistence changes character as an autoregressive coefficient approaches one: for each fixed , survival above zero decays exponentially, whereas at the unit root symmetric random-walk survival is of order . We study this transition for AR() sequences driven by symmetric -stable innovations and write for their exponential persistence rate. The entire chain admits an exact representation through a single stable Lévy process observed on a geometrically expanding time grid. Comparison with continuous half-line survival gives . For , this bound disproves the stable specialization of a conjecture of Hinrichs, Kolb and Wachtel for regularly varying innovation tails. \rev{Combining stable closure under subsampling with a monotonicity coupling yields a lower bound of the same near-unit order.} This proves as and shows that the ratio converges to a limit in , equal to its supremum over . Finally, a Lamperti transformation reduces identification of this constant to a dense-sampling persistence problem for a stationary stable Ornstein--Uhlenbeck process. Existing Gaussian theory determines the sharp value at . For , identifying the value requires controlling paths that cross below zero and return above zero between consecutive observations.
AMSart style, 16 pages, 20 references. Version v2 improves the proofs of Lemmas 5.1 and 5.7 and provides additional clarification in Remark 3.6 regarding the scope of the counterexample to the HKW conjecture