Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao zbMATH Openarrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
zbMATH Open
Article
Data sources: zbMATH Open
Theory of Probability and Its Applications
Article . 1964 . Peer-reviewed
Data sources: Crossref
versions View all 2 versions
addClaim

Equicontinuous Markov Operators

Equicontinuous Markov operators
Authors: Rosenblatt, M.;

Equicontinuous Markov Operators

Abstract

In the paper we study limit properties of equicontinuous (nearly periodic) positive operators which transform continuous functions into continuous ones. The domain of definition of the functions is a compact Hausdorff space X. Section 1 contains some preliminary information. In Section 2, positive Markov operators are considered. A decomposition of part of the space X into ergodic sub-parts is obtained, which is analogous to the decomposition of Krylov and Bogolyubov. In the next section eigenfunctions of positive operators are studied which correspond to eigenvalues with maximal absolute values. The theory of Perron-Frobenius is generalized to the situation considered. Section 4 is devoted to the investigation of the asymptotic behavior of the powers $T^n $ of Markov transition operators. Finally, in Section 5, we consider the asymptotic behavior of the convolutions $\nu ^n $, $n = 1,2, \cdots $, of a regular measure on a compact topological subgroup. Some results obtained in the previous sections are us...

Keywords

probability theory

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    20
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Average
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
20
Average
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!