0000000000368127
AUTHOR
Samuel Herrmann
showing 6 related works from this author
Statistics of transitions for Markov chains with periodic forcing
2013
The influence of a time-periodic forcing on stochastic processes can essentially be emphasized in the large time behaviour of their paths. The statistics of transition in a simple Markov chain model permits to quantify this influence. In particular the first Floquet multiplier of the associated generating function can be explicitly computed and related to the equilibrium probability measure of an associated process in higher dimension. An application to the stochastic resonance is presented.
Self-stabilizing processes: uniqueness problem for stationary measures and convergence rate in the small-noise limit
2011
In the context of self-stabilizing processes, that is processes attracted by their own law, living in a potential landscape, we investigate different properties of the invariant measures. The interaction between the process and its law leads to nonlinear stochastic differential equations. In [S. Herrmann and J. Tugaut. Electron. J. Probab. 15 (2010) 2087–2116], the authors proved that, for linear interaction and under suitable conditions, there exists a unique symmetric limit measure associated to the set of invariant measures in the small-noise limit. The aim of this study is essentially to point out that this statement leads to the existence, as the noise intensity is small, of one unique…
Approximation of exit times for one-dimensional linear diffusion processes
2020
International audience; In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and the Ornstein-Uhlenbeck context, that is for particular time-homogeneous diffusion processes. Here the aim is therefore to generalize this efficient numerical approach in order to obtain an approximation of both the exit time and position for a general linear diffusion. The main challenge of such a generalization is to handle with time-inhomogeneous diffusions. The efficiency of the method is described with particular care through theoretical results and numerical example…
Exact simulation of first exit times for one-dimensional diffusion processes
2019
International audience; The simulation of exit times for diffusion processes is a challenging task since it concerns many applications in different fields like mathematical finance, neuroscience, reliability horizontal ellipsis The usual procedure is to use discretization schemes which unfortunately introduce some error in the target distribution. Our aim is to present a new algorithm which simulates exactly the exit time for one-dimensional diffusions. This acceptance-rejection algorithm requires to simulate exactly the exit time of the Brownian motion on one side and the Brownian position at a given time, constrained not to have exit before, on the other side. Crucial tools in this study …
Persistent random walks, variable length Markov chains and piecewise deterministic Markov processes *
2013
A classical random walk $(S_t, t\in\mathbb{N})$ is defined by $S_t:=\displaystyle\sum_{n=0}^t X_n$, where $(X_n)$ are i.i.d. When the increments $(X_n)_{n\in\mathbb{N}}$ are a one-order Markov chain, a short memory is introduced in the dynamics of $(S_t)$. This so-called "persistent" random walk is nolonger Markovian and, under suitable conditions, the rescaled process converges towards the integrated telegraph noise (ITN) as the time-scale and space-scale parameters tend to zero (see Herrmann and Vallois, 2010; Tapiero-Vallois, Tapiero-Vallois2}). The ITN process is effectively non-Markovian too. The aim is to consider persistent random walks $(S_t)$ whose increments are Markov chains with…
Exact simulation of diffusion first exit times: algorithm acceleration
2020
In order to describe or estimate different quantities related to a specific random variable, it is of prime interest to numerically generate such a variate. In specific situations, the exact generation of random variables might be either momentarily unavailable or too expensive in terms of computation time. It therefore needs to be replaced by an approximation procedure. As was previously the case, the ambitious exact simulation of exit times for diffusion processes was unreachable though it concerns many applications in different fields like mathematical finance, neuroscience or reliability. The usual way to describe exit times was to use discretization schemes, that are of course approxim…