Hitting times of Markov chains, with application to state-dependent queues
نویسندگان
چکیده
منابع مشابه
Merge Times and Hitting Times of Time-inhomogeneous Markov Chains
The purpose of this thesis is to study the long term behavior of time-inhomogeneous Markov chains. We analyze under what conditions they converge, in what sense they converge and what the rate of convergence should be. A Markov chain is a random process with the memoryless property: the next state only depends on the current state, and not on the sequence of events that preceded it. Time-inhomo...
متن کاملTight Inequalities among Set Hitting times in Markov Chains
Given an irreducible discrete-time Markov chain on a finite state space, we consider the largest expected hitting time T (α) of a set of stationary measure at least α for α ∈ (0, 1). We obtain tight inequalities among the values of T (α) for different choices of α. One consequence is that T (α) ≤ T (1/2)/α for all α < 1/2. As a corollary we have that, if the chain is lazy in a certain sense as ...
متن کاملMixing and hitting times for finite Markov chains
Let 0 < α < 1/2. We show that that the mixing time of a continuous-time Markov chain on a finite state space is about as large as the largest expected hitting time of a subset of the state space with stationary measure ≥ α. Suitably modified results hold in discrete time and/or without the reversibility assumption. The key technical tool in the proof is the construction of random set A such tha...
متن کاملStopped Markov chains with stationary occupation times
Let E be a nite set equipped with a group G of bijective transformations and suppose that X is an irreducible Markov chain on E that is equivariant under the action of G. In particular, if E = G with the corresponding transformations being left or right multiplication, then X is a random walk on G. We show that when X is started at a xed point there is a stopping time U such that the distributi...
متن کاملDecentralized Search on Spheres Using Small-world Markov Chains: Expected Hitting times and Structural Properties
We build a family of Markov chains on a sphere using distance-based long-range connection probabilities to model the decentralized message-passing problem that has recently gained significant attention in the small-world literature. Starting at an arbitrary source point on the sphere, the expected message delivery time to an arbitrary target on the sphere is characterized by a particular expect...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1977
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700025508