Abstract
We study the convergence of the binomial, trinomial, and more generally m-nomial tree schemes when evaluating certain European path-independent options in the Black–Scholes setting. To our knowledge, the results here are the first for trinomial trees. Our main result provides formulae for the coefficients of 1/n and 1/n in the expansion of the error for digital and standard put and call options. This result is obtained from an Edgeworth series in the form of Kolassa–McCullagh, which we derive from a recently established Edgeworth series in the form of Esseen/Bhattacharya and Rao for triangular arrays of random variables. We apply our result to the most popular trinomial trees and provide numerical illustrations.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
