منابع مشابه
Continuous Time Markov Processes on Graphs
We study continuous time Markov processes on graphs. The notion of frequency is introduced, which serves well as a scaling factor between any Markov time of a continuous time Markov process and that of its jump chain. As an application, we study “multi-person simple random walks” on a graph G with n vertices. There are n persons distributed randomly at the vertices of G. In each step of this di...
متن کاملTutorial on Structured Continuous-Time Markov Processes
A continuous-time Markov process (CTMP) is a collection of variables indexed by a continuous quantity, time. It obeys the Markov property that the distribution over a future variable is independent of past variables given the state at the present time. We introduce continuous-time Markov process representations and algorithms for filtering, smoothing, expected sufficient statistics calculations...
متن کاملMarkov Processes on Time-like Graphs
We study Markov processes where the “time” parameter is replaced by paths in a directed graph from an initial vertex to a terminal one. Along each directed path the process is Markov and has the same distribution as the one along any other directed path. If two directed paths do not interact, in a suitable sense, then the distributions of the processes on the two paths are conditionally indepen...
متن کاملContinuous time Markov decision processes
In this paper, we consider denumerable state continuous time Markov decision processes with (possibly unbounded) transition and cost rates under average criterion. We present a set of conditions and prove the existence of both average cost optimal stationary policies and a solution of the average optimality equation under the conditions. The results in this paper are applied to an admission con...
متن کاملSolving Structured Continuous-Time Markov Decision Processes
We present an approach to solving structured continuous-time Markov decision processes. We approximate the the optimal value function by a compact linear form, resulting in a linear program. The main difficulty arises from the number of constraints that grow exponentially with the number of variables in the system. We exploit the representation of continuous-time Bayesian networks (CTBNs) to de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Analysis and Applications
سال: 2006
ISSN: 0736-2994,1532-9356
DOI: 10.1080/07362990600870017