Hölder's theorem: Difference between revisions
Jump to navigation
Jump to search
edit |
en>Yobot m WP:CHECKWIKI error fixes / special characters in sortkey fixed using AWB (9427) |
||
Line 1: | Line 1: | ||
In [[probability theory]], a '''Hunt process'''<!-- named after XXXX Hunt, for a suitable value of XXXX? --> is a [[Markov process|strong Markov process]] which is quasi-left [[Continuous function|continuous]] with respect to the minimum completed admissible [[Filtration (abstract algebra)|filtration]] <math>\{ F_t \}_{t\geq 0}</math>. | |||
==See also== | |||
* [[Markov process]] | |||
* [[Markov chain]] | |||
* [[Shift of finite type]] | |||
==References== | |||
* [http://ams.org/bull/1996-33-01/S0273-0979-96-00617-9/S0273-0979-96-00617-9.pdf Book review] of Fukushima, Oshima, Takeda, ''Dirichlet Forms and Symmetric Markov Processes'' (de Gruyter Studies in Mathematics 19). Reviewed by [[Daniel W. Stroock]], ''Bulletin of the American Mathematical Society'' (new series) v. 33 n. 1, Jan 1996. | |||
{{Stochastic processes}} | |||
{{probability-stub}} | |||
[[Category:Stochastic processes]] |
Latest revision as of 18:26, 21 August 2013
In probability theory, a Hunt process is a strong Markov process which is quasi-left continuous with respect to the minimum completed admissible filtration .
See also
References
- Book review of Fukushima, Oshima, Takeda, Dirichlet Forms and Symmetric Markov Processes (de Gruyter Studies in Mathematics 19). Reviewed by Daniel W. Stroock, Bulletin of the American Mathematical Society (new series) v. 33 n. 1, Jan 1996.