In this paper we derive the exact asymptotics of the probability of Parisian ruin for self-similar Gaussian risk processes. Additionally, we obtain the normal approximation of the Parisian ruin time and derive an asymptotic relation between the Parisian and the classical ruin times.

We provide explicit expressions for the constants involved in the characterisation of ergodicity of subgeometric Markov chains. The constants are determined in terms of those appearing in the assumed drift and one-step minorisation conditions. The results are fundamental for the study of some algorithms where uniform bounds for these constants are needed for a family of Markov kernels. Our results accommodate also some classes of inhomogeneous chains.

We introduce a notion of kth order stochastic monotonicity and duality that allows us to unify the notion used in insurance mathematics (sometimes refereed to as Siegmund's duality) for the study of ruin probability and the duality responsible for the so-called put-call symmetries in option pricing. Our general kth order duality can be interpreted financially as put-call symmetry for powered options. The main objective of this paper is to develop an effective analytic approach to the analysis of duality that will lead to the full characterization of kth order duality of Markov processes in terms of their generators, which is new even for the well-studied case of put-call symmetries.

In this paper we consider an M/M/c queue modified to allow both mass arrivals when the system is empty and the workload to be removed. Properties of queues which terminate when the server becomes idle are firstly developed. Recurrence properties, equilibrium distribution, and equilibrium queue-size structure are studied for the case of resurrection and no mass exodus. All of these results are then generalized to allow for the removal of the entire workload. In particular, we obtain the Laplace transformation of the transition probability for the absorptive M/M/c queue.

Let Xλ1, Xλ2, …, Xλn be independent Weibull random variables with Xλi ∼ W(α, λi), where λi > 0 for i = 1, …, n. Let Xn:nλ denote the lifetime of the parallel system formed from Xλ1, Xλ2, …, Xλn. We investigate the effect of the changes in the scale parameters (λ1, …, λn) on the magnitude of Xn:nλ according to reverse hazard rate and likelihood ratio orderings.

Kuroda and Nagai (2002) stated that the factor process in risk-sensitive control asset management is stable under the Föllmer-Schweizer minimal martingale measure. Fleming and Sheu (2002) and, more recently, Föllmer and Schweizer (2010) observed that the role of the minimal martingale measure in this portfolio optimization is yet to be established. In this paper we aim to address this question by explicitly connecting the optimal wealth allocation to the minimal martingale measure. We achieve this by using a ‘trick’ of observing this problem in the context of model uncertainty via a two person zero sum stochastic differential game between the investor and an antagonistic market that provides a probability measure. We obtain some startling insights. Firstly, if short selling is not permitted and the factor process evolves under the minimal martingale measure, then the investor's optimal strategy can only be to invest in the riskless asset (i.e. the no-regret strategy). Secondly, if the factor process and the stock price process have independent noise, then, even if the market allows short-selling, the optimal strategy for the investor must be the no-regret strategy while the factor process will evolve under the minimal martingale measure.

The Ginibre point process (GPP) is one of the main examples of determinantal point processes on the complex plane. It is a recurring distribution of random matrix theory as well as a useful model in applied mathematics. In this paper we briefly overview the usual methods for the simulation of the GPP. Then we introduce a modified version of the GPP which constitutes a determinantal point process more suited for certain applications, and we detail its simulation. This modified GPP has the property of having a fixed number of points and having its support on a compact subset of the plane. See Decreusefond et al. (2013) for an extended version of this paper.

In this paper we study a generalized coupon collector problem, which consists of determining the distribution and the moments of the time needed to collect a given number of distinct coupons that are drawn from a set of coupons with an arbitrary probability distribution. We suppose that a special coupon called the null coupon can be drawn but never belongs to any collection. In this context, we obtain expressions for the distribution and the moments of this time. We also prove that the almost-uniform distribution, for which all the nonnull coupons have the same drawing probability, is the distribution which minimizes the expected time to obtain a fixed subset of distinct coupons. This optimization result is extended to the complementary distribution of the time needed to obtain the full collection, proving by the way this well-known conjecture. Finally, we propose a new conjecture which expresses the fact that the almost-uniform distribution should minimize the complementary distribution of the time needed to obtain any fixed number of distinct coupons.

This paper concerns discrete-time Markov decision chains with denumerable state and compact action sets. Besides standard continuity requirements, the main assumption on the model is that it admits a Lyapunov function ℓ. In this context the average reward criterion is analyzed from the sample-path point of view. The main conclusion is that if the expected average reward associated to ℓ2 is finite under any policy then a stationary policy obtained from the optimality equation in the standard way is sample-path average optimal in a strong sense.

We consider semicoherent and mixed systems with exchangeable components. We present sharp lower and upper bounds on various dispersion measures (in particular, variance and median absolute deviation) of the system lifetime, expressed in terms of the system signature and the dispersion of a single component lifetime. We construct joint exchangeable distributions of component lifetimes with two-point marginals which attain the bounds in the limit.

Superposition is a mapping on point configurations that sends the n-tuple into the n-point configuration , counted with multiplicity. It is an additive set operation such that the superposition of a k-point configuration in is a kn-point configuration in . A Poisson superposition process is the superposition in of a Poisson process in the space of finite-length -valued sequences. From properties of Poisson processes as well as some algebraic properties of formal power series, we obtain an explicit expression for the Janossy measure of Poisson superposition processes, and we study their law under domain restriction. Examples of well-known Poisson superposition processes include compound Poisson, negative binomial, and permanental (boson) processes.

In a defaultable market, an investor trades having only partial information about the behavior of the market. Taking into account the intraday stock movements, the risky asset prices are modelled by marked point processes. Their dynamics depend on an unobservable process, representing the amount of news reaching the market. This is a marked point process, which may have common jump times with the risky asset price processes. The problem of hedging a defaultable claim is studied. In order to discuss all these topics, in this paper we examine stochastic control problems using backward stochastic differential equations (BSDEs) and filtering techniques. The goal of this paper is to construct a sequence of functions converging to the value function, each of these is the unique solution of a suitable BSDE.

In this paper we apply the recently established Wiener-Hopf Monte Carlo simulation technique for Lévy processes from Kuznetsov et al. (2011) to path functionals; in particular, first passage times, overshoots, undershoots, and the last maximum before the passage time. Such functionals have many applications, for instance, in finance (the pricing of exotic options in a Lévy model) and insurance (ruin time, debt at ruin, and related quantities for a Lévy insurance risk process). The technique works for any Lévy process whose running infimum and supremum evaluated at an independent exponential time can be sampled from. This includes classic examples such as stable processes, subclasses of spectrally one-sided Lévy processes, and large new families such as meromorphic Lévy processes. Finally, we present some examples. A particular aspect that is illustrated is that the Wiener-Hopf Monte Carlo simulation technique (provided that it applies) performs much better at approximating first passage times than a ‘plain’ Monte Carlo simulation technique based on sampling increments of the Lévy process.

We propose a method to generate a max-stable process in C[0, 1] from a max-stable random vector in Rd by generalizing the max-linear model established by Wang and Stoev (2011). For this purpose, an interpolation technique that preserves max-stability is proposed. It turns out that if the random vector follows some finite-dimensional distribution of some initial max-stable process, the approximating processes converge uniformly to the original process and the pointwise mean-squared error can be represented in a closed form. The obtained results carry over to the case of generalized Pareto processes. The introduced method enables the reconstruction of the initial process only from a finite set of observation points and, thus, a reasonable prediction of max-stable processes in space becomes possible. A possible extension to arbitrary dimensions is outlined.

This paper deals with the first passage optimality and variance minimisation problems of discrete-time Markov decision processes (MDPs) with varying discount factors and unbounded rewards/costs. First, under suitable conditions slightly weaker than those in the previous literature on the standard (infinite horizon) discounted MDPs, we establish the existence and characterisation of the first passage expected-optimal stationary policies. Second, to further distinguish the expected-optimal stationary policies, we introduce the variance minimisation problem, prove that it is equivalent to a new first passage optimality problem of MDPs, and, thus, show the existence of a variance-optimal policy that minimises the variance over the set of all first passage expected-optimal stationary policies. Finally, we use a computable example to illustrate our main results and also to show the difference between the first passage optimality here and the standard discount optimality of MDPs in the previous literature.

In this paper we consider point processes Nf (t), t > 0, with independent increments and integer-valued jumps whose distribution is expressed in terms of Bernštein functions f with Lévy measure v. We obtain the general expression of the probability generating functions Gf of Nf, the equations governing the state probabilities pkf of Nf, and their corresponding explicit forms. We also give the distribution of the first-passage times Tkf of Nf, and the related governing equation. We study in detail the cases of the fractional Poisson process, the relativistic Poisson process, and the gamma-Poisson process whose state probabilities have the form of a negative binomial. The distribution of the times of jumps with height lj () under the condition N(t) = k for all these special processes is investigated in detail.

We present some correlated fractional counting processes on a finite-time interval. This will be done by considering a slight generalization of the processes in Borges et al. (2012). The main case concerns a class of space-time fractional Poisson processes and, when the correlation parameter is equal to 0, the univariate distributions coincide with those of the space-time fractional Poisson process in Orsingher and Polito (2012). On the one hand, when we consider the time fractional Poisson process, the multivariate finite-dimensional distributions are different from those presented for the renewal process in Politi et al. (2011). We also consider a case concerning a class of fractional negative binomial processes.

In this paper we consider a class of stochastic processes based on binomial observations of continuous-time, Markovian population models. We derive the conditional probability mass function of the next binomial observation given a set of binomial observations. For this purpose, we first find the conditional probability mass function of the underlying continuous-time Markovian population model, given a set of binomial observations, by exploiting a conditional Bayes' theorem from filtering, and then use the law of total probability to find the former. This result paves the way for further study of the stochastic process introduced by the binomial observations. We utilize our results to show that binomial observations of the simple birth process are non-Markovian.

In this paper we propose the asymptotic error distributions of the Euler scheme for a stochastic differential equation driven by Itô semimartingales. Jacod (2004) studied this problem for stochastic differential equations driven by pure jump Lévy processes and obtained quite sharp results. We extend his results to a more general pure jump Itô semimartingale.

We take a fresh look at the classical problem of runs in a sequence of independent and identically distributed coin tosses and derive a general identity/recursion which can be used to compute (joint) distributions of functionals of run types. This generalizes and unifies already existing approaches. We give several examples, derive asymptotics, and pose some further questions.