2008
DOI: 10.32513/tbilisi/1528768826
|View full text |Cite
|
Sign up to set email alerts
|

Almost periodicity of stochastic operators on $\ell^1(\mathbb{N})$

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2008
2008
2022
2022

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…Since (T (t)| P X ) t≥0 is periodic, one has 1 ∈ σ p (B| T ). Hence, [20,Proposition 2.1] shows that there exists a strictly positive fixed vector x ∈ 1 of B and this fixed vector is clearly an element of P 1 . In particular, f ⊗ x is an element of…”
Section: Theorem 46mentioning
confidence: 99%
“…Since (T (t)| P X ) t≥0 is periodic, one has 1 ∈ σ p (B| T ). Hence, [20,Proposition 2.1] shows that there exists a strictly positive fixed vector x ∈ 1 of B and this fixed vector is clearly an element of P 1 . In particular, f ⊗ x is an element of…”
Section: Theorem 46mentioning
confidence: 99%
“…Since (T (t)| P X ) t≥0 is periodic, one has 1 ∈ σ p (B| T ). Hence, [21,Proposition 2.1] shows that there exists a strictly positive fixed vector x ∈ ℓ 1 of B and this fixed vector is clearly an element of Pℓ 1 . In particular,…”
Section: 2mentioning
confidence: 99%
“…The basis for our further investigation is the characterization due to F.G. Foster known as Proof (i) ⇔ (ii) is Foster's Theorem (for a functional analytic proof, more in the line of this paper, see [19,Thm. 2.11]), while (ii) ⇒ (iii) is the assertion of our Theorem 1 and the converse (iii) ⇒ (ii) is the necessary condition Lemma 9.…”
Section: Positive Recurrent Graphsmentioning
confidence: 99%