منابع مشابه
Recurrence for Branching Markov Chains
The question of recurrence and transience of branching Markov chains is more subtle than for ordinary Markov chains; they can be classified in transience, weak recurrence, and strong recurrence. We review criteria for transience and weak recurrence and give several new conditions for weak recurrence and strong recurrence. These conditions make a unified treatment of known and new examples possi...
متن کاملSelf-similar branching Markov chains
The main purpose of this work is to study self-similar branching Markov chains. First we will construct such a process. Then we will establish certain Limit Theorems using the theory of self-similar Markov processes.
متن کاملComparative branching-time semantics for Markov chains
This paper presents various semantics in the branching-time spectrum of discrete-time and continuous-time Markov chains (DTMCs and CTMCs). Strong and weak bisimulation equivalence and simulation pre-orders are covered and are logically characterised in terms of the temporal logics PCTL and CSL. Apart from presenting various existing branching-time relations in a uniform manner, our contribution...
متن کاملAncestral lineages and limit theorems for branching Markov chains
We consider a branching model in discrete time where each individual has a trait in some general state space. Both the reproduction law and the trait inherited by the offsprings may depend on the trait of the mother and the environment. We study the long time behavior of the population and the ancestral lineage of typical individuals under general assumptions, which we specify for applications ...
متن کاملSteering policies for controlled Markov chains under a recurrence condition
To see the relation between Theorem 1 and Proposition 1, let P = 01 P , where is a positive number that satisfies (3) and P is the solution to the Lyapunov equation (4). Then, it follows from (2) that P is a solution to (5) for < k. In other words, the Riccati inequality (5) is solvable if conditions (2)–(4) are satisfied. Let ^ be the maximum value for which (5) is solvable, or equivalently, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2008
ISSN: 1083-589X
DOI: 10.1214/ecp.v13-1424