Random attractors on countable state spaces

TL;DR

This paper investigates the synchronization of discrete-time Markov chains on countable state spaces using random dynamical systems, establishing conditions for the existence of unique random attractors and their properties.

Contribution

It introduces a framework for analyzing synchronization via random attractors, proving their existence, uniqueness, and conditions for reaching them in finite mean time.

Findings

Existence and uniqueness of a random attractor under mild conditions

Equivalence of forward and pullback attraction in this setting

A sufficient condition for finite mean time to reach the attractor

Abstract

We study the synchronization behavior of discrete-time Markov chains on countable state spaces. Representing a Markov chain in terms of a random dynamical system, which describes the collective dynamics of trajectories driven by the same noise, allows for the characterization of synchronization via random attractors. We establish the existence and uniqueness of a random attractor under mild conditions and show that forward and pullback attraction are equivalent in our setting. Additionally, we provide a sufficient condition for reaching the random attractor, or synchronization respectively, in a time of finite mean. By introducing insulated and synchronizing sets, we structure the state space with respect to the synchronization behavior and characterize the size of the random attractor.