This dissertation presents a theoretical study of arbitrary discretizations of general nonequilibrium and non-steady-state systems. It will be shown that, without requiring the partitions of the phase-space to fulfill certain assumptions, such as culminating in Markovian partitions, a Markov chain can be constructed which has the same macro-change of probability of the occupation of the states as the original process. This is true for any classical and semiclassical system under any discrete or continuous, deterministic or stochastic, Markovian or non-Markovian dynamics. Restricted to classical and semi-classical systems, a formalism is developed which treats the projection of arbitrary (multidimensional) complex systems onto a discrete set...
AbstractThe projection of a continuous space process to a discrete space process via the transition ...
A new computationally simple, speedy and accurate method is proposed to construct first-passage-time...
In this thesis, we present an algorithm to transform a subset of generalized semi-Markov processes i...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
International audienceWe review recent theoretical works that enable the accurate evaluation of the ...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
We derive a very general expression of the survival probability and the first passage time distrib...
We derive a very general expression of the survival probability and the first passage time distrib...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
AbstractThe projection of a continuous space process to a discrete space process via the transition ...
A new computationally simple, speedy and accurate method is proposed to construct first-passage-time...
In this thesis, we present an algorithm to transform a subset of generalized semi-Markov processes i...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
The first-passage time, defined as the time a random walker takes to reach a target point in a confi...
International audienceWe review recent theoretical works that enable the accurate evaluation of the ...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
We review recent theoretical works that enable the accurate evaluation of the mean first passage tim...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
Abstract We introduce the exit time finite state projection (ETFSP) scheme, a truncation-based meth...
We derive a very general expression of the survival probability and the first passage time distrib...
We derive a very general expression of the survival probability and the first passage time distrib...
The transition mechanism of jump processes between two different subsets in state space reveals impo...
AbstractThe projection of a continuous space process to a discrete space process via the transition ...
A new computationally simple, speedy and accurate method is proposed to construct first-passage-time...
In this thesis, we present an algorithm to transform a subset of generalized semi-Markov processes i...