×

zbMATH — the first resource for mathematics

Additive functionals of Markov processes in duality. (English) Zbl 0133.40904

PDF BibTeX XML Cite
Full Text: DOI
References:
[1] R. M. Blumenthal, An extended Markov property, Trans. Amer. Math. Soc. 85 (1957), 52 – 72. · Zbl 0084.13602
[2] R. M. Blumenthal and R. K. Getoor, Sample functions of stochastic processes with stationary independent increments, J. Math. Mech. 10 (1961), 493 – 516. · Zbl 0097.33703
[3] R. M. Blumenthal, R. K. Getoor, and H. P. McKean Jr., Markov processes with identical hitting distributions, Illinois J. Math. 6 (1962), 402 – 420. · Zbl 0133.40903
[4] E. B. Dynkin, Theory of Markov processes, Translated from the Russian by D. E. Brown; edited by T. Köváry, Prentice-Hall, Inc., Englewood Cliffs, N.J.; Pergamon Press, Oxford-London-Paris, 1961. · Zbl 0091.13605
[5] G. A. Hunt, Markov processes and potentials. I, II, and III, Illinois J. Math. 1 (1957), 44-93, 316-369; 2 (1958), 151-213. · Zbl 0100.13804
[6] Michel Loève, Probability theory, 2nd ed. The University Series in Higher Mathematics. D. Van Nostrand Co., Inc., Princeton, N. J.-Toronto-New York-London, 1960. · Zbl 0095.12201
[7] H. P. McKean Jr. and Hiroshi Tanaka, Additive functionals of the Brownian path, Mem. Coll. Sci. Univ. Kyoto Ser. A Math. 33 (1960/1961), 479 – 506. · Zbl 0100.34201
[8] Paul-André Meyer, Fonctionelles multiplicatives et additives de Markov, Ann. Inst. Fourier (Grenoble) 12 (1962), 125 – 230 (French). · Zbl 0138.40802
[9] M. G. Šur, Continuous additive functionals of Markov processes and excessive functions, Soviet Math. Dokl. 2 (1961), 365 – 368. · Zbl 0111.33204
[10] Séminaire de théorie du potentiel (Séminaire Brelot-Choquet-Deny), Inst. H. Poincaré, Paris, Fifth year, 1960-1961.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.