The saddlepoint approximation factors over sample paths of recursively compounded processes

Abstract

This paper presents an identity between the multivariate and univariate saddlepoint approximations applied to sample path probabilities for a certain class of stochastic processes. This class, which we term the recursively compounded processes, includes branching processes and other models featuring sums of a random number of i.i.d. terms; and compound Poisson processes and other L\'evy processes in which the additive parameter is itself chosen randomly. For such processes, fX1,…c,XN | X0=x0(x1,…,xN) = Πn=1N fXn | X0=x0,…,Xn-1=xn-1(xn), where the left-hand side is a multivariate saddlepoint approximation applied to the random vector (X1,…,XN) and the right-hand side is a product of univariate saddlepoint approximations applied to the conditional one-step distributions given the past. Two proofs are given. The first proof is analytic, based on a change-of-variables identity linking the functions that arise in the respective saddlepoint approximations. The second proof is probabilistic, based on a representation of the saddlepoint approximation in terms of tilted distributions, changes of measure, and relative entropies.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…