Related papers: Imprecise Markov Semigroups and their Ergodicity
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…
In this article, we establish weighted strong and weak type inequalities for non-commutative square functions that naturally arise in the analysis of differences between ball averages and martingale sequences within the framework of group…
The stability analysis of possibly time varying positive semigroups on non necessarily compact state spaces, including Neumann and Dirichlet boundary conditions is a notoriously difficult subject. These crucial questions arise in a variety…
We define a class of not necessarily linear $C_0$-semigroups $(P_t)_{t\geq0}$ on $C_b(E)$ (more generally, on $C_\kappa(E):=\frac1\kappa C_b(E)$, for some bounded function $\kappa$, which is the pointwise limit of a decreasing sequence of…
Semi-Markov processes generalize Markov processes by adding temporal memory effects as expressed by a semi-Markov kernel. We recall the path weight for a semi-Markov trajectory and the fact that thermodynamic consistency in equilibrium…
We consider the problem of performing inference with imprecise continuous-time hidden Markov chains, that is, imprecise continuous-time Markov chains that are augmented with random output variables whose distribution depends on the hidden…
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…
We give a notion of boundary pair $(\mathcal{B}_-,\mathcal{B}_+)$ for measured groupoids which generalizes the one introduced by Bader and Furman \cite{BF14} for locally compact groups. In the case of a semidirect groupoid…
In this work we provide performance guarantees for hypocoercive non-reversible MCMC samplers $X_t$ with invariant measure $\mu_*$; our results apply in particular to the Langevin equation, Hamiltonian Monte-Carlo, and the bouncy particle…
We derive general bounds on the probability that the empirical first-passage time $\overline{\tau}_n\equiv \sum_{i=1}^n\tau_i/n$ of a reversible ergodic Markov process inferred from a sample of $n$ independent realizations deviates from the…
Let $X:=(X_t)_{t\geq 0}$ be an ergodic Markov process on $\real^d$, and $p>0$. We derive upper bounds of the $p$-Wasserstein distance between the invariant measure and the empirical measures of the Markov process $X$. For this we assume,…
We study the limit behaviour of upper and lower bounds on expected time averages in imprecise Markov chains; a generalised type of Markov chain where the local dynamics, traditionally characterised by transition probabilities, are now…
These notes expand upon our lectures on {\em profinite rigidity} at the international colloquium on randomness, geometry and dynamics, organised by TIFR Mumbai at IISER Pune in January 2024. We are interested in the extent to which groups…
The Markov group conjecture, a long-standing open problem in the theory of Markov processes with countable state space, asserts that a strongly continuous Markov semigroup $T = (T_t)_{t \in [0,\infty)}$ on $\ell^1$ has bounded generator if…
We obtain a partial converse of Vershik's description of ergodic probability measures on a compact metric space with respect to an isometric action by an inductively compact group. This allows us to identify, in this setting, the set of…
The classical Birkhoff ergodic theorem states that for an ergodic Markov process the limiting behaviour of the time average of a function (having finite $p$-th moment, $p\ge1$, with respect to the invariant measure) along the trajectories…
We investigate the well-posedness and long-time behavior of a general continuum neural field model with Gaussian noise on possibly unbounded domains. In particular, we give conditions for the existence of invariant probability measures by…
We consider the problem of approximating the reachability probabilities in Markov decision processes (MDP) with uncountable (continuous) state and action spaces. While there are algorithms that, for special classes of such MDP, provide a…
Discrete time random dynamical systems with countably many maps which admit countable Markov partitions on complete metric spaces such that the resulting Markov systems are uniform continuous and contractive are considered. A notion of a…
We study inhomogeneous continuous-time weakly ergodic Markov chains with a finite state space. We introduce the notion of a Markov chain with the regular structure of an infinitesimal matrix and study the sharp upper bounds on the rate of…