相关论文: Exact Simulation of the Extrema of Stable Processe…
In this paper, we introduce a slight variation of the Dominated Coupling From the Past algorithm (DCFTP) of Kendall, for bounded Markov chains. It is based on the control of a (typically non-monotonic) stochastic recursion by a (typically…
We construct a fast exact algorithm for the simulation of the first-passage time, jointly with the undershoot and overshoot, of a tempered stable subordinator over an arbitrary non-increasing absolutely continuous function. We prove that…
Using marked Dirichlet processes we characterise the law of the convex minorant of the meander for a certain class of L\'evy processes, which includes subordinated stable and symmetric L\'evy processes. We apply this characterisaiton to…
Determinantal point processes (DPP) serve as a practicable modeling for many applications of repulsive point processes. A known approach for simulation was proposed in \cite{Hough(2006)}, which generate the desired distribution point wise…
We develop a novel Monte Carlo algorithm for the vector consisting of the supremum, the time at which the supremum is attained and the position at a given (constant) time of an exponentially tempered L\'evy process. The algorithm, based on…
Max-stable processes play an important role as models for spatial extreme events. Their complex structure as the pointwise maximum over an infinite number of random functions makes simulation highly nontrivial. Algorithms based on finite…
We develop a novel approximate simulation algorithm for the joint law of the position, the running supremum and the time of the supremum of a general L\'evy process at an arbitrary finite time. We identify the law of the error in simple…
We describe a new algorithm for the perfect simulation of variable length Markov chains and random systems with perfect connections. This algorithm, which generalizes Propp and Wilson's simulation scheme, is based on the idea of coupling…
We consider perfect simulation algorithms for locally stable point processes based on dominated coupling from the past. A version of the algorithm is developed which is feasible for processes which are neither purely attractive nor purely…
We present the first class of perfect sampling (also known as exact simulation) algorithms for the steady-state distribution of non-Markovian loss networks. We use a variation of Dominated Coupling From The Past for which we simulate a…
Stable distributions are a celebrated class of probability laws used in various fields. The $\alpha$-stable process, and its exponentially tempered counterpart, the Classical Tempered Stable (CTS) process, are also prominent examples of…
We show that any application of the technique of unbiased simulation becomes perfect simulation when coalescence of the two coupled Markov chains can be practically assured in advance. This happens when a fixed number of iterations is high…
In this note we propose an exact simulation algorithm for the solution of dX_t=dW_t+b(X_t)dt (1) where b is a smooth real function except at point 0 where b(0+)\neq b(0-). The main idea is to sample an exact skeleton of X using an algorithm…
In this paper, we propose a method to solve discrete-time peak computation problems (DPCPs for short). DPCPs are optimization problems that consist of maximizing a function over the reachable values set of a discrete-time dynamical system.…
We present a perfect simulation algorithm for stationary processes indexed by Z, with summable memory decay. Depending on the decay, we construct the process on finite or semi-infinite intervals, explicitly from an i.i.d. uniform sequence.…
Being the max-analogue of $\alpha$-stable stochastic processes, max-stable processes form one of the fundamental classes of stochastic processes. With the arrival of sufficient computational capabilities, they have become a benchmark in the…
We develop the first exact and computationally tractable method for simulating from tempered stable distributions in the infinite variation case, which corresponds to $\alpha\in[1,2)$. A small simulation study shows that the approach works…
This paper provides an exact simulation algorithm for the sampling from the joint law of the first-passage time, the undershoot and the overshoot of a subordinator crossing a non-increasing boundary. We prove that the running time of this…
For L\'evy processes with exponentially decaying tails of the L\'evy density, we derive integral representations for the joint cpdf $V$ of $(X_T, \bar X_T,\tau_T)$ (the process, its supremum evaluated at $T<+\infty$, and the first time at…
We develop a practical approach to establish the stability, that is, the recurrence in a given set, of a large class of controlled Markov chains. These processes arise in various areas of applied science and encompass important numerical…