检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Christophe Profeta Frederic Vrins
机构地区:[1]Universite d’Evry,France [2]Louvain Finance Center(LFIN)and Center for Operations Research and Econometrics(CORE),Voie du Roman Pays 34,1348 Louvain-la-Neuve,Belgium
出 处:《Probability, Uncertainty and Quantitative Risk》2019年第1期16-42,共27页概率、不确定性与定量风险(英文)
基 金:the Fonds de la Recherche Scientifique-FNRS under Grant J.0037.18.
摘 要:Conditional expectations(like,e.g.,discounted prices in financial applications)are martingales under an appropriate filtration and probability measure.When the information flow arrives in a punctual way,a reasonable assumption is to suppose the latter to have piecewise constant sample paths between the random times of information updates.Providing a way to find and construct piecewise constant martingales evolving in a connected subset of R is the purpose of this paper.After a brief review of possible standard techniques,we propose a construction scheme based on the sampling of latent martingalesZ with lazy clocksθ.Theseθare time-change processes staying in arrears of the true time but that can synchronize at random times to the real(calendar)clock.This specific choice makes the resulting time-changed process Zt=Zθt a martingale(called a lazy martingale)without any assumption onZ,and in most cases,the lazy clockθis adapted to the filtration of the lazy martingale Z,so that sample paths of Z on[0,T]only requires sample paths ofθ,Zup to T.This would not be the case if the stochastic clockθcould be ahead of the real clock,as is typically the case using standard time-change processes.The proposed approach yields an easy way to construct analytically tractable lazy martingales evolving on(interval of)R.
关 键 词:Time-change process Last passage time MARTINGALE Bounded martingale Jump martingale SUBORDINATOR
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.171