The structure of extremal processes

1973 ◽  
Vol 5 (2) ◽  
pp. 287-307 ◽  
Author(s):  
Sidney I. Resnick ◽  
Michael Rubinovitch

An extremal-F process {Y (t); t ≧ 0} is defined as the continuous time analogue of sample sequences of maxima of i.i.d. r.v.'s distributed like F in the same way that processes with stationary independent increments (s.i.i.) are the continuous time analogue of sample sums of i.i.d. r.v.'s with an infinitely divisible distribution. Extremal-F processes are stochastically continuous Markov jump processes which traverse the interval of concentration of F. Most extremal processes of interest are broad sense equivalent to the largest positive jump of a suitable s.i.i. process and this together with known results from the theory of record values enables one to conclude that the number of jumps of Y (t) in (t1, t2] follows a Poisson distribution with parameter log t2/t1. The time transformation t→ et gives a new jump process whose jumps occur according to a homogeneous Poisson process of rate 1. This fact leads to information about the jump times and the inter-jump times. When F is an extreme value distribution the Y-process has special properties. The most important is that if F(x) = exp {—e–x} then Y(t) has an additive structure. This structure plus non parametric techniques permit a variety of conclusions about the limiting behaviour of Y(t) and its jump times.

1973 ◽  
Vol 5 (02) ◽  
pp. 287-307 ◽  
Author(s):  
Sidney I. Resnick ◽  
Michael Rubinovitch

An extremal-Fprocess {Y(t);t≧ 0} is defined as the continuous time analogue of sample sequences of maxima of i.i.d. r.v.'s distributed likeFin the same way that processes with stationary independent increments (s.i.i.) are the continuous time analogue of sample sums of i.i.d. r.v.'s with an infinitely divisible distribution. Extremal-F processes are stochastically continuous Markov jump processes which traverse the interval of concentration ofF.Most extremal processes of interest are broad sense equivalent to the largest positive jump of a suitable s.i.i. process and this together with known results from the theory of record values enables one to conclude that the number of jumps ofY(t) in (t1,t2] follows a Poisson distribution with parameter logt2/t1. The time transformationt→etgives a new jump process whose jumps occur according to a homogeneous Poisson process of rate 1. This fact leads to information about the jump times and the inter-jump times. WhenFis an extreme value distribution theY-process has special properties. The most important is that ifF(x) = exp {—e–x} thenY(t) has an additive structure. This structure plus non parametric techniques permit a variety of conclusions about the limiting behaviour ofY(t) and its jump times.


2013 ◽  
Vol 150 (1) ◽  
pp. 181-203 ◽  
Author(s):  
Paolo Muratore-Ginanneschi ◽  
Carlos Mejía-Monasterio ◽  
Luca Peliti

2014 ◽  
Vol 51 (3) ◽  
pp. 741-755
Author(s):  
Adam W. Grace ◽  
Dirk P. Kroese ◽  
Werner Sandmann

Many complex systems can be modeled via Markov jump processes. Applications include chemical reactions, population dynamics, and telecommunication networks. Rare-event estimation for such models can be difficult and is often computationally expensive, because typically many (or very long) paths of the Markov jump process need to be simulated in order to observe the rare event. We present a state-dependent importance sampling approach to this problem that is adaptive and uses Markov chain Monte Carlo to sample from the zero-variance importance sampling distribution. The method is applicable to a wide range of Markov jump processes and achieves high accuracy, while requiring only a small sample to obtain the importance parameters. We demonstrate its efficiency through benchmark examples in queueing theory and stochastic chemical kinetics.


1973 ◽  
Vol 10 (03) ◽  
pp. 543-555 ◽  
Author(s):  
R. W. Shorrock

First, asymptotic results for inter-record times when the CDF of the underlying IID process is not necessarily continuous are obtained, by a stochastic order argument, from known results for the continuous case. Then the asymptotic behaviour of the bivariate process of upper-record values and inter-record times is studied. Finally, assuming continuity of the underlying CDF, we derive the law of the process of total times spent in sets of states, viewing upper record values as states and inter-record times as times spent in a state, the process so viewed being a discrete time continuous state Markov jump process. The possible relevance of this result to single lane road traffic flow is indicated.


2014 ◽  
Vol 51 (03) ◽  
pp. 741-755
Author(s):  
Adam W. Grace ◽  
Dirk P. Kroese ◽  
Werner Sandmann

Many complex systems can be modeled via Markov jump processes. Applications include chemical reactions, population dynamics, and telecommunication networks. Rare-event estimation for such models can be difficult and is often computationally expensive, because typically many (or very long) paths of the Markov jump process need to be simulated in order to observe the rare event. We present a state-dependent importance sampling approach to this problem that is adaptive and uses Markov chain Monte Carlo to sample from the zero-variance importance sampling distribution. The method is applicable to a wide range of Markov jump processes and achieves high accuracy, while requiring only a small sample to obtain the importance parameters. We demonstrate its efficiency through benchmark examples in queueing theory and stochastic chemical kinetics.


2021 ◽  
Vol 31 (5) ◽  
Author(s):  
Yu Luo ◽  
David A. Stephens

AbstractWe consider the modeling of data generated by a latent continuous-time Markov jump process with a state space of finite but unknown dimensions. Typically in such models, the number of states has to be pre-specified, and Bayesian inference for a fixed number of states has not been studied until recently. In addition, although approaches to address the problem for discrete-time models have been developed, no method has been successfully implemented for the continuous-time case. We focus on reversible jump Markov chain Monte Carlo which allows the trans-dimensional move among different numbers of states in order to perform Bayesian inference for the unknown number of states. Specifically, we propose an efficient split-combine move which can facilitate the exploration of the parameter space, and demonstrate that it can be implemented effectively at scale. Subsequently, we extend this algorithm to the context of model-based clustering, allowing numbers of states and clusters both determined during the analysis. The model formulation, inference methodology, and associated algorithm are illustrated by simulation studies. Finally, we apply this method to real data from a Canadian healthcare system in Quebec.


1974 ◽  
Vol 6 (3) ◽  
pp. 580-592 ◽  
Author(s):  
R. W. Shorrock

Upper record values and times and inter-record times are studied in their rôles as embedded structures in discrete time extremal processes. Various continuous time approximations to the discrete-time processes are analysed, especially as processes over their state spaces. Discrete time processes, suitably normalized after crossing a threshold T, are shown to converge to limiting continuous time processes as T → ∞ under suitable assumptions on the underlying CDF F, for example, when 1 — F varies regularly at ∞, and more generally. Discrete time extremal processes viewed as processes over their state spaces are noted to have an interesting interpretation in terms of processes of population growth.


Sign in / Sign up

Export Citation Format

Share Document