Analyzing the Fine-Scale Dynamics of Two Dominant Species in a Polytrichum–Myrtillus Pine Forest. II. An Inhomogeneous Markov Chain and Averaged Indices

2019 ◽  
Vol 9 (1) ◽  
pp. 62-72 ◽  
Author(s):  
D. O. Logofet ◽  
A. A. Maslov
Author(s):  
E. A. Perepelkin ◽  

The problem of constructing a state estimation of inhomogeneous finite Markov chain based on a Luenberger observer is solved. The conditions of existence of the observer are defined. An algorithm for synthesizing the observer is described.


1977 ◽  
Vol 14 (01) ◽  
pp. 89-97 ◽  
Author(s):  
S. Chatterjee ◽  
E. Seneta

The problem of tendency to consensus in an information-exchanging operation is connected with the ergodicity problem for backwards products of stochastic matrices. For such products, weak and strong ergodicity, defined analogously to these concepts for forward products of inhomogeneous Markov chain theory, are shown (in contrast to that theory) to be equivalent. Conditions for ergodicity are derived and their relation to the consensus problem is considered.


2017 ◽  
Vol 8 (1) ◽  
pp. 19-26
Author(s):  
Yao Qi-feng ◽  
Dong Yun ◽  
Wang Zhong-Zhi

Objective: The main object of our study is to extend some entropy rate theorems to a Hidden Inhomogeneous Markov Chain (HIMC) and establish an entropy rate theorem under some mild conditions. Introduction: A hidden inhomogeneous Markov chain contains two different stochastic processes; one is an inhomogeneous Markov chain whose states are hidden and the other is a stochastic process whose states are observable. Materials and Methods: The proof of theorem requires some ergodic properties of an inhomogeneous Markov chain, and the flexible application of the properties of norm and the bounded conditions of series are also indispensable. Results: This paper presents an entropy rate theorem for an HIMC under some mild conditions and two corollaries for a hidden Markov chain and an inhomogeneous Markov chain. Conclusion: Under some mild conditions, the entropy rates of an inhomogeneous Markov chains, a hidden Markov chain and an HIMC are similar and easy to calculate.


2014 ◽  
Vol 39 (1) ◽  
pp. 93-104 ◽  
Author(s):  
Hanna Kwaśna ◽  
Helgard I. Nirenberg

The soil microfungi in two 17-year-old Scots pine forest soils were surveyed. One forest was located in Poland, and the other in Germany,300 km apart. The total number of fungal taxa detected was 55 and included 11 zygomycetes, 1 ascomycete and 43 mitosporic fungi. From the Polish and German soils, 145 and 122 isolates representing 43 and 32 fungal species, respectively, were recorded. The most common genera were <i>Penicillium</i> (25% and 44%) with 11 and 8 species, <i>Umbelopsis</i> (15% and 14%) with 2 species, <i>Oidiodendron griseum</i> (10% and 9%), <i>Mortierella</i> (8% and 3%) with 4 and 2 species, and <i>Trichodemta</i> (6% and 2%) with 3 and 2 species, in the Polish and German soils, respectively. Only 18 taxa (32.7%) were recorded in both soils. Twenty five separate taxa (45.5%) were re00rded only in the Polish, and 12 taxa (21.8%) only in the German soil. Three dominant species, with percentage > 3% in the fungal community, found in both soils were <i>Umbelopsis vinacea</i> (13.8% and 8.2%), <i>Oidiodendron griseum</i> (10.3% and 9%) and <i>Penicillium janczewskii</i> (3.4% and 11.5%). The small number of fungi shared by both soils contributes to the opinion that there is a high species diversity among the microfungi in one European Scots pine forest soil ecosystem.


1986 ◽  
Vol 18 (03) ◽  
pp. 747-771 ◽  
Author(s):  
Debasis Mitra ◽  
Fabio Romeo ◽  
Alberto Sangiovanni-Vincentelli

Simulated annealing is a randomized algorithm which has been proposed for finding globally optimum least-cost configurations in large NP-complete problems with cost functions which may have many local minima. A theoretical analysis of simulated annealing based on its precise model, a time-inhomogeneous Markov chain, is presented. An annealing schedule is given for which the Markov chain is strongly ergodic and the algorithm converges to a global optimum. The finite-time behavior of simulated annealing is also analyzed and a bound obtained on the departure of the probability distribution of the state at finite time from the optimum. This bound gives an estimate of the rate of convergence and insights into the conditions on the annealing schedule which gives optimum performance.


Sign in / Sign up

Export Citation Format

Share Document