A Transient Markov Chain With Finitely Many Cutpoints
نویسندگان
چکیده
We give an example of a transient reversible Markov chain that a.s. has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer Kaimanovich’s question when the Markov chain is a nearest-neighbor random walk on a tree.
منابع مشابه
Cutpoints and resistance of random walk paths
We construct a bounded degree graph G, such that a simple random walk on it is transient but the random walk path (i.e., the subgraph of all the edges the random walk has crossed) has only finitely many cutpoints, almost surely. We also prove that the expected number of cutpoints of any transient Markov chain is infinite. This answers two questions of James, Lyons and Peres [4]. Additionally, w...
متن کاملPerturbations of the Symmetric Exclusion Process
One of the fundamental issues concerning particle systems is classifying the invariant measures I and giving properties of those measures for different processes. For the exclusion process with symmetric kernel p(x, y) = p(y, x), I has been completely studied. This paper gives results concerning I for exclusion processes where p(x, y) = p(y, x) except for finitely many x, y ∈ S and p(x, y) corr...
متن کاملOptimal Control for Partially Observable Markov Decision Processes over an Infinite Horizon
In this paper we consider an optimal control problem for partially observable Markov decision processes with finite states, signals and actions OVE,r an infinite horizon. It is shown that there are €optimal piecewise·linear value functions and piecl~wise-constant policies which are simple. Simple means that there are only finitely many pieces, each of which is defined on a convex polyhedral set...
متن کاملLogarithmic Asymptotics for the GI/G/1-type Markov Chains and their Applications to the BMAP/G/1 Queue with Vacations
We study tail asymptotics of the stationary distribution for the GI=G=1-type Markov chain with finitely many background states. Decay rate in the logarithmic sense is identified under a number of conditions on the transition probabilities. The results are applied to the BMAP=G=1 queuewith vacations. The relationship between vacation time and the decay rate of the queue length distribution is in...
متن کاملMarkov processes of infinitely many nonintersecting random walks
Consider an N -dimensional Markov chain obtained from N onedimensional random walks by Doob h-transform with the q-Vandermonde determinant. We prove that as N becomes large, these Markov chains converge to an infinite-dimensional Feller Markov process. The dynamical correlation functions of the limit process are determinantal with an explicit correlation kernel. The key idea is to identify rand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007