Conformal Invariance of the Exploration Path in 2D Critical Bond Percolation in the Square Lattice

Similar documents
Research Statement. Dapeng Zhan

arxiv:math/ v1 [math.pr] 24 Apr 2003

SLE and CFT. Mitsuhiro QFT2005

Randomness and Fractals

M5MF6. Advanced Methods in Derivatives Pricing

Last Time. Martingale inequalities Martingale convergence theorem Uniformly integrable martingales. Today s lecture: Sections 4.4.1, 5.

Tangent Lévy Models. Sergey Nadtochiy (joint work with René Carmona) Oxford-Man Institute of Quantitative Finance University of Oxford.

Equivalence between Semimartingales and Itô Processes

An Introduction to Stochastic Calculus

Using radial basis functions for option pricing

STOCHASTIC CALCULUS AND BLACK-SCHOLES MODEL

A No-Arbitrage Theorem for Uncertain Stock Model

Non-semimartingales in finance

Limit Theorems for the Empirical Distribution Function of Scaled Increments of Itô Semimartingales at high frequencies

Hints on Some of the Exercises

Continuous-time Stochastic Control and Optimization with Financial Applications

EFFICIENT MONTE CARLO ALGORITHM FOR PRICING BARRIER OPTIONS

Stochastic Dynamical Systems and SDE s. An Informal Introduction

CONVERGENCE OF OPTION REWARDS FOR MARKOV TYPE PRICE PROCESSES MODULATED BY STOCHASTIC INDICES

arxiv: v1 [math-ph] 28 May 2015

Quadrant marked mesh patterns in 123-avoiding permutations

Option Pricing under Delay Geometric Brownian Motion with Regime Switching

Local vs Non-local Forward Equations for Option Pricing

Asymptotic results discrete time martingales and stochastic algorithms

Lecture 23: April 10

An Introduction to Stochastic Calculus

Basic Concepts in Mathematical Finance

Stochastic Calculus, Application of Real Analysis in Finance

Enlargement of filtration

PDE Methods for the Maximum Drawdown

Functional vs Banach space stochastic calculus & strong-viscosity solutions to semilinear parabolic path-dependent PDEs.

On Using Shadow Prices in Portfolio optimization with Transaction Costs

X i = 124 MARTINGALES

Logarithmic derivatives of densities for jump processes

Building Infinite Processes from Regular Conditional Probability Distributions

Drunken Birds, Brownian Motion, and Other Random Fun

Rohini Kumar. Statistics and Applied Probability, UCSB (Joint work with J. Feng and J.-P. Fouque)

Module 10:Application of stochastic processes in areas like finance Lecture 36:Black-Scholes Model. Stochastic Differential Equation.

Value at Risk and Self Similarity

Math 416/516: Stochastic Simulation

The stochastic calculus

Collinear Triple Hypergraphs and the Finite Plane Kakeya Problem

Introduction Random Walk One-Period Option Pricing Binomial Option Pricing Nice Math. Binomial Models. Christopher Ting.

1.1 Basic Financial Derivatives: Forward Contracts and Options

BROWNIAN MOTION II. D.Majumdar

Hedging of swaptions in a Lévy driven Heath-Jarrow-Morton framework

Distortion operator of uncertainty claim pricing using weibull distortion operator

ELEMENTS OF MONTE CARLO SIMULATION

I Preliminary Material 1

Prize offered for the solution of a dynamic blocking problem

The Forward PDE for American Puts in the Dupire Model

Richardson Extrapolation Techniques for the Pricing of American-style Options

How to hedge Asian options in fractional Black-Scholes model

From Discrete Time to Continuous Time Modeling

Numerical Methods in Option Pricing (Part III)

Dr. Maddah ENMG 625 Financial Eng g II 10/16/06

Stochastic Differential equations as applied to pricing of options

A Continuity Correction under Jump-Diffusion Models with Applications in Finance

Fundamentals of Stochastic Filtering

Lecture 17. The model is parametrized by the time period, δt, and three fixed constant parameters, v, σ and the riskless rate r.

Computational Finance Improving Monte Carlo

The Black-Scholes Model

MATH3075/3975 FINANCIAL MATHEMATICS TUTORIAL PROBLEMS

Advanced. of Time. of Measure. Aarhus University, Denmark. Albert Shiryaev. Stek/ov Mathematical Institute and Moscow State University, Russia

Finite Element Method

USC Math. Finance April 22, Path-dependent Option Valuation under Jump-diffusion Processes. Alan L. Lewis

Option Pricing and Calibration with Time-changed Lévy processes

Risk Neutral Valuation

Some Computational Aspects of Martingale Processes in ruling the Arbitrage from Binomial asset Pricing Model

RMSC 4005 Stochastic Calculus for Finance and Risk. 1 Exercises. (c) Let X = {X n } n=0 be a {F n }-supermartingale. Show that.

Introduction to Stochastic Calculus With Applications

Chapter 3: Black-Scholes Equation and Its Numerical Evaluation

THE MARTINGALE METHOD DEMYSTIFIED

A note for hybrid Bollinger bands

Comparison of proof techniques in game-theoretic probability and measure-theoretic probability

Monte Carlo Methods in Financial Engineering

Introduction to Stochastic Calculus and Financial Derivatives. Simone Calogero

Singular Stochastic Control Models for Optimal Dynamic Withdrawal Policies in Variable Annuities

Self-organized criticality on the stock market

The Black-Scholes Model

There are no predictable jumps in arbitrage-free markets

PAPER 27 STOCHASTIC CALCULUS AND APPLICATIONS

Managing Default Contagion in Financial Networks

Lecture Quantitative Finance Spring Term 2015

Homework Assignments

Saddlepoint Approximation Methods for Pricing. Financial Options on Discrete Realized Variance

SLE AND TRIANGLES. 1 Introduction. DOI: /ECP.v Elect. Comm. in Probab. 8 (2003)2842. ELECTRONIC COMMUNICATIONS in PROBABILITY

Introduction to Probability Theory and Stochastic Processes for Finance Lecture Notes

American Option Pricing Formula for Uncertain Financial Market

1 Mathematics in a Pill 1.1 PROBABILITY SPACE AND RANDOM VARIABLES. A probability triple P consists of the following components:

Multi-Asset Options. A Numerical Study VILHELM NIKLASSON FRIDA TIVEDAL. Master s thesis in Engineering Mathematics and Computational Science

On the smoothness of the partition function for multiple Schramm-Loewner evolutions

Constructive martingale representation using Functional Itô Calculus: a local martingale extension

Option pricing in the stochastic volatility model of Barndorff-Nielsen and Shephard

The Value of Information in Central-Place Foraging. Research Report

Homework 1 posted, due Friday, September 30, 2 PM. Independence of random variables: We say that a collection of random variables

Variations on a theme by Weetman

Pricing Volatility Derivatives with General Risk Functions. Alejandro Balbás University Carlos III of Madrid

Are stylized facts irrelevant in option-pricing?

MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.265/15.070J Fall 2013 Lecture 11 10/9/2013. Martingales and stopping times II

Transcription:

Conformal Invariance of the Exploration Path in 2D Critical Bond Percolation in the Square Lattice Chinese University of Hong Kong, STAT December 12, 2012 (Joint work with Jonathan TSAI (HKU) and Wang ZHOU(NUS))

Critical Site Percolation in the Hexagonal Lattice For each site on the hexagonal lattice, we flip a fair coin. Heads we colour the site black. Tails we colour the site white. This is the critical site percolation on the hexagonal lattice.

The Site Percolation Exploration Path We apply boundary conditions black to the left, and white to the right and flip coins for the other sites. Then there is a path from a to b on the lattice that has black hexagons to its left and white hexagons to its right. This is the site percolation exploration path.

The Site Percolation Exploration Path We apply boundary conditions black to the left, and white to the right and flip coins for the other sites. Then there is a path from a to b on the lattice that has black hexagons to its left and white hexagons to its right. This is the site percolation exploration path.

The Site Percolation Exploration Path (cont.) Another way of constructing the path is as follows. At each step of the path, we flip a fair coin. Heads the path turns right; Tails the path turns left; unless the path is forced to go in a particular direction.

The Site Percolation Exploration Path (cont.) Another way of constructing the path is as follows. At each step of the path, we flip a fair coin. Heads the path turns right; Tails the path turns left; unless the path is forced to go in a particular direction.

The Site Percolation Exploration Path (cont.) Another way of constructing the path is as follows. At each step of the path, we flip a fair coin. Heads the path turns right; Tails the path turns left; unless the path is forced to go in a particular direction.

The Scaling Limit Theorem (Smirnov (2001), Camia and Newman (2007)) The scaling limit (i.e. the limit as the mesh-size of the lattice tends to zero) of the site percolation exploration path converges to stochastic (Schramm) Loewner evolution with parameter κ = 6 (SLE 6 ). What is stochastic (Schramm) Loewner evolution? Invented by O. Schramm in 1999. Describes conformally invariant curves in the plane. Cardy s formula: the crossing probability of a percolation from an interval of an edge to that of another of an equilateral triangle.

The Loewner Transform For some real-valued function ξ : [0, ) R, the chordal Loewner differential equation is g t (z, t) = 2 g(z, t) ξ(t) with g(z, 0) z The solution g t (z) = g(z, t) is a conformal map of H t H onto H where H = {z : Im[z] > 0} is the complex upper half-plane. It is often the case that H t = H \ γ[0, t] where γ is a curve in H starting from 0 and ending at. We can think of the chordal Loewner differential equation as defining a transform ξ γ which we call the Loewner transform. ξ is called the Loewner driving function of the curve γ. Stochastic Loewner evolution with parameter κ is the Loewner transform of κb t where B t is standard 1-d Brownian motion.

Critical Bond Percolation on the Square Lattice How about on the square lattice Z 2? For each edge in the lattice we flip a fair coin. Heads we keep the edge. Tails we delete the edge. This is the critical bond percolation on the square lattice.

Critical Bond Percolation on the Square Lattice (cont.) We can consider the same process on the dual lattice. For each site in the lattice we flip a fair coin. Heads we add a diagonal edge from the top left vertex to the bottom right vertex. Tails we add a diagonal edge from the bottom left vertex to the top right vertex.

The Bond Percolation Exploration Process We apply boundary conditions and flip coins for the other sites. Then there is a rectilinear path from a to b on the original lattice that lies in the corridor between red and blue edges. This is the bond percolation exploration path.

A Main Conjecture Whether the critical bond percolation exploration process on this square lattice converges to the trace of SLE 6 or not is an important conjecture in mathematical physics and probability. See P.5 in the document at http://www.math.ubc.ca/ slade/newsletter.10.2.pdf... But although site percolation on the triangular lattice is now well understood via SLE6, the critical behaviour of bond percolation on the square lattice, which is believed to be identical, is not at all understood from a mathematical point of view. Kenneth G. Wilson was awarded the 1982 Nobel Prize in Physics for his work on the renormalization group which led to an understanding of universality within theoretical physics. However, there is as yet no mathematically rigorous understanding of universality for two-dimensional critical phenomena...

Main Theorem Theorem The scaling limit of the bond percolation exploration path converges to stochastic Loewner evolution with parameter κ = 6 (SLE 6 ).

Idea of the Proof 1 Modify the lattice in order to convert the site percolation exploration path (on the hexagonal lattice) to a path on the rectangular lattice.

Idea of the Proof 1 Modify the lattice in order to convert the site percolation exploration path (on the hexagonal lattice) to a path on the rectangular lattice. 2 Apply a conditioning (restriction) procedure to this path to make it close to the bond percolation exploration path (on the square lattice).

Idea of the Proof 1 Modify the lattice in order to convert the site percolation exploration path (on the hexagonal lattice) to a path on the rectangular lattice. 2 Apply a conditioning (restriction) procedure to this path to make it close to the bond percolation exploration path (on the square lattice). 3 Show that the conditioned path has Loewner driving function that converges subsequentially to an ɛ-semimartingale, i.e. a martingale plus a finite (1 + ɛ)-variation process.

Idea of the Proof 1 Modify the lattice in order to convert the site percolation exploration path (on the hexagonal lattice) to a path on the rectangular lattice. 2 Apply a conditioning (restriction) procedure to this path to make it close to the bond percolation exploration path (on the square lattice). 3 Show that the conditioned path has Loewner driving function that converges subsequentially to an ɛ-semimartingale, i.e. a martingale plus a finite (1 + ɛ)-variation process. 4 Exploit the locality property of bond percolation exploration path to show that the Loewner driving term of the bond percolation exploration path converges to 6B t.

Idea of the Proof 1 Modify the lattice in order to convert the site percolation exploration path (on the hexagonal lattice) to a path on the rectangular lattice. 2 Apply a conditioning (restriction) procedure to this path to make it close to the bond percolation exploration path (on the square lattice). 3 Show that the conditioned path has Loewner driving function that converges subsequentially to an ɛ-semimartingale, i.e. a martingale plus a finite (1 + ɛ)-variation process. 4 Exploit the locality property of bond percolation exploration path to show that the Loewner driving term of the bond percolation exploration path converges to 6B t. 5 Apply standard arguments to deduce that the scaling limit of the bond percolation exploration path converges to SLE 6.

Idea of the Proof: Lattice Modification By replacing the hexagonal sites in the hexagonal lattice with rectangles we convert the hexagonal lattice into a brick-wall lattice.

Idea of the Proof: Lattice Modification (cont.) We then shift the rows of the brick-wall lattice left and right alternatively to get a rectangular lattice This induces a path on the rectangular lattice which is in a 2δ-neighbourhood of the site percolation exploration path. This is the +BP (Brick-wall Process). Similarly, by shifting the rows the other way, we get the BP. In particular, the ±BP both converge to SLE 6 as the mesh-size δ tends to 0.

Idea of the Proof: Conditioning the ±BP Note that the +BP can go in the same direction for two consecutive edges. The bond percolation path cannot. We will condition the +BP to not go in the same direction for two consecutive edges. However we do this in two steps. First we define the free vertices of the +BP to be the vertices where there are 3 possible paths for the next vertex. We condition the +BP to not go in the same direction for two consecutive edges at the free vertices. This conditioned path is the +CBP (Conditioned Brick-wall Process). Similarly, we define the CBP.

Idea of the Proof: Conditioning the ±BP (cont.) We then condition the ±CBP at the non-free vertices as well to get the ± CBP (Boundary Conditioned Brick-wall Process). +BP +CBP + CBP

Idea of the Proof: Conditioning the ±BP (cont.) It turns out that the bond percolation exploration path (on the square lattice) is topologically the same as alternate pastings of the + CBP and CBP.

Idea of the Proof: Conditioning the ±BP (cont.) Also, we can couple the ±CBP and the ± CBP such that their respective Loewner driving functions are close. Hence it is sufficient to study the +CBP.

Idea of the Proof: Driving term convergence of the +CBP For simplicity we work in H. Using Schwarz-Christoffel transformation as in Tsai (2009), we can write the Loewner driving function of any path on the lattice as ξ t = 2[ 1 N(t) a1 (t) + b 1 (t) + L k (a k (t) b k (t)) ], k=2 where L k is +1 if the path turns right and 1 if the path turns left at the kth step.

Idea of the Proof: Driving term convergence of the +CBP Consider the +CBP. We choose 0 = m 0 < m 1 < m 2 <... random steps, defined recursively so that +BP has a definite increment in its half-plane capacity, adapted to the process appropriately. Then if we let M n = ξ tmn, we have M n M n 1 = R n 1 (t mn ) R n 1 (t mn 1 )+ 1 2 where m n k=m n 1 +1 R n 1 (t) = 2[ 1 m n 1 a1 (t) + b 1 (t) + L k (a k (t) b k (t)) ]. k=2 L k ( ak (t mn ) b k (t mn ) )

Idea of the Proof: Driving term convergence of the +CBP Letting j,n = [(a j (t mn ) a j+1 (t mn )) (b j (t mn ) b j+1 (t mn )], we can telescope the above sum and take conditional expectations to get E [ ] M n M n 1 F mn 1 = E [ ] R n 1 (t mn ) R n 1 (t mn 1 ) F mn 1 + 1 2 m n j=m n 1 +1 E [ j,n j k=m n 1 +1 L k F mn 1 ]. Using the convergence of the +BP path to SLE 6, we deduce that we can decompose for sufficiently small mesh-size δ, E [ j,n j k=m n 1 +1 L k F mn 1 ] E [ j,n ] E [ j k=m n 1 +1 L k F mn 1 ].

Idea of the Proof: Driving term convergence of the +CBP From the definition of (L k ), using a symmetry argument, one should be able to show that E [ j k=m n 1 +1 L k F mn 1 ] 0. (at least sufficiently far from the boundary). This would imply that E [ M n M n 1 F mn 1 ] E [ Rn 1 (t mn ) R n 1 (t mn 1 ) F mn 1]. Hence M n n R k 1 (t mk ) R k 1 (t mk 1 ) k=1 is almost a martingale.

Idea of the Proof: Driving term convergence of the +CBP By telescoping the sum in the definition of R n (t), we can show that n R k 1 (t mk ) R k 1 (t mk 1 ) k=1 W δ A(t mk ) A(t mk 1) + B(t mk ) B(t mk 1) where A and B are finite variation processes and W δ = max j=2,...m n 1 j L k. k=2 W δ is the maximum winding of the path. By independence of unvisited disjoint rectangles, we can show that the tail probability of this W δ has exponential decay, and hence in particular its moments are all bounded.

Idea of the Proof: Driving term convergence of the +CBP Then we can use a version of the Kolmogorov-Centsov continuity theorem to show that n R k 1 (t mk ) R k 1 (t mk 1 ) k=1 is a finite (1 + ɛ)-variation process for all sufficiently small ɛ > 0, see Young (1936) and Lyons and Qian (2002). Hence we should be able to embed M n into a continuous time ɛ-semimartingale M t so that ξ t should converge (subsequentially) to M t as the mesh size δ 0. From this we deduce that the Loewner driving function of the bond percolation exploration path also converges subsequentially to an ɛ-semimartingale.

Idea of the Proof: The locality property The bond percolation exploration path satisfies the locality property: This means for any domain D with 0 D and D H 0, the bond percolation exploration process from 0 to b in D is identically distributed to the bond percolation exploration process from 0 to in H until first exit time of D H.

Idea of the Proof: The locality property (cont.) Hence conditioned on γ[0, s], the bond percolation exploration process in H \ γ[0, s] is identically distributed to the bond percolation exploration process in H until first exit time of the common domain. This means that the driving function of the scaling limit of the bond percolation exploration path, W t = t 0 X sdb s + Y t, satisfies a self-similarity property which leads to the following formula. t t t ( ) W t+s W s X s d B X s + Φ 2 s(w s )dy s + s Φ 0 0 0 2 3 s (W s ) Φ s(w s ) 2 ds

Idea of the Proof: The locality property (cont.) W t+s W s t 0 t t ( ) X s d B X s + Φ 2 s(w s )dy s + s Φ 0 0 2 3 s (W s ) Φ s(w s ) 2 ds This implies that the martingale part of W t is infinitely divisible. The Lévy-Khintchine Theorem implies that the martingale part must be κb t for some κ R. Similarly, we can show that Y t is of finite variation using infinite divisibility. A Girsanov s Theorem argument then implies that κ = 6. Then symmetry and infinite divisibility again imply that Y t = 0. Hence W t = 6B t. Since every subsequential limit is 6B t this implies that the driving function of the full scaling limit must be 6B t.

Idea of the Proof: Full curve convergence We either use the machinery of Camia and Newman (2007) or the recent result of Sheffield and Sun (2012) to deduce that the bond percolation exploration path converges to SLE 6 in the scaling limit. Argument of Sheffield and Sun: seeing the bond percolation exploration path from a point other infinity, and hence a radial Loewner differential equations results: ġ t (z) = g t (z) eiλt + g t (z) e iλt g t (z), where g t (γ(t)) = e iλt is the radial driving function. Using essentially the same argument for chordal version, same conclusion results. This proves the whole theorem.

The End.