Related papers: Markov-chain approach to a process with long-time …
Let W be the number of points in (0,t] of a stationary finite-state Markov renewal point process. We derive a bound for the total variation distance between the distribution of W and a compound Poisson distribution. For any nonnegative…
The problem of appropriately matching items subject to compatibility constraints arises in a number of important applications. While most of the literature on matching theory focuses on a static setting with a fixed number of items, several…
The systematic development of Coarse-Grained (CG) models via the Mori-Zwanzig projector operator formalism requires the explicit description of several terms, including a deterministic drift term, a dissipative memory term and a random…
Memory effects can be studied through a conditional past-future correlation, which measures departure with respect to a conditional past-future independence valid in a memoryless Markovian regime. In a quantum regime this property leads to…
To make progress in understanding the issue of memory loss and history dependence in evolving complex systems, we consider the mixing rate that specifies how fast the future states become independent of the initial condition. We propose a…
The embedding problem of Markov transition matrices into continuous-time Markov semigroups is a classic problem that regained a lot of impetus and activities in recent years. We consider it here for the following generalisation of the…
We study the long-time behaviour of a class of piecewise-deterministic Markov processes which are an extension of some recent works. These $d$-dimensional processes, d>=1, can especially be used to model the motion of a bacterium in…
This article describes an accurate procedure for computing the mean first passage times of a finite irreducible Markov chain and a Markov renewal process. The method is a refinement to the Kohlas, Zeit fur Oper Res, 30,197-207, (1986)…
In this research the technology of complex Markov chains is applied to predict financial time series. The main distinction of complex or high-order Markov Chains and simple first-order ones is the existing of aftereffect or memory. The…
Memory is the fundamental form of temporal complexity: when present but uncontrollable, it manifests as non-Markovian noise; conversely, if controllable, memory can be a powerful resource for information processing. Memory effects arise…
We present an approximate analytical expression for the escape rate of time-dependent driven stochastic processes with an absorbing boundary such as the driven leaky integrate-and-fire model for neural spiking. The novel approximation is…
In this study, a new extension of the Markov Renewal theory is introduced by allowing time to evolve in multiple dimensions. The resulting chains are referred to as multi-time Markov Renewal chains and since this extension is new, the state…
The origin of the long-range memory in the non-equilibrium systems is still an open problem as the phenomenon can be reproduced using models based on Markov processes. In these cases a notion of spurious memory is introduced. A good example…
Stationary ergodic processes with finite alphabets are estimated by finite memory processes from a sample, an n-length realization of the process, where the memory depth of the estimator process is also estimated from the sample using…
The so-called Maryland model is a linear version of the quantum kicked rotor; it exhibits Anderson localization in momentum space. By turning the kicks into a Markovian stochastic process, the dynamics becomes a dissipative quantum process…
We point out, according to the principle of entropy growth, that the volume occupied by the system in the momentum space should expand during the first-order phase transition. Such an expansion is visualized by the simulation using the…
There is a well-established theory linking certain semi-Markov chains and continuous-time random walks to time-fractional equations and anomalous diffusion. In this work, we go beyond the semi-Markov framework by considering some…
Stochastic phenomena occurring within charged particle beams can be handled using the Vlasov-Fokker-Planck generalization of the Vlasov equation. In particular, this non-deterministic approach can deal with effects due to Coulomb scattering…
In this work, we will investigate a Bayesian approach to estimating the parameters of long memory models. Long memory, characterized by the phenomenon of hyperbolic autocorrelation decay in time series, has garnered significant attention.…
Consider a finite number of balls initially placed in $L$ bins. At each time step a ball is taken from each non-empty bin. Then all the balls are uniformly reassigned into bins. This finite Markov chain is called Repeated Balls-into-Bins…