We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We consider the operation of an insurer with a large initial surplus x>0. The insurer's surplus process S(t) (with S(0)=x) evolves in the range S(t)≥ 0 as a generalized renewal process with positive mean drift and with jumps at time epochs T1,T2,…. At the time Tη(x) when the process S(t) first becomes negative, the insurer's ruin (in the ‘classical’ sense) occurs, but the insurer can borrow money via a line of credit. After this moment the process S(t) behaves as a solution to a certain stochastic differential equation which, in general, depends on the indebtedness, -S(t). This behavior of S(t) lasts until the time θ(x,y) at which the indebtedness reaches some ‘critical’ level y>0. At this moment the line of credit will be closed and the insurer's absolute ruin occurs with deficit -S(θ(x,y)). We find the asymptotics of the absolute ruin probability and the limiting distributions of η(x), θ(x,y), and -S(θ(x,y)) as x → ∞, assuming that the claim distribution is regularly varying. The second-order approximation to the absolute ruin probability is also obtained. The abovementioned results are obtained by using limiting theorems for the joint distribution of η(x) and -S(Tη(x)).
Motivated by Feller's coin-tossing problem, we consider the problem of conditioning an irreducible Markov chain never to wait too long at 0. Denoting by τ the first time that the chain, X, waits for at least one unit of time at the origin, we consider conditioning the chain on the event (τ›T). We show that there is a weak limit as T→∞ in the cases where either the state space is finite or X is transient. We give sufficient conditions for the existence of a weak limit in other cases and show that we have vague convergence to a defective limit if the time to hit zero has a lighter tail than τ and τ is subexponential.
We investigate the almost sure asymptotic properties of vector martingale transforms. Assuming some appropriate regularity conditions both on the increasing process and on the moments of the martingale, we prove that normalized moments of any even order converge in the almost sure central limit theorem for martingales. A conjecture about almost sure upper bounds under wider hypotheses is formulated. The theoretical results are supported by examples borrowed from statistical applications, including linear autoregressive models and branching processes with immigration, for which new asymptotic properties are established on estimation and prediction errors.
Classical results for exchangeable systems of random variables are extended to multiclass systems satisfying a natural partial exchangeability assumption. It is proved that the conditional law of a finite multiclass system, given the value of the vector of the empirical measures of its classes, corresponds to independent uniform orderings of the samples within {each} class, and that a family of such systems converges in law {if and only if} the corresponding empirical measure vectors converge in law. As a corollary, convergence within {each} class to an infinite independent and identically distributed system implies asymptotic independence between {different} classes. A result implying the Hewitt-Savage 0-1 law is also extended.
In this paper we present a stability criterion for processor-sharing queues, in which the throughput may depend on the number of customers in the system (such as in the case of interferences between users). Such a system is represented by a point measure-valued stochastic recursion keeping track of the remaining processing times of the customers.
For a spectrally negative Lévy process X on the real line, let S denote its supremum process and let I denote its infimum process. For a > 0, let τ(a) and κ(a) denote the times when the reflected processes Ŷ := S − X and Y := X − I first exit level a, respectively; let τ−(a) and κ−(a) denote the times when X first reaches Sτ(a) and Iκ(a), respectively. The main results of this paper concern the distributions of (τ(a), Sτ(a), τ−(a), Ŷτ(a)) and of (κ(a), Iκ(a), κ−(a)). They generalize some recent results on spectrally negative Lévy processes. Our approach relies on results concerning the solution to the two-sided exit problem for X. Such an approach is also adapted to study the excursions for the reflected processes. More explicit expressions are obtained when X is either a Brownian motion with drift or a completely asymmetric stable process.
We consider a two-color, randomly reinforced urn with equal reinforcement distributions and we characterize the distribution of the urn's limit proportion as the unique continuous solution of a functional equation involving unknown probability distributions on [0, 1].
Suppose we are given the free product V of a finite family of finite or countable sets (Vi)i∈∮ and probability measures on each Vi, which govern random walks on it. We consider a transient random walk on the free product arising naturally from the random walks on the Vi. We prove the existence of the rate of escape with respect to the block length, that is, the speed at which the random walk escapes to infinity, and furthermore we compute formulae for it. For this purpose, we present three different techniques providing three different, equivalent formulae.
In this paper we propose a new method of determining the stability of queueing systems. We attain it using the absorbing process and introduce the untraceable events method to show the existence of the absorbing process. The advantage of our method is that we are able to discuss the stability of various variables for both discrete and continuous parameters in a general framework with nonstationary input. An untraceable event has the property that the state loses the memory of its origin. In a concrete model, we use the boundedness of the state at an epoch in time with respect to the initial condition and choose the form of the untraceable event corresponding to the input distribution.
A more general definition of MTP2 (multivariate total positivity of order 2) probability measure is given, without assuming the existence of a density. Under this definition the class of MTP2 measures is proved to be closed under weak convergence. Characterizations of the MTP2 property are proved under this more general definition. Then a precise definition of conditionally increasing measure is provided, and closure under weak convergence of the class of conditionally increasing measures is proved. As an application we investigate MTP2 properties of stationary distributions of Markov chains, which are of interest in actuarial science.
Let (Xt)t≥0 be a continuous-time irreducible Markov chain on a finite state space E, let v: E→ℝ\{0}, and let (φt)t≥0 be defined by φt=∫0tv(Xs)d s. We consider the case in which the process (φt)t≥0 is oscillating and that in which (φt)t≥0 has a negative drift. In each of these cases, we condition the process (Xt,φt)t≥0 on the event that (φt)t≥0 hits level y before hitting 0 and prove weak convergence of the conditioned process as y→∞. In addition, we show the relationship between the conditioning of the process (φt)t≥0 with a negative drift to oscillate and the conditioning of it to stay nonnegative for a long time, and the relationship between the conditioning of (φt)t≥0 with a negative drift to drift to ∞ and the conditioning of it to hit large levels before hitting 0.
Let (Xt)t≥0 be a continuous-time irreducible Markov chain on a finite state space E, let v be a map v: E→ℝ\{0}, and let (φt)t≥0 be an additive functional defined by φt=∫0tv(Xs)d s. We consider the case in which the process (φt)t≥0 is oscillating and that in which (φt)t≥0 has a negative drift. In each of these cases, we condition the process (Xt,φt)t≥0 on the event that (φt)t≥0 is nonnegative until time T and prove weak convergence of the conditioned process as T→∞.
In this paper, we introduce the minimum dynamic discrimination information (MDDI) approach to probability modeling. The MDDI model relative to a given distribution G is that which has least Kullback-Leibler information discrepancy relative to G, among all distributions satisfying some information constraints given in terms of residual moment inequalities, residual moment growth inequalities, or hazard rate growth inequalities. Our results lead to MDDI characterizations of many well-known lifetime models and to the development of some new models. Dynamic information constraints that characterize these models are tabulated. A result for characterizing distributions based on dynamic Rényi information divergence is also given.
We consider a two-sided exit problem for a Lévy process with no positive jumps. The Laplace transform of the time when the process first exits an interval from above is obtained. It is expressed in terms of another Laplace transform for the one-sided exit problem. Applications of this result are discussed. In particular, a new expression for the solution to the two-sided exit problem is obtained. The joint distribution of the minimum and the maximum values of such a Lévy process is also studied.
A formal approach to produce a model for the data-generating distribution based on partial knowledge is the well-known maximum entropy method. In this approach, partial knowledge about the data-generating distribution is formulated in terms of some information constraints and the model is obtained by maximizing the Shannon entropy under these constraints. Frequently, in reliability analysis the problem of interest is the lifetime beyond an age t. In such cases, the distribution of interest for computing uncertainty and information is the residual distribution. The information functions involving a residual life distribution depend on t, and hence are dynamic. The maximum dynamic entropy (MDE) model is the distribution with the density that maximizes the dynamic entropy for all t. We provide a result that relates the orderings of dynamic entropy and the hazard function for distributions with monotone densities. Applications include dynamic entropy ordering within some parametric families of distributions, orderings of distributions of lifetimes of systems and their components connected in series and parallel, record values, and formulation of constraints for the MDE model in terms of the evolution paths of the hazard function and mean residual lifetime function. In particular, we identify classes of distributions in which some well-known distributions, including the mixture of two exponential distributions and the mixture of two Pareto distributions, are the MDE models.
Let Β1, Β2 be a pair of Banach spaces and T be a vector valued martingale transform (with respect to general filtration) which maps Β1-valued martingales into Β2-valued martingales. Then, the following statements are equivalent: T is bounded from into for some p (or equivalently for every p) in the range 1 < p < ∞; T is bounded from into BMOB2; T is bounded from BMOB1 into BMOB2; T is bounded from into . Applications to UMD and martingale cotype properties are given. We also prove that the Hardy space defined in the case of a general filtration has nice dense sets and nice atomic decompositions if and only if Β has the Radon-Nikodým property.
An optimal coupling is a bivariate distribution with specified marginals achieving maximal correlation. We show that optimal couplings are totally positive and, in fact, satisfy a strictly stronger condition we call the nonintersection property. For discrete distributions we illustrate the equivalence between optimal coupling and a certain transportation problem. Specifically, the optimal solutions of greedily-solvable transportation problems are totally positive, and even nonintersecting, through a rearrangement of matrix entries that results in a Monge sequence. In coupling continuous random variables or random vectors, we exploit a characterization of optimal couplings in terms of subgradients of a closed convex function to establish a generalization of the nonintersection property. We argue that nonintersection is not only stronger than total positivity, it is the more natural concept for the singular distributions that arise in coupling continuous random variables.
We analyse the limit behaviour of a stochastic structured metapopulation model as the number of its patches goes to infinity. The sequence of probability measures associated with the random process, whose components are the proportions of patches with different number of individuals, is tight. The limit of every convergent subsequence satisfies an infinite system of ordinary differential equations. The existence and the uniqueness of the solution are shown by semigroup methods, so that the whole random process converges weakly to the solution of the system.
This work is devoted to asymptotic properties of singularly perturbed Markov chains in discrete time. The motivation stems from applications in discrete-time control and optimization problems, manufacturing and production planning, stochastic networks, and communication systems, in which finite-state Markov chains are used to model large-scale and complex systems. To reduce the complexity of the underlying system, the states in each recurrent class are aggregated into a single state. Although the aggregated process may not be Markovian, its continuous-time interpolation converges to a continuous-time Markov chain whose generator is a function determined by the invariant measures of the recurrent states. Sequences of occupation measures are defined. A mean square estimate on a sequence of unscaled occupation measures is obtained. Furthermore, it is proved that a suitably scaled sequence of occupation measures converges to a switching diffusion.
Generalizing the standard frailty models of survival analysis, we propose to model frailty as a weighted Lévy process. Hence, the frailty of an individual is not a fixed quantity, but develops over time. Formulae for the population hazard and survival functions are derived. The power variance function Lévy process is a prominent example. In many cases, notably for compound Poisson processes, quasi-stationary distributions of survivors may arise. Quasi-stationarity implies limiting population hazard rates that are constant, in spite of the continual increase of the individual hazards. A brief discussion is given of the biological relevance of this finding.