Searcharxiv⌕ Search

arXiv subjects

Jose Blanchet

Publications and source records attributed to Jose Blanchet.

183 records · Page 11Linked to original sources

Efficient Simulation and Conditional Functional Limit Theorems for Ruinous Heavy-tailed Random Walks

The contribution of this paper is to introduce change of measure based techniques for the rare-event analysis of heavy-tailed stochastic processes. Our changes-of-measure are parameterized by a family of distributions admitting a mixture form. We exploit our methodology to achieve two types of results. First, we construct Monte Carlo estimators that are strongly efficient (i.e. have bounded relative mean squared error as the event of interest becomes rare). These estimators are used to estimate both rare-event probabilities of interest and associated conditional expectations. We emphasize that our techniques allow us to control the expected termination time of the Monte Carlo algorithm even if the conditional expected stopping time (under the original distribution) given the event of interest is infinity -- a situation that sometimes occurs in heavy-tailed settings. Second, the mixture family serves as a good approximation (in total variation) of the conditional distribution of the whole process given the rare event of interest. The convenient form of the mixture family allows us to obtain, as a corollary, functional conditional central limit theorems that extend classical results in the literature. We illustrate our methodology in the context of the ruin probability $P(\sup_n S_n >b)$, where $S_n$ is a random walk with heavy-tailed increments that have negative drift. Our techniques are based on the use of Lyapunov inequalities for variance control and termination time. The conditional limit theorems combine the application of Lyapunov bounds with coupling arguments.

math.PR↗

Efficient rare-event simulation for the maximum of heavy-tailed random walks

Let $(X_n:n\geq 0)$ be a sequence of i.i.d. r.v.'s with negative mean. Set $S_0=0$ and define $S_n=X_1+... +X_n$. We propose an importance sampling algorithm to estimate the tail of $M=\max \{S_n:n\geq 0\}$ that is strongly efficient for both light and heavy-tailed increment distributions. Moreover, in the case of heavy-tailed increments and under additional technical assumptions, our estimator can be shown to have asymptotically vanishing relative variance in the sense that its coefficient of variation vanishes as the tail parameter increases. A key feature of our algorithm is that it is state-dependent. In the presence of light tails, our procedure leads to Siegmund's (1979) algorithm. The rigorous analysis of efficiency requires new Lyapunov-type inequalities that can be useful in the study of more general importance sampling algorithms.

math.PR↗

Complete corrected diffusion approximations for the maximum of a random walk

Consider a random walk $(S_n:n\geq0)$ with drift $-μ$ and $S_0=0$. Assuming that the increments have exponential moments, negative mean, and are strongly nonlattice, we provide a complete asymptotic expansion (in powers of $μ>0$) that corrects the diffusion approximation of the all time maximum $M=\max_{n\geq0}S_n$. Our results extend both the first-order correction of Siegmund [Adv. in Appl. Probab. 11 (1979) 701--719] and the full asymptotic expansion provided in the Gaussian case by Chang and Peres [Ann. Probab. 25 (1997) 787--802]. We also show that the Cramér--Lundberg constant (as a function of $μ$) admits an analytic extension throughout a neighborhood of the origin in the complex plane $\mathbb{C}$. Finally, when the increments of the random walk have nonnegative mean $μ$, we show that the Laplace transform, $E_μ\exp(-bR(\infty))$, of the limiting overshoot, $R(\infty)$, can be analytically extended throughout a disc centered at the origin in $\mathbb{C\times C}$ (jointly for both $b$ and $μ$). In addition, when the distribution of the increments is continuous and appropriately symmetric, we show that $E_μS_τ$ [where $τ$ is the first (strict) ascending ladder epoch] can be analytically extended to a disc centered at the origin in $\mathbb{C}$, generalizing the main result in [Ann. Probab. 25 (1997) 787--802] and extending a related result of Chang [Ann. Appl. Probab. 2 (1992) 714--738].

math.PR↗