Related papers: Asymptotic behaviour of random tridiagonal Markov …

In this note, we show that small complex perturbations of positive matrices are contractions, with respect to a complex version of the Hilbert metric, on the standard complex simplex. We show that this metric can be used to obtain estimates…

In this paper we obtain a detailed description of the global and cocycle attractors for the skew-product semiflows induced by the mild solutions of a family of scalar linear-dissipative parabolic problems over a minimal and uniquely ergodic…

Differentially positive systems are systems whose linearization along trajectories is positive. Under mild assumptions, their solutions asymptotically converge to a one-dimensional attractor, which must be a limit cycle in the absence of…

A new family of tree-structured Markov random fields for a vector of discrete counting random variables is introduced. According to the characteristics of the family, the marginal distributions of the Markov random fields are all Poisson…

It is well-known that random attractors of a random dynamical system are generally not unique. We show that for general pullback attractors and weak attractors, there is always a minimal (in the sense of smallest) random attractor which…

The asymptotic normality in multi-dimension of the nonparametric estimator of the transition probabilities of a Markov renewal chain is proved, and is applied to that of other nonparametric estimators involved with the associated…

Conditions on the generator of a Markov process to control the fluctuations of its bridges are found. In particular, continuous time random walks on graphs and gradient diffusions are considered. Under these conditions, a concentration of…

We consider a discrete-time system of n coupled random vectors, a.k.a. interacting particles. The dynamics involve a vanishing step size, some random centered perturbations, and a mean vector field which induces the coupling between the…

We describe a simple algorithm based on a Markov chain process to generate simply connected acyclic directed graphs over a fixed set of vertices. This algorithm is an extension of a previous one, designed to generate acyclic digraphs, non…

We study the long-term behavior of the distribution of the solution process to the non-autonomous McKean-Vlasov stochastic delay lattice system defined on the integer set $\mathbb{Z}$. Specifically, we first establish the well-posedness of…

We consider a simple discrete-time Markov chain with values in $[0,\infty)^{Z^d}$. The Markov chain describes various interesting examples such as oriented percolation, directed polymers in random environment, time discretizations of binary…

In this paper the attractors synthesis algorithm for a class of dissipative dynamical systems with hyperbolic equilibria, presented in [1], is applied to generate any attractor of the Rikitake system. By switching periodically, or even…

We analyze quasi-stationary distributions $\{\mu^{\varepsilon}\}_{\varepsilon>0}$ of a family of Markov chains $\{X^{\varepsilon}\}_{\varepsilon>0}$ that are random perturbations of a bounded, continuous map $F:M\to M$, where $M$ is a…

We study pullback attractors of non-autonomous non-compact dynamical systems generated by differential equations with non-autonomous deterministic as well as stochastic forcing terms. We first introduce the concepts of pullback attractors…

The emergence of noise-induced chaos in a random logistic map with bounded noise is understood as a two-step process consisting of a topological bifurcation flagged by a zero-crossing point of the supremum of the dichotomy spectrum and a…

We consider a diffusion given by a small noise perturbation of a dynamical system driven by a potential function with a finite number of local minima. The classical results of Freidlin and Wentzell show that the time this diffusion spends…

The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…

Motivated by practical concerns in cryptography, we study pseudorandomness properties of permutations on $\{0,1\}^n$ computed by random circuits made from reversible $3$-bit gates (permutations on $\{0,1\}^3$). Our main result is that a…

We consider a discrete-time Markov chain $(X^t,Y^t)$, $t=0,1,2,...$, where the $X$-component forms a Markov chain itself. Assume that $(X^t)$ is Harris-ergodic and consider an auxiliary Markov chain ${\hat{Y}^t}$ whose transition…

We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…