重组二叉树中期望值的简化计算
Parallelizing Computation of Expected Values in Recombinant Binomial Trees
摘要:
重组二叉树是一种二叉树,其中每个非叶节点有两个子节点,但相邻的父节点共享一个共同的子节点。在金融学中,期权定价时会出现这种树。例如,欧式期权的估值可以通过评估树中随机路径的资产收益的期望值来进行。在期权定价问题的许多变体中,无法获得封闭形式的解,并且需要计算方法。在随机路径上精确计算期望值的成本在树的深度上呈指数增长,使得一次一个分支的串行计算变得不切实际。我们提出了一个并行化的方法,将期望值的计算转化为一个“并行”的问题,通过映射的二叉树的分支到多处理器计算环境中的进程。我们还提出了一个并行蒙特卡罗方法,利用映射,以实现减少的基本蒙特卡罗估计的方差。在分布式计算集群上的并行化方法的R和Julia实现的性能结果表明,这两种实现都是可扩展的,但Julia比类似编写的R代码快得多。仿真研究验证了所提出的蒙特卡罗方法的收敛性和方差减少行为。
英文摘要:
Recombinant binomial trees are binary trees where each non-leaf node has two child nodes, but adjacent parents share a common child node. Such trees arise in finance when pricing an option. For example, valuation of a European option can be carried out by evaluating the expected value of asset payoffs with respect to random paths in the tree. In many variants of the option valuation problem, a closed form solution cannot be obtained and computational methods are needed. The cost to exactly compute expected values over random paths grows exponentially in the depth of the tree, rendering a serial computation of one branch at a time impractical. We propose a parallelization method that transforms the calculation of the expected value into an "embarrassingly parallel" problem by mapping the branches of the binomial tree to the processes in a multiprocessor computing environment. We also propose a parallel Monte Carlo method which takes advantage of the mapping to achieve a reduced variance over the basic Monte Carlo estimator. Performance results from R and Julia implementations of the parallelization method on a distributed computing cluster indicate that both the implementations are scalable, but Julia is significantly faster than a similarly written R code. A simulation study is carried out to verify the convergence and the variance reduction behavior in the proposed Monte Carlo method.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。