2012
DOI: 10.1016/j.aml.2012.06.001
|View full text |Cite
|
Sign up to set email alerts
|

Relative entropy and discrete Poincaré inequalities for reducible matrices

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2013
2013
2015
2015

Publication Types

Select...
3

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 8 publications
0
2
0
Order By: Relevance
“…The general theory explicitly describing behaviour of systems with reducible transition matrices seems to be hard to achieve due to a complicated internal structure they may have, see, e.g. [7]. However, in the structured population models considered here, we only consider matrices C that describe migration and, as mentioned before, the principle of conservation of the total population yields that they are Kolmogorov matrices.…”
Section: The Migration Matrixmentioning
confidence: 99%
“…The general theory explicitly describing behaviour of systems with reducible transition matrices seems to be hard to achieve due to a complicated internal structure they may have, see, e.g. [7]. However, in the structured population models considered here, we only consider matrices C that describe migration and, as mentioned before, the principle of conservation of the total population yields that they are Kolmogorov matrices.…”
Section: The Migration Matrixmentioning
confidence: 99%
“…Furthermore, if l ≥ m + 1, then in each column at least one of the matrices A general theory explicitly describing behaviour of systems with reducible ML matrices seems to be unavailable due to their complicated internal structure, see e.g. [8]. Fortunately, the matrices with a positive eigenvector, such as the Kolmogorov matrices considered here, have much simpler structure.…”
mentioning
confidence: 99%