This article is devoted to the investigation of limit theorems for mixed max-sum processes with renewal type stopping indexes. Limit theorems of weak convergence type are obtained as well as functional limit theorems.
Suppose that i.i.d. random variables $X_{1}, X_{2}, \ldots$ are chosen uniformly from $[0,1]$, and let $f: [0,1] \rightarrow [0,1]$ be an increasing bijection. Define $μ_{f}$ to be the expected value of $f(X_{i})$ for each $i$. Define the random variable $K_{f}$ be to be minimal so that $\sum_{i = 1}^{K_{f}} f(X_{i}) > t$ and let $N_{f}(t)$ be the expected value of $K_{f}$. We prove that if $c_{f} = \frac{\int_{0}^{1} \int_{f^{-1}(u)}^{1} (f(x)-u) dx du}{μ_{f}}$, then $N_{f}(t) = \frac{t+c_{f}}{μ_{f}}+o(1)$. This generalizes a result of Ćurgus and Jewett (2007) on the case $f(x) = x$.
We study subexponential tail asymptotics for the distribution of the maximum $M_t:=\sup_{u\in[0,t]}X_u$ of a process $X_t$ with negative drift for the entire range of $t>0$. We consider compound renewal processes with linear drift and Lévy processes. For both we also formulate and prove the principle of a single big jump for their maxima. The class of compound renewal processes particularly includes Cramér-Lundberg risk process.
On discrete-time arrival processes and related random motions
Politecnico di Torino(都灵理工大学);Sorbonne Université, CNRS, Institut Jean Le Rond d’Alembert(索邦大学,法国国家科学研究中心,让·勒朗·达朗贝尔研究所);University of Torino(都灵大学);Universidad Nacional de Colombia(哥伦比亚国立大学)
Given a matrix of distribution functions and a quasi-stochastic matrix, i.e. an irreducible nonnegative matrix with maximal eigenvalue one and associated unique positive left and right eigenvectors, the article studies the properties of an associated matrix renewal measure and a related integral equation. Unlike earlier work this is done by a purely probabilistic approach based on a simple harmonic transform. Main results include Markov renewal-type theorems and a Stone-type decomposition under an absolute continuity condition. Three applications are given at the end of the paper.
The article describes the limiting distribution of the extremes of observations that arrive in clusters. We start by studying the tail behaviour of an individual cluster and then we apply the developed theory to determine the limiting distribution of $\max\{X_j: j=0,\ldots, K(t)\}$, where $K(t)$ is the number of i.i.d. observations $(X_j)$ arriving up to the time $t$ according to a general marked renewal cluster process. The results are illustrated in the context of some commonly used Poisson cluster models such as the marked Hawkes process.
We study optimal stopping problems related to the pricing of perpetual American options in an extension of the Black-Merton-Scholes model in which the dividend and volatility rates of the underlying risky asset depend on the running values of its maximum and maximum drawdown. The optimal stopping times of exercise are shown to be the first times at which the price of the underlying asset exits some regions restricted by certain boundaries depending on the running values of the associated maximum and maximum drawdown processes. We obtain closed-form solutions to the equivalent free-boundary pro…
We extend Goldie's (1991) Implicit Renewal Theorem to enable the analysis of recursions on weighted branching trees. We illustrate the developed method by deriving the power tail asymptotics of the distributions of the solutions R to: R =_D sum_{i=1}^N C_i R_i + Q, R =_D max(max_{i=1}^N C_i R_i, Q), and similar recursions, where (Q, N, C_1,..., C_N) is a nonnegative random vector with N in {0, 1, 2, 3, ..., infinity}, and {R_i}_{i >= 1} are iid copies of R, independent of (Q, N, C_1,..., C_N); =_D denotes the equality in distribution.
This note considers a variation of the full-information secretary problem where the random variables to be observed are independent and identically distributed. Consider $X_1,\dots,X_n$ to be an independent sequence of random variables, let $M_n:=\max\{X_1,\dots,X_n\}$, and the objective is to select the maximum of the sequence. What is the maximum probability of "stopping at the maximum"? That is, what is the stopping time $τ$ adapted to $X_1,...,X_n$ that maximizes $P(X_τ=M_n)$? This problem was examined by Gilbert and Mosteller \cite{GilMost} when in addition the common distribution is cont…
In the literature on optimal stopping, the problem of maximizing the expected discounted reward over all stopping times has been explicitly solved for some special reward functions (including $(x^+)^ν$, $(e^x-K)^+$, $(K-e^{-x})^+$, $x\in\mathbb{R}$, $ν\in(0,\infty)$ and $K>0$) under general random walks in discrete time and Lévy processes in continuous time (subject to mild integrability conditions). All of such reward functions are continuous, increasing and logconcave while the corresponding optimal stopping times are of threshold type (i.e. the solutions are one-sided). In this paper, we sh…
In this paper, we develop new optional stopping theorems for scenarios where the stopping rules are defined by bounded continuity regions. Moreover, we establish a wide variety of inequalities on the supremums and infimums of functions of stochastic processes over the whole range of time indexes.
The optimal stopping problem for a Hunt processes on $\R$ is considered via the representation theory of excessive functions. In particular, we focus on infinite horizon (or perpetual) problems with one-sided structure, that is, there exists a point $x^*$ such that the stopping region is of the form $[x^*,+\infty)$. Corresponding results for two-sided problems are also indicated. The main result is a spectral representation of the value function in terms of the Green kernel of the process. Specializing in Lévy processes, we obtain, by applying the Wiener-Hopf factorization, a general represent…
This article treats both discrete time and continuous time stopping problems for general Markov processes on the real line with general linear costs. Using an auxiliary function of maximum representation type, conditions are given to guarantee the optimal stopping time to be of threshold type. The optimal threshold is then characterized as the root of that function. For random walks our results condense in the fact that all combinations of concave increasing pay-off functions and convex cost functions lead to a one-sided solution. For Lévy processes an explicit way to obtain the auxiliary func…
Previous authors have considered optimal stopping problems driven by the running maximum of a spectrally negative Lévy process $X$, as well as of a one-dimensional diffusion. Many of the aforementioned results are either implicitly or explicitly dependent on Peskir's maximality principle. In this article, we are interested in understanding how some of the main ideas from these previous works can be brought into the setting of problems driven by the maximum of a class of Markov additive processes (more precisely Markov modulated Lévy processes). Similarly to previous works in the Lévy setting, …
We consider the optimal stopping problem consisting in, given a strong Markov process, a reward function and a discount rate, finding the stopping time such that the expected reward at the stopping time is maximum. The approach we follow, has two main components: the Dynkin's characterization of the value function as the smallest excessive function dominating the reward; and the Riesz representation of excessive functions in terms of the Green kernel, the main reference being Salminen 85. In the context of one-dimensional diffusions we give a complete characterization of the solution under som…
We consider a zero-sum continuous time stopping game in which the pay-off is revealed in the maximum of the two stopping times instead of the minimum, which is the case in Dynkin games.
We consider renewal processes where events, which can for instance be the zero crossings of a stochastic process, occur at random epochs of time. The intervals of time between events, $τ_{1},τ_{2},...$, are independent and identically distributed (i.i.d.) random variables with a common density $ρ(τ)$. Fixing the total observation time to $t$ induces a global constraint on the sum of these random intervals, which accordingly become interdependent. Here we focus on the largest interval among such a sequence on the fixed time interval $(0,t)$. Depending on how the last interval is treated, we con…
We study the statistics of infima, stopping times and passage probabilities of entropy production in nonequilibrium steady states, and show that they are universal. We consider two examples of stopping times: first-passage times of entropy production and waiting times of stochastic processes, which are the times when a system reaches for the first time a given state. Our main results are: (i) the distribution of the global infimum of entropy production is exponential with mean equal to minus Boltzmann's constant; (ii) we find the exact expressions for the passage probabilities of entropy produ…
A Dynkin game is a zero-sum, stochastic stopping game between two players where either player can stop the game at any time for an observable payoff. Typically the payoff process of the max-player is assumed to be smaller than the payoff process of the min-player, while the payoff process for simultaneous stopping is in between the two. In this paper, we study general Dynkin games whose payoff processes are in arbitrary positions. In both discrete and continuous time settings, we provide necessary and sufficient conditions for the existence of pure strategy Nash equilibria and epsilon-optimal …