Weak Solutions of stochastic recursions: an explicit construction
Abstract
We propose an explicit construction of the solution of a stationary stochastic recursion of the form Xθ=φ(X) on a semi-ordered Polish space, when the monotonicity of φ is not assumed. This solution exists on an enriched probability space (it is said weak), provided the recursion is lattice-valued, and dominated by a proper monotonic stochastic recursion.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.