Ergodicity of Random Walks on Random DFA
نویسنده
چکیده
Given a DFA we consider the random walk that starts at the initial state and at each time step moves to a new state by taking a random transition from the current state. This paper shows that for typical DFA this random walk induces an ergodic Markov chain. The notion of typical DFA is formalized by showing that ergodicity holds with high probability when a DFA is sampled uniformly at random from the set of all automata with a fixed number of states. We also show the same result applies to DFA obtained by minimizing typical DFA.
منابع مشابه
Recurrence and ergodicity of random walks on linear groups and on homogeneous spaces
We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many linear groups over local fields supports a recurrent random walk if and only if it has at most quadratic growth. We give also a detailed analysis of ergodicity p...
متن کاملOn the speed of Random Walks among Random Conductances
We consider random walk among random conductances where the conductance environment is shift invariant and ergodic. We study which moment conditions of the conductances guarantee speed zero of the random walk. We show that if there exists α > 1 such that E[log ωe] < ∞, then the random walk has speed zero. On the other hand, for each α < 1 we provide examples of random walks with non-zero speed ...
متن کاملRandom walks in random environment on trees and multiplicative chaos 1
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random environment. A related problem, with only one type of vertices and quite stringent conditions on the transition probabilities but on general trees has been conside...
متن کاملQuenched invariance principle for random walks in balanced random environment
We consider random walks in a balanced random environment in Z , d ≥ 2. We first prove an invariance principle (for d ≥ 2) and the transience of the random walks when d ≥ 3 (recurrence when d = 2) in an ergodic environment which is not uniformly elliptic but satisfies certain moment condition. Then, using percolation arguments, we show that under mere ellipticity, the above results hold for ran...
متن کاملTransient random walks on a strip in a random environment
We consider transient random walks on a strip in a random environment. The model was introduced by Bolthausen and Goldsheid in [4]. We derive a strong law of large numbers for the random walks in a general ergodic setup and obtain an annealed central limit theorem in the case of uniformly mixing environments. In addition, we prove that the law of the “environment viewed from the position of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1311.6830 شماره
صفحات -
تاریخ انتشار 2013