A direct proof of the Ray-Knight theorem
In this paper, we prove a Donsker theorem for one-dimensional processes generated by an operator with measurable coefficients. We construct a random walk on any grid on the state space, using the transition probabilities of the approximated process, and the conditional average times it spends on each cell of the grid. Indeed we can compute these quantities by solving some suitable elliptic PDE problems.
Given the (canonical) Markov process associated with a sufficiently general semigroup (P t), we establish a result concerning the uniform completeness of a family of L 2-spaces naturally associated with the jumps of the process. An application of this result is presented.
Using the natural extensions for the Rosen maps, we give an infinite-order-chain representation of the sequence of the incomplete quotients of the Rosen fractions. Together with the ergodic behaviour of a certain homogeneous random system with complete connections, this allows us to solve a variant of Gauss-Kuzmin problem for the above fraction expansion.
We provide a generalization of Ueno's inequality for n-step transition probabilities of Markov chains in a general state space. Our result is relevant to the study of adaptive control problems and approximation problems in the theory of discrete-time Markov decision processes and stochastic games.