Journal of Computational Finance

Risk.net

A new algorithm for constructing implied binomial trees: does the implied model fit any volatility smile?

Yanmin Li

ABSTRACT

A new algorithm is proposed for constructing the implied recombining binomial tree. The implied tree built by the method is much more stable and reliable than that constructed using the algorithm of Derman and Kani (1994) and its extensions. Furthermore, it is faster and easier to use. The general properties of the implied model are studied. It is demonstrated that the local volatility function can become singular for certain volatility smiles. The implications of the singularity for the application of the implied model are discussed.

Sorry, our subscription options are not loading right now

Please try again later. Get in touch with our customer services team if this issue persists.

New to Risk.net? View our subscription options

If you already have an account, please sign in here.

You need to sign in to use this feature. If you don’t have a Risk.net account, please register for a trial.

Sign in
You are currently on corporate access.

To use this feature you will need an individual account. If you have one already please sign in.

Sign in.

Alternatively you can request an individual account here: