Related papers: Non-Markovian chains with long-range dependence an…
By proving a local limit theorem for higher-order transitions, we determine the time required for necklace chains to be close to stationarity. Because necklace chains, built by arranging identical smaller chains around a directed cycle, are…
Random walks cannot, in general, be pushed forward by quasi-isometries. Tame Markov chains were introduced as a `quasi-isometry invariant' are a generalization of random walks. In this paper, we construct several examples of tame Markov…
A Markov process fluctuating away from its typical behavior can be represented in the long-time limit by another Markov process, called the effective or driven process, having the same stationary states as the original process conditioned…
We consider a class of small-sample distribution estimators over noisy channels. Our estimators are designed for repetition channels, and rely on properties of the runs of the observed sequences. These runs are modeled via a special type of…
The main goal of this text is comprehensive study of time homogeneous Markov chains on the real line whose drift tends to zero at infinity, we call such processes Markov chains with asymptotically zero drift. Traditionally this topic is…
In this paper, we establish moment and Bernstein-type inequalities for additive functionals of geometrically ergodic Markov chains. These inequalities extend the corresponding inequalities for independent random variables. Our conditions…
This paper gives a method for computing distributions associated with patterns in the state sequence of a hidden Markov model, conditional on observing all or part of the observation sequence. Probabilities are computed for very general…
Monte Carlo (MC) simulations of transport in random porous networks indicate that for high variances of the log-normal permeability distribution, the transport of a passive tracer is non-Fickian. Here we model this non-Fickian dispersion in…
Our investigation is specially motivated by the stochastic version of a common model of potential spread in a dendritic tree. We do not assume the noise in the junction points to be Markovian. In fact, we allow for long-range dependence in…
In this work we present a modified neural network model which is capable to simulate Markov Chains. We show how to express and train such a network, how to ensure given statistical properties reflected in the training data and we…
This article considers a model for alternative processes for securities prices and compares this model with actual return data of several securities. The distributions of returns that appear in the model can be Gaussian as well as…
It is shown that the combinatorics of commutation relations is well suited for analyzing the convergence rate of certain Markov chains. Examples studied include random walk on irreducible representations, a local random walk on partitions…
When the initial and transition probabilities of a finite Markov chain in discrete time are not well known, we should perform a sensitivity analysis. This can be done by considering as basic uncertainty models the so-called credal sets that…
In the present Short Note an idea is proposed to explain the emergence and the observation of processes in complex media that are driven by fractional non-Markovian master equations. Particle trajectories are assumed to be solely Markovian…
A general theory is developed to study individual based models which are discrete in time. We begin by constructing a Markov chain model that converges to a one-dimensional map in the infinite population limit. Stochastic fluctuations are…
We consider Markov-switching regression models, i.e. models for time series regression analyses where the functional relationship between covariates and response is subject to regime switching controlled by an unobservable Markov chain.…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
The investigation of the phenomenon of dephasing assisted quantum transport, which happens when the presence of dephasing benefits the efficiency of this process, has been mainly focused on Markovian scenarios associated with constant and…
In this letter we announce rigorous results that elucidate the relation between metastable states and low-lying eigenvalues in Markov chains in a much more general setting and with considerable greater precision as was so far available.…
We study the large deviations of Markov chains under the sole assumption that the state space is discrete. In particular, we do not require any of the usual irreducibility and exponential tightness assumptions. Using subadditive arguments,…