option pricing using integral transforms
play

Option Pricing using Integral Transforms Peter Carr NYU Courant - PDF document

Option Pricing using Integral Transforms Peter Carr NYU Courant Institute joint work with H. G eman, D. Madan, L. Wu, and M. Yor Introduction Call values are often obtained by integ- rating their payoff against a risk-neutral


  1. Option Pricing using Integral Transforms Peter Carr NYU Courant Institute joint work with H. G´ eman, D. Madan, L. Wu, and M. Yor

  2. Introduction Call values are often obtained by integ- rating their payoff against a risk-neutral probability density function. When the characteristic function of the underlying asset is known in closed form, call values can also be obtained by a single integration. 2

  3. A Brief History of Sines • The history of integral transforms begins with d’Alembert in 1747. • D’Alembert proposed using a superposition of sine functions to describe the oscillations of a violin string. • The recipe for computing the coefficients, later associated with Fourier’s name, was actually formulated by Euler in 1777. • Fourier proposed using the same idea for the heat equation in 1807. • Since the introduction of periodic functions, mathematics has never been the same... 3

  4. Fourier Frequency in Finance • McKean (IMR 65) used Fourier transforms in his appendix to Samuelson’s paper. • Buser (JF 86) noticed that Laplace transforms with real argu- ments give present value rules. • Shimko (92) championed the use of Laplace transforms in his book. • Beaglehole (WP 92) used Fourier series to value double barrier options. • Stein & Stein (RFS 91) and Heston (RFS 93) started the ball rolling with their use of Fourier transforms to analytically value European options on stocks with stochastic volatility. • While not necessary, Fourier methods simplify the development of option pricing models which reflect empirical realities such as jumps (Ait-Sahalia JF 02), volatility clustering (Engle 81), and the leverage effect (Black 76). • A bibliography at the end of this presentation lists 76 papers applying integral transforms to option pricing. 4

  5. My Fast Fourier Talk (FFT) • To survey integral transforms for option pricing in one hour, I restrict the presentation to the use of Fourier transforms to value European options on a single stock. • Here’s an overview of my FFT: 1. What is a Fourier Transform (FT)? 2. What is a Characteristic Function (CF)? 3. Relating FT’s of Option Prices to CF’s 4. Pricing Options on L´ evy Processes 5. Pricing Options on L´ evy Processes w. Stochastic Volatility 5

  6. Fourier Transformation and Inversion • Let f ( x ) be a suitably integrable function • Letting δ ( · ) be Dirac’s delta function: � ∞ f ( x ) = f ( y ) δ ( y − x ) dy. −∞ � ∞ • The next page shows that δ ( y − x ) = 1 −∞ e iu ( y − x ) du. 2 π • Substituting in this fundamental result implies: � ∞ � ∞ f ( y ) 1 e iu ( y − x ) dudy f ( x ) = 2 π −∞ −∞ � ∞ � ∞ 1 e − iux f ( y ) e iuy dydu. = 2 π −∞ −∞ • Define the Fourier transform (FT) of f ( · ) as: � ∞ e iuy f ( y ) dy. F f ( u ) ≡ −∞ • Thus given the FT of f , the function f can be recovered by: � ∞ f ( x ) = 1 e − iux F f ( u ) du. 2 π −∞ • It is sometimes necessary to make u complex. When Im( u ) ≡ u i � = 0, the FT is referred to as a generalized Fourier transform. � iu i + ∞ f ( x ) = 1 e − iux F f ( u ) du. 2 π iu i −∞ 6

  7. No Potato, One Potato, Two Potato, Three... • Note that: 1. the average of 1 and 1 is 1 2. the average of 1 and e iπ = − 1 is 0. 1. The average of 1 and 1 and 1 is 1 3 i and e 3 i is 0. 2 π 4 π 2. The average of 1 and e 3 i and e 3 i is 0. 4 π 8 π 3. The average of 1 and e 1. The average of 1 and 1 and 1 and 1 is 1 2 i and e πi and e π 3 π 2 i is 0. 2. The average of 1 and e 3. The average of 1 and e πi and e 2 πi and e 3 πi is 0. 2 i and e 3 πi and e 2 i is 0. 3 π 9 π 4. The average of 1 and e • As financial engineers, we conclude that for all d = 2 , 3 , 4 . . . : d − 1 1 d jk = 1 j =0 , 2 πi � e d k =0 for j = 0 , 1 , . . . , d − 1. 7

  8. Yes, but... • Recall our engineering style proof that for d = 2 , 3 , . . . , : d − 1 1 d jk = 1 j =0 , 2 πi � e j = 0 , 1 , . . . , d − 1 . d k =0 2 πi d j , then • A mathematician would note that if we define r = e d − 1 the LHS is 1 r k . If j = 0, then r = 1 and the LHS is clearly � d k =0 1, while if j � = 0, then the sum is a geometric series: r d − 1 d − 1 1 r k = 1 r − 1 = 0 , since r d = e 2 πij = 1 . � d d k =0 d − 1 2 πi d jk . � • Multiplying the top equation by d implies d 1 j =0 = e k =0 • Putting our engineering cap back on on, letting d ↑ ∞ and j = y − x : � ∞ e i 2 πω ( y − x ) dω. δ ( y − x ) = −∞ • Letting u = 2 πω : � ∞ δ ( y − x ) = 1 e iu ( y − x ) du. 2 π −∞ • Fortunately, this can all be made precise. 8

  9. Basic Properties of Fourier Transforms • Recall that the (generalized) FT of f ( x ) is defined as: � ∞ e iux f ( x ) dx, F f ( u ) ≡ −∞ where f ( x ) is suitably integrable. • Three basic properties of FT’s are: 1. Parseval Relation: Define the inner product of 2 complex-valued L 2 functions � ∞ f ( · ) and g ( · ) as � f, g � ≡ −∞ f ( x ) g ( x ) dx. Then: � f, g � = �F f ( u ) , F g ( u ) � . 2. Differentiation : F f ′ ( u ) = − iu F f ( u ) 3. Modulation: F e ℓx f ( u ) = F f ( u − iℓ ) 9

  10. What is a Characteristic Function? • A characteristic function (CF) is the FT of a PDF. • If X has PDF q , then: � ∞ e iux q ( x ) dx = Ee iuX . F q ( u ) ≡ −∞ • For u real and fixed, the CF is the expected value of the loca- tion of a random point on the unit circle. Hence the norm of the CF is never bigger than one: |F q ( u ) | ≤ 1 . • The bigger the absolute value of the real frequency u , the wider is the distribution of uX . Hence, if the PDF of uX is wrapped around the unit circle, larger | u | leads to more uniform distri- bution of probability mass on the circle, and hence smaller norms of the CF. • Symmetric PDF’s centered about zero have real CF’s. • When the argument u is complex with non-zero imaginary part, the PDF is wrapped around a spiral rather than a circle. The larger is Im( u ), the faster we spiral into the origin. 10

  11. From Fourier to Finance • Suppose we interpret the function f as the final payoff to a derivative security maturing at T . � ∞ • Recall that f ( F T ) = −∞ f ( K ) δ ( F T − K ) dK. • This is a spectral decomposition of the payoff f into the payoffs δ ( · ) from an infinite collection of Arrow Debreu securities. ∂K 2 ( F T − K ) + = δ ( F T − K ). ∂ 2 • From Breeden & Litzenberger, • Hence, static positions in calls can create any path-indep. pay- off including e r 1 x sin( r 2 x ) & e r 1 x cos( r 2 x ) , r 1 , r 2 real. The pay- offs from these sine and cosine claims are created model-free. � ∞ • As we saw, δ ( F T − K ) = 1 −∞ e iu ( F T − K ) du. 2 π • When u is complex and u = u r + iu i : e iux = e u r x cos( u i x ) + ie u r x sin( u i x ) . • Hence, the payoff from each A/D security can in turn be repli- cated by a static position in sine claims and cosine claims. • Just as the payoffs from A/D securities may be a more conve- nient basis to work with than option payoffs, the payoffs from sine and cosine claims may be an even more convenient basis. • The use of complex numbers is even more convenient. After all, it is a lot easier to evaluate i 2 than sin( u 1 + u 2 ) or cos( u 1 + u 2 ). 11

  12. Parsevaluation • Let g ( k ) be the Green’s function (a.k.a the pricing kernel, but- terfly spread price, and discounted risk-neutral PDF). • Letting V 0 be the initial value of a claim paying f ( X T ) at T , risk-neutral valuation implies: � ∞ V 0 = f ( k ) g ( k ) dk = � f, g � , −∞ where for any functions φ 1 ( x ) and φ 2 ( x ), the inner product is: � ∞ � φ 1 , φ 2 � ≡ φ 1 ( x ) φ 2 ( x ) dx. −∞ � ∞ • By the Fourier Inversion Theorem f ( k ) = 1 −∞ e − iuk F f ( u ) du : 2 π � ∞ � ∞ 1 e − iuk F f ( u ) dug ( k ) dk V 0 = 2 π −∞ −∞ � ∞ � ∞ 1 g ( k ) e − iuk dkdu = F f ( u ) 2 π −∞ −∞ � ∞ 1 = F f ( u ) F g ( u ) du. 2 π −∞ • Hence V 0 = � f, g � = 1 2 π �F f , F g � by a change of basis. • Note that F g ( u ) = B 0 ( T ) F q ( − u ), i.e. discount factor × CF. • By restricting the payoff, more efficient Fourier methods can be developed. 12

  13. Breeden Litzenberger in Logs • Let C ( K, T ) relate call value to strike K and maturity T • The Green’s f’n G ( K, T ) is B 0 ( T ) Q { F T ∈ d ( K, K + dK ) } . ∂ 2 • From Breeden & Litzenberger (JB 78), G ( K, T ) = ∂K 2 C ( K, T ). • Let k ≡ ln( K/F 0 ) measure moneyness of the T maturity call. • Let γ ( k, T ) ≡ C ( K, T ) relate call value to k and T . • Let X t ≡ ln( F t /F 0 ) be the log price relative. • Let g ( k, T ) ≡ G ( K, T ) be the Green’s function of X T . • How are g and γ related? • By no arbitrage, the call value is related to g by: � ∞ ( e y − e k ) g ( y, T ) dy. γ ( k, T ) = F 0 k • To invert this relationship, differentiate w.r.t. k : � ∞ ∂ e k g ( y, T ) dy. ∂kγ ( k, T ) = − F 0 k � ∞ Hence: e − k ∂ ∂kγ ( k, T ) = − g ( y, T ) dy. F 0 k • Differentiating w.r.t. k again gives the desired result: e − k g ( k, T ) = ∂ ∂ ∂kγ ( k, T ) . ∂k F 0 13

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend