首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Parallelizing computation of expected values in recombinant binomial trees
Authors:Sai K Popuri  Andrew M Raim  Nagaraj K Neerchal  Matthias K Gobbert
Institution:1. Department of Mathematics and Statistics, University of Maryland, Baltimore, MD, USA;2. Center for Statistical Research &3. Methodology, U.S. Census Bureau, Washington, DC, USA
Abstract: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 option pricing in finance. For example, an option can be valued by evaluating the expected payoffs with respect to random paths in the tree. 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 discuss a parallel Monte Carlo method and verify the convergence and the variance reduction behavior by simulation study. Performance results from R and Julia implementations are compared on a distributed computing cluster.
Keywords:Binomial tree  Bernoulli paths  Monte Carlo estimation  option pricing
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号