Tutorial

We now proceed to a special case that (i) encompasses a number of well-known examples, including context-free string rewriting, and (ii) leads to PTIME computability, by reducing

For deriving such bounds, we use well known results on stochastic majorization of Markov chains and the Rogers-Pitman’s lumpability criterion.. The proposed method of comparison

Analogously to the theory of perfect, amicable, and sociable numbers, one can define from the operator s the concepts of amicable pair and sociable group of chains.. In this paper

We have proposed and analyzed a QMC method for the simulation of discrete- time Markov chains on a multi-dimensional state space.. The method simulates several copies of the chain

The mapping h with c = 1 can be based on a space-filling curve: Wächter and Keller [2008] use a Lebesgue Z-curve and mention others; Gerber and Chopin [2015] use a Hilbert curve

A class of iterated function systems with adapted pie- cewise constant transition probabilisties: asymptotic stability and hausdorff dimension of the invariant measure. Submitted

In this section, we exhibit several examples of Markov chains satisfying H (p) (for different norms) for which one can prove a lower bound for the deviation probability of

However, under the above conditions, Theorem 1 ensures that with high probability there is a unique stationary distribution and the walk exhibits uniform cutoff at time (log