A Decomposable Branching Process in a Markovian Environment
نویسندگان
چکیده
منابع مشابه
A decomposable branching process in a Markovian environment
A population has two types of individuals, each occupying an island. One of those, where individuals of type 1 live, offers a variable environment. Type 2 individuals dwell on the other island, in a constant environment. Only one-way migration (1 → 2) is possible. We study the asymptotics of the survival probability in critical and subcritical cases.
متن کاملProbabilistic Branching in Markovian Process Algebras
We introduce immediate transitions as an extension of Stochastic Process Algebras (SPA). We distinguish two diierent classes of immediate transitions: probabilistic branching and management activities. We discuss both approaches and develop a theory for the probabilistic branching case. Although we use TIPP as a sample language within this paper, the theory can easily be adapted to other Stocha...
متن کاملA Partially Observable Markovian Maintenance Process with Continuous Cost Functions
In this paper a two-state Markovian maintenance process where the true state is unknown will be considered. The operating cost per period is a continuous random variable which depends on the state of the process. If investigation cost is incurred at the beginning of any period, the system wit I be returned to the "in-control" state instantaneously. This problem is solved using the average crite...
متن کاملSudden Extinction of a Critical Branching Process in Random Environment
Abstract. Let T be the extinction moment of a critical branching process Z = (Zn, n ≥ 0) in a random environment specified by iid probability generating functions. We study the asymptotic behavior of the probability of extinction of the process Z at moment n → ∞, and show that if the logarithm of the (random) expectation of the offspring number belongs to the domain of attraction of a non-gauss...
متن کاملProperties of Markovian Subgraphs of a Decomposable Graph
We explore the properties of subgraphs (called Markovian subgraphs) of a decomposable graph under some conditions. For a decomposable graph G and a collection γ of its Markovian subgraphs, we show that the set χ(G) of the intersections of all the neighboring cliques of G contains ∪g∈γχ(g). We also show that χ(G) = ∪g∈γχ(g) holds for a certain type of G which we call a maximal Markovian supergra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Stochastic Analysis
سال: 2012
ISSN: 2090-3332,2090-3340
DOI: 10.1155/2012/694285