You are about to undo an edit. Please check the comparison below to verify that this is what you want to do, then publish the changes below to finish undoing the edit. If you are undoing an edit that is not vandalism, explain the reason in the edit summary. Do not use the default message only. |
Latest revision | Your text | ||
Line 1: | Line 1: | ||
⚫ | The '''Trinomial tree''' is a [[Lattice model (finance)|lattice based]] [[computational model]] used in [[financial mathematics]] to price [[option (finance)|options]]. It was developed by [[Phelim Boyle]] in 1986. It is an extension of the [[Binomial options pricing model]], and is conceptually similar.<ref>[http://www.global-derivatives.com/index.php/options-database-topmenu/13-options-database/15-european-options#Trinomial Trinomial Method (Boyle) 1986]</ref> It can also be shown that the approach is equivalent to the [[Finite_difference_method#Explicit_method|explicit]] [[finite difference methods for option pricing|finite difference method for option pricing]].<ref>[http://web.archive.org/web/20070622150346/www.in-the-money.com/pages/author.htm Mark Rubinstein]</ref> |
||
{{Short description|Model used in financial mathematics}} |
|||
⚫ |
The ''' |
||
==Formula== |
==Formula== |
||
Under the trinomial method, the [[underlying]] stock price is modeled as a recombining tree, where, at each node the price has three possible paths: an up, down and stable or middle path.<ref>[http://www.sitmo.com/ |
Under the trinomial method, the [[underlying]] stock price is modeled as a recombining tree, where, at each node the price has three possible paths: an up, down and stable or middle path.<ref>[http://www.sitmo.com/eq/441 Trinomial Tree, geometric Brownian motion]</ref> These values are found by multiplying the value at the current node by the appropriate factor <math> u\,</math>, <math> d\,</math> or <math> m\,</math> where |
||
:<math> u = e^{\sigma\sqrt {2\Delta t}}</math> |
:<math> u = e^{\sigma\sqrt {2\Delta t}}</math> |
||
:<math> d = e^{-\sigma\sqrt {2\Delta t}} = \frac{1}{u} \,</math> (the structure is recombining) |
:<math> d = e^{-\sigma\sqrt {2\Delta t}} = \frac{1}{u} \,</math> (the structure is recombining) |
||
Line 13: | Line 12: | ||
:<math> p_m = 1 - (p_u + p_d) \,</math>. |
:<math> p_m = 1 - (p_u + p_d) \,</math>. |
||
In the above formulae: <math> \Delta t \,</math> is the length of time per step in the tree and is simply time to maturity divided by the number of time steps; <math> r\,</math> is the [[risk-free interest rate]] over this maturity; <math> \sigma\,</math> is the corresponding [[volatility (finance)|volatility of the underlying]]; <math> q\,</math> is its corresponding [[dividend yield]]. |
In the above formulae: <math> \Delta t \,</math> is the length of time per step in the tree and is simply time to maturity divided by the number of time steps; <math> r\,</math> is the [[risk-free interest rate]] over this maturity; <math> \sigma\,</math> is the corresponding [[volatility (finance)|volatility of the underlying]]; <math> q\,</math> is its corresponding [[dividend yield]]. |
||
As with the binomial model, these factors and probabilities are specified so as to ensure that the price of the [[underlying]] evolves as a [[Martingale (probability theory)|martingale]], while the [[Moment (mathematics)|moments |
As with the binomial model, these factors and probabilities are specified so as to ensure that the price of the [[underlying]] evolves as a [[Martingale (probability theory)|martingale]], while the [[Moment (mathematics)|moments]] are matched approximately<ref>[http://www2.warwick.ac.uk/fac/sci/maths/people/staff/oleg_zaboronski/fm/trinomial_tree_2008.pdf Pricing Options Using Trinomial Trees]</ref> (and with increasing accuracy for smaller time-steps). |
||
Once the tree of prices has been calculated, the option price is found at each node largely [[ |
Once the tree of prices has been calculated, the option price is found at each node largely [[Binomial_options_pricing_model#Methodology|as for the binomial model]], by working backwards from the final nodes to today. The difference being that the option value at each non-final node is determined based on the three - as opposed to ''two'' - later nodes and their corresponding probabilities. The model is best understood visually - see, for example [http://www.hoadley.net/options/binomialtree.aspx?tree=T Trinomial Tree Option Calculator] (Peter Hoadley). |
||
If the length of time-steps <math> \Delta t </math> is taken as an exponentially distributed random variable and interpreted as the waiting time between two movements of the stock price then the resulting stochastic process is a [[birth–death process]]. The resulting [[Korn–Kreer–Lenssen model|model]] is soluble and there exist analytic pricing and hedging formulae for various options. |
|||
==Application== |
==Application== |
||
The trinomial model is considered<ref>[http://www.hoadley.net/options/calculators.htm On-Line Options Pricing & Probability Calculators]</ref> to produce more accurate results than the binomial model when |
The trinomial model is considered<ref>[http://www.hoadley.net/options/calculators.htm On-Line Options Pricing & Probability Calculators]</ref> to produce more accurate results than the binomial model when less time steps are modelled, and is therefore used when computational speed or resources may be an issue. For [[vanilla option]]s, as the number of steps increases, the results rapidly converge, and the binomial model is then preferred due to its simpler implementation. For [[exotic option]]s the trinomial model (or adaptations) is sometimes more stable and accurate, regardless of step-size. |
||
==See also== |
==See also== |
||
* |
*[[Binomial options pricing model]] |
||
* |
*[[Valuation of options]] |
||
* |
*[[Option_(finance)#Model_implementation|Option: Model implementation]] |
||
* [[Korn–Kreer–Lenssen model]] |
|||
* [[Implied trinomial tree]] |
|||
==References== |
== References == |
||
<references/> |
<references/> |
||
==External links== |
==External links== |
||
*[[Phelim Boyle]], 1986. "Option Valuation Using a Three-Jump Process", ''International Options Journal'' 3, |
*[[Phelim Boyle]], 1986. "Option Valuation Using a Three-Jump Process", ''International Options Journal'' 3, 7-12. |
||
*{{cite journal |last=Rubinstein |first=M. |authorlink=Mark Rubinstein |year=2000 |title=On the Relation Between Binomial and Trinomial Option Pricing Models |journal=[[Journal of Derivatives]] |volume=8 |issue=2 |pages=47–50 |url=//www.in-the-money.com/pages/author.htm |doi=10.3905/jod.2000.319149 |url-status=dead |archiveurl=https://web.archive.org/web/20070622150346/http://www.in-the-money.com/pages/author.htm |archivedate=June 22, 2007 |citeseerx=10.1.1.43.5394 }} |
|||
*Paul Clifford et al. 2010. [https://warwick.ac.uk/fac/sci/maths/people/staff/oleg_zaboronski/fm/trinomial_tree_2010_kevin.pdf Pricing Options Using Trinomial Trees], [[University of Warwick]] |
|||
*Tero Haahtela, 2010. [https://www.realoptions.org/papers2010/241.pdf "Recombining Trinomial Tree for Real Option Valuation with Changing Volatility"], [[Aalto University]], Working Paper Series. |
|||
* Ralf Korn, Markus Kreer and Mark Lenssen, 1998. "Pricing of european options when the underlying stock price follows a linear birth-death process", Stochastic Models Vol. 14(3), pp 647 – 662 |
|||
* Peter Hoadley. [http://www.hoadley.net/options/binomialtree.aspx?tree=T Trinomial Tree Option Calculator (Tree Visualized)] |
|||
{{datastructure-stub}} |
|||
{{Derivatives market}} |
{{Derivatives market}} |
||
[[Category:Mathematical finance]] |
[[Category:Mathematical finance]] |
||
[[Category:Options |
[[Category:Options]] |
||
[[Category: |
[[Category:Finance theories]] |
||
[[Category: |
[[Category:Computational models]] |
||
[[Category: |
[[Category:Trees (structure)]] |
Copy and paste: – — ° ′ ″ ≈ ≠ ≤ ≥ ± − × ÷ ← → · § Cite your sources: <ref></ref>
{{}} {{{}}} | [] [[]] [[Category:]] #REDIRECT [[]] <s></s> <sup></sup> <sub></sub> <code></code> <pre></pre> <blockquote></blockquote> <ref></ref> <ref name="" /> {{Reflist}} <references /> <includeonly></includeonly> <noinclude></noinclude> {{DEFAULTSORT:}} <nowiki></nowiki> <!-- --> <span class="plainlinks"></span>
Symbols: ~ | ¡ ¿ † ‡ ↔ ↑ ↓ • ¶ # ∞ ‹› «» ¤ ₳ ฿ ₵ ¢ ₡ ₢ $ ₫ ₯ € ₠ ₣ ƒ ₴ ₭ ₤ ℳ ₥ ₦ № ₧ ₰ £ ៛ ₨ ₪ ৳ ₮ ₩ ¥ ♠ ♣ ♥ ♦ 𝄫 ♭ ♮ ♯ 𝄪 © ® ™
Latin: A a Á á À à  â Ä ä Ǎ ǎ Ă ă Ā ā à ã Å å Ą ą Æ æ Ǣ ǣ B b C c Ć ć Ċ ċ Ĉ ĉ Č č Ç ç D d Ď ď Đ đ Ḍ ḍ Ð ð E e É é È è Ė ė Ê ê Ë ë Ě ě Ĕ ĕ Ē ē Ẽ ẽ Ę ę Ẹ ẹ Ɛ ɛ Ǝ ǝ Ə ə F f G g Ġ ġ Ĝ ĝ Ğ ğ Ģ ģ H h Ĥ ĥ Ħ ħ Ḥ ḥ I i İ ı Í í Ì ì Î î Ï ï Ǐ ǐ Ĭ ĭ Ī ī Ĩ ĩ Į į Ị ị J j Ĵ ĵ K k Ķ ķ L l Ĺ ĺ Ŀ ŀ Ľ ľ Ļ ļ Ł ł Ḷ ḷ Ḹ ḹ M m Ṃ ṃ N n Ń ń Ň ň Ñ ñ Ņ ņ Ṇ ṇ Ŋ ŋ O o Ó ó Ò ò Ô ô Ö ö Ǒ ǒ Ŏ ŏ Ō ō Õ õ Ǫ ǫ Ọ ọ Ő ő Ø ø Œ œ Ɔ ɔ P p Q q R r Ŕ ŕ Ř ř Ŗ ŗ Ṛ ṛ Ṝ ṝ S s Ś ś Ŝ ŝ Š š Ş ş Ș ș Ṣ ṣ ß T t Ť ť Ţ ţ Ț ț Ṭ ṭ Þ þ U u Ú ú Ù ù Û û Ü ü Ǔ ǔ Ŭ ŭ Ū ū Ũ ũ Ů ů Ų ų Ụ ụ Ű ű Ǘ ǘ Ǜ ǜ Ǚ ǚ Ǖ ǖ V v W w Ŵ ŵ X x Y y Ý ý Ŷ ŷ Ÿ ÿ Ỹ ỹ Ȳ ȳ Z z Ź ź Ż ż Ž ž ß Ð ð Þ þ Ŋ ŋ Ə ə
Greek: Ά ά Έ έ Ή ή Ί ί Ό ό Ύ ύ Ώ ώ Α α Β β Γ γ Δ δ Ε ε Ζ ζ Η η Θ θ Ι ι Κ κ Λ λ Μ μ Ν ν Ξ ξ Ο ο Π π Ρ ρ Σ σ ς Τ τ Υ υ Φ φ Χ χ Ψ ψ Ω ω {{Polytonic|}}
Cyrillic: А а Б б В в Г г Ґ ґ Ѓ ѓ Д д Ђ ђ Е е Ё ё Є є Ж ж З з Ѕ ѕ И и І і Ї ї Й й Ј ј К к Ќ ќ Л л Љ љ М м Н н Њ њ О о П п Р р С с Т т Ћ ћ У у Ў ў Ф ф Х х Ц ц Ч ч Џ џ Ш ш Щ щ Ъ ъ Ы ы Ь ь Э э Ю ю Я я ́
IPA: t̪ d̪ ʈ ɖ ɟ ɡ ɢ ʡ ʔ ɸ β θ ð ʃ ʒ ɕ ʑ ʂ ʐ ç ʝ ɣ χ ʁ ħ ʕ ʜ ʢ ɦ ɱ ɳ ɲ ŋ ɴ ʋ ɹ ɻ ɰ ʙ ⱱ ʀ ɾ ɽ ɫ ɬ ɮ ɺ ɭ ʎ ʟ ɥ ʍ ɧ ʼ ɓ ɗ ʄ ɠ ʛ ʘ ǀ ǃ ǂ ǁ ɨ ʉ ɯ ɪ ʏ ʊ ø ɘ ɵ ɤ ə ɚ ɛ œ ɜ ɝ ɞ ʌ ɔ æ ɐ ɶ ɑ ɒ ʰ ʱ ʷ ʲ ˠ ˤ ⁿ ˡ ˈ ˌ ː ˑ ̪ {{IPA|}}
Wikidata entities used in this page
Pages transcluded onto the current version of this page (help):
This page is a member of 3 hidden categories (help):