Related papers: Complete $\omega$-Regular Supermartingale Certific…
We consider periodic Markov chains with absorption. Applying to iterates of this periodic Markov chain criteria for the exponential convergence of conditional distributions of aperiodic absorbed Markov chains, we obtain exponential…
In this work, we give sufficient conditions for the almost global asymptotic stability of a cascade in which the subsystems are only almost globally asymptotically stable. The result is extended to upper triangular systems of arbitrary…
After reviewing the behavioral studies of working memory and of the cellular substrate of the latter, we argue that metastable states constitute candidates for the type of transient information storage required by working memory. We then…
In this paper, we study the almost sure boundedness and the convergence of the stochastic approximation (SA) algorithm. At present, most available convergence proofs are based on the ODE method, and the almost sure boundedness of the…
Temporal logics for hyperproperties have recently emerged as an expressive specification technique for relational properties of reactive systems. While the model checking problem for such logics has been widely studied, there is a scarcity…
We prove an invariance principle (functional central limit theorem) for a vector-valued additive functional of a Markov chain for almost every starting point with respect to an ergodic equilibrium distribution. The hypothesis is a moment…
We define a new gauge independent quasi-local mass and energy, and show its relation to the Brown-York Hamilton-Jacobi analysis. A quasi-local proof of the positivity, based on spacetime harmonic functions, is given for admissible closed…
We study absolute-continuity properties of a class of stochastic processes, including the gamma and the Dirichlet processes. We prove that the laws of a general class of non-linear transformations of such processes are locally equivalent to…
Consider a Markov chain on an infinite tree T=(V,E) rooted at \rho. In such a chain, once the initial root state \sigma(\rho) is chosen, each vertex iteratively chooses its state from the one of its parent by an application of a Markov…
There are many evaluation strategies for term rewrite systems, but automatically proving termination or analyzing complexity is usually easiest for innermost rewriting. Several syntactic criteria exist when innermost termination implies…
A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most good properties from finite Markov chains to denumerable…
The paper presents exponentially-strong converses for source-coding, channel coding, and hypothesis testing problems. More specifically, it presents alternative proofs for the well-known exponentially-strong converse bounds for almost…
We present sufficient conditions, in terms of the jumping kernels, for two large classes of conservative Markov processes of pure-jump type to be purely discontinuous martingales with finite second moment. As an application, we establish…
We prove existence of boundary limits of ratios of positive harmonic functions for a wide class of Markov processes with jumps and irregular domains, in the context of general metric measure spaces. As a corollary, we prove uniqueness of…
The existence of global-in-time bounded martingale solutions to a general class of cross-diffusion systems with multiplicative Stratonovich noise is proved. The equations describe multicomponent systems from physics or biology with…
We provide quantitative convergence results for continuous-time dynamical systems in metric spaces that satisfy a continuous-time analog of quasi-Fej\'er monotonicity. More precisely, we provide a (strong) convergence result for such…
In the paper we prove the existence of probabilistic solutions to systems of the form $-Au=F(x,u)+\mu$, where $F$ satisfies a generalized sign condition and $\mu$ is a smooth measure. As for $A$ we assume that it is a generator of a Markov…
We establish an approximate zero-one law for sentences of continuous logic over finite metric spaces of diameter at most $1$. More precisely, we axiomatize a complete metric theory $T_{\mathrm{as}}$ such that, given any sentence $\sigma$ in…
Dynamical systems that are contracting on a subspace are said to be semicontracting. Semicontraction theory is a useful tool in the study of consensus algorithms and dynamical flow systems such as Markov chains. To develop a comprehensive…
Relaxation rates are key characteristics of quantum processes, as they determine how quickly a quantum system thermalizes, equilibrates, decoheres, and dissipates. While they play a crucial role in theoretical analyses, relaxation rates are…