In this note, we define approximating minimal Q processes, whose paths can be constructed by approximating Markov chains in Ref. (3)By approximating minimal Q processes, we have constructed paths for a class of nonsti...In this note, we define approximating minimal Q processes, whose paths can be constructed by approximating Markov chains in Ref. (3)By approximating minimal Q processes, we have constructed paths for a class of nonsticky Q processes which contain the well-known Doob’s processes as a special case.展开更多
文摘In this note, we define approximating minimal Q processes, whose paths can be constructed by approximating Markov chains in Ref. (3)By approximating minimal Q processes, we have constructed paths for a class of nonsticky Q processes which contain the well-known Doob’s processes as a special case.
