Both the Doob-Меуег and Graversen-Rao decomposition theorems can be proved following an approach based on predictable compensators of discretizations and weak-L1 technique, which was developed by K. M. Rao. It is shown that any decomposition obtained by Rao’s method gives predictability of compensators without additional assumptions (like submartingality in the original Doob-Meyer theorem or finite energy in the Graversen-Rao theorem).
This article presents and discusses a proposition of stochastic postulates for chain indices. The presented postulates are based on the assumption that prices and quantities are stochastic processes and we consider also the case when price processes are martingales. We define general conditions which allow the chain indices to satisfy these postulates.
Set-valued semimartingales are introduced as an extension of the notion of single-valued semimartingales. For such multivalued processes their semimartingale selection properties are investigated.
4
Dostęp do pełnego tekstu na zewnętrznej witrynie WWW
Principle of Conditioning is a well known heuristic rule which allows constructing limit theorems for sums of dependent random variables from existing limit theorems for independent summands. In the paper we state a general limit theorem on converegnce to stable laws, which is valid for stationary sequences and provides a link between the Principle of Conditioning and ergodic theorems.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.