SLE and conformal invariance for critical Ising model jointly with Dmitry Chelkak 3rd LA PIETRA WEEK IN PROBABILITY Stochastic Models in Physics Firenze,

Slides:



Advertisements
Similar presentations
AIM, Palo Alto, August 2006 T. Witten, University of Chicago.
Advertisements

Clustering in Interfering Binary Mixtures Sarah Miracle, Dana Randall, Amanda Streib Georgia Institute of Technology.
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
It’s a Small World by Jamie Luo. Introduction Small World Networks and their place in Network Theory An application of a 1D small world network to model.
Belief Propagation by Jakob Metzler. Outline Motivation Pearl’s BP Algorithm Turbo Codes Generalized Belief Propagation Free Energies.
Lecture 3: Markov processes, master equation
Entropy Rates of a Stochastic Process
6.896: Probability and Computation Spring 2011 Constantinos (Costis) Daskalakis lecture 2.
Online Ramsey Games in Random Graphs Reto Spöhel Joint work with Martin Marciniszyn and Angelika Steger.
Easy Optimization Problems, Relaxation, Local Processing for a single variable.
Spin correlated dynamics on Bethe lattice Alexander Burin.
1 Def: Let and be random variables of the discrete type with the joint p.m.f. on the space S. (1) is called the mean of (2) is called the variance of (3)
Convergent and Correct Message Passing Algorithms Nicholas Ruozzi and Sekhar Tatikonda Yale University TexPoint fonts used in EMF. Read the TexPoint manual.
The Potts and Ising Models of Statistical Mechanics.
Online Ramsey Games in Random Graphs Reto Spöhel Joint work with Martin Marciniszyn and Angelika Steger.
The Markov property Discrete time: A time symmetric version: A more general version: Let A be a set of indices >k, B a set of indices
1 Cluster Monte Carlo Algorithms & softening of first-order transition by disorder TIAN Liang.
Online Vertex Colorings of Random Graphs Without Monochromatic Subgraphs Reto Spöhel, ETH Zurich Joint work with Martin Marciniszyn.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Easy Optimization Problems, Relaxation, Local Processing for a single variable.
Universal adiabatic dynamics across a quantum critical point Anatoli Polkovnikov, Boston University.
Geometric characterization of nodal domains Y. Elon, C. Joas, S. Gnutzman and U. Smilansky Non-regular surfaces and random wave ensembles General scope.
The Ising Model of Ferromagnetism by Lukasz Koscielski Chem 444 Fall 2006.
Online Ramsey Games in Random Graphs Reto Spöhel, ETH Zürich Joint work with Martin Marciniszyn and Angelika Steger.
6. Markov Chain. State Space The state space is the set of values a random variable X can take. E.g.: integer 1 to 6 in a dice experiment, or the locations.
Information Networks Power Laws and Network Models Lecture 3.
Review of Statistical Inference Prepared by Vera Tabakova, East Carolina University ECON 4550 Econometrics Memorial University of Newfoundland.
Presentation in course Advanced Solid State Physics By Michael Heß
The Ising model of a ferromagnet
Geometry of Domain Walls in disordered 2d systems C. Schwarz 1, A. Karrenbauer 2, G. Schehr 3, H. Rieger 1 1 Saarland University 2 Ecole Polytechnique.
F.F. Assaad. MPI-Stuttgart. Universität-Stuttgart Numerical approaches to the correlated electron problem: Quantum Monte Carlo.  The Monte.
Percolation in self-similar networks Dmitri Krioukov CAIDA/UCSD M. Á. Serrano, M. Boguñá UNT, March 2011.
A Markov Random Field Model for Term Dependencies Donald Metzler W. Bruce Croft Present by Chia-Hao Lee.
1 Worm Algorithms Jian-Sheng Wang National University of Singapore.
Online Vertex-Coloring Games in Random Graphs Reto Spöhel (joint work with Martin Marciniszyn; appeared at SODA ’07)
Maximum Likelihood Estimator of Proportion Let {s 1,s 2,…,s n } be a set of independent outcomes from a Bernoulli experiment with unknown probability.
The Ising Model Mathematical Biology Lecture 5 James A. Glazier (Partially Based on Koonin and Meredith, Computational Physics, Chapter 8)
Local Theory of BER for LDPC Codes: Instantons on a Tree Vladimir Chernyak Department of Chemistry Wayne State University In collaboration with: Misha.
8. Selected Applications. Applications of Monte Carlo Method Structural and thermodynamic properties of matter [gas, liquid, solid, polymers, (bio)-macro-
Convergent sequences of sparse graphs (status report) László Lovász Eötvös University, Budapest.
Percolation Processes Rajmohan Rajaraman Northeastern University, Boston May 2012 Chennai Network Optimization WorkshopPercolation Processes1.
Model under consideration: Loss system Collection of resources to which calls with holding time  (c) and class c arrive at random instances. An arriving.
1 Cluster Monte Carlo Algorithms: Jian-Sheng Wang National University of Singapore.
Consistency An estimator is a consistent estimator of θ, if , i.e., if
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Austin Howard & Chris Wohlgamuth April 28, 2009 This presentation is available at
Week 41 How to find estimators? There are two main methods for finding estimators: 1) Method of moments. 2) The method of Maximum likelihood. Sometimes.
1 Probability and Statistical Inference (9th Edition) Chapter 5 (Part 2/2) Distributions of Functions of Random Variables November 25, 2015.
Chapter Relations and Their Properties
1 Probability and Statistical Inference (9th Edition) Chapter 4 Bivariate Distributions November 4, 2015.
Percolation in self-similar networks PRL 106:048701, 2011
Graduate School of Information Sciences, Tohoku University
Javier Junquera Importance sampling Monte Carlo. Cambridge University Press, Cambridge, 2002 ISBN Bibliography.
Seminar in SPB, April 4, 2011 Harmonic measure of critical curves and CFT Ilya A. Gruzberg University of Chicago with E. Bettelheim, I. Rushkin, and P.
Week 31 The Likelihood Function - Introduction Recall: a statistical model for some data is a set of distributions, one of which corresponds to the true.
Superstabilizing Protocols for Dynamic Distributed Systems Authors: Shlomi Dolev, Ted Herman Presented by: Vikas Motwani CSE 291: Wireless Sensor Networks.
IPAM Workshop “Random Shapes, Representation Theory, and CFT”, March 26, 2007 Harmonic measure of critical curves and CFT Ilya A. Gruzberg University of.
Conditional Expectation
Ch 6. Markov Random Fields 6.1 ~ 6.3 Adaptive Cooperative Systems, Martin Beckerman, Summarized by H.-W. Lim Biointelligence Laboratory, Seoul National.
Week 21 Statistical Model A statistical model for some data is a set of distributions, one of which corresponds to the true unknown distribution that produced.
Computational Physics (Lecture 10) PHY4370. Simulation Details To simulate Ising models First step is to choose a lattice. For example, we can us SC,
Markov random fields. The Markov property Discrete time: A time symmetric version: A more general version: Let A be a set of indices >k, B a set of indices.
Statistics and probability Dr. Khaled Ismael Almghari Phone No:
Main topics in the course on probability theory
Percolation Density Contours
11. Cluster Algorithms.
Localizing the Delaunay Triangulation and its Parallel Implementation
A Computational Approach to Percolation Theory
Markov Random Fields Presented by: Vladan Radosavljevic.
Introducing complex networks into quantum regime
Presentation transcript:

SLE and conformal invariance for critical Ising model jointly with Dmitry Chelkak 3rd LA PIETRA WEEK IN PROBABILITY Stochastic Models in Physics Firenze, June 23-27, 2008 Stanislav Smirnov

1D Ising model 0 1.………………………………… N N+1 ….…. + – – – + – – + – + + ∙∙ Z =Σ conf. x #{(+)(-)neighbors}, P [conf.]~x #{(+)(-)} 0≤ x=e -J/kT ≤1. Let σ(0)=“+”. P [σ(N)=“+”] = ?

1D Ising model 0 1.………………………………… N N+1 ….…. + – – – + – – + – + + ∙∙ Z =Σ conf. x #{(+)(-)neighbors}, P [conf.]~x #{(+)(-)} 0≤ x=e -J/kT ≤1. Let σ(0)=“+”. P [σ(N)=“+”] = ? =½(1+y N ), y= (1-x) / (1+x). Z n+1;σ(n+1)=“+” = Z n;σ(n)=“+” + xZ n;σ(n)=“–” Z n+1;σ(n+1)=“–” = xZ n;σ(n)=“+” + Z n;σ(n)=“–”

EXERCISE: Do the same in the magnetic field: P [configuration] ~ x #{(+)(-)} b #{(-)}, b>0, σ(0)=“+”. P [σ(N)=“+”]=?

EXERCISE: Do the same in the magnetic field: P [configuration] ~ x #{(+)(-)} b #{(-)}, b>0, σ(0)=“+”. P [σ(N)=“+”]=? EXERCISE: Let σ(0)=“+”= σ(N+M). P [σ(N)=“+”]=? 0...……………………….. N..……… N+M + – – – + – + – + + – + Check P [σ(N)=“+”] → ½ (if N/M→const ≠ 0,1). [Ising ’25]: NO PHASE TRANSITION AT X≠0 (1D)

2D (spin) Ising model Squares of two colors, representing spins +,– Nearby spins tend to be the same: P [conf.] ~ x #{(+)(-)neighbors} [Peierls ‘36]: PHASE TRANSITION (2D) [Kramers-Wannier ’41]:

σ(boundary of (2N+1)x(2N+1)=“+”) P [σ (0)=“+”]=? P [ ] ≤ x L /(1+x L ) ≤ x L, L=Length of P [σ (0)=“–”] ≤ Σ j=1,..,N Σ L≥2j+2 3 L x L ≤ (3x) 4 /( 1-(3x) 2 )( 1-3x ) ≤ 1/6, if x ≤ 1/6.

2D: Phase transition x → 1 (T → ∞) x=x crit x → 0 (T → 0) (Dobrushin boundary conditions: the upper arc is blue, the lower is red)

2D Ising model at criticality is considered a classical example of conformal invariance in statistical mechanics, which is used in deriving many of its properties. However, No mathematical proof has ever been given. Most of the physics arguments concern nice domains only or do not take boundary conditions into account, and thus only give evidence of the (weaker!) Mobius invariance of the scaling limit. Only conformal invariance of correlations is usually discussed, we ultimately discuss the full picture.

Theorem 1 [Smirnov]. Critical spin-Ising and FK-Ising models on the square lattice have conformally invariant scaling limits as the lattice mesh → 0. Interfaces converge to SLE(3) and SLE(16/3), respectively (and corresponding loop soups). Theorem 2 [Chelkak-Smirnov]. The convergence holds true on arbitrary isoradial graphs (universality for these models).

Ising model on isoradial graphs: P [conf.] ~ Π :σ(j)≠σ(k) X jk X jk = tan(α jk /2 ) σ(j) α jk σ(k)

Some earlier results: LERW → SLE(2) UST → SLE(8) Percolation → SLE(6) [Lawler-Schramm [Smirnov, 2001] -Werner, 2001]

(Spin) Ising model Conigurations: spins +/– P ~ x #{(+)(-)neighbors} = Π [ (1-x)+xδ s(j)=s(k) ]

(Spin) Ising model Conigurations: spins +/– P ~ x #{(+)(-)neighbors} = Π [ (1-x)+xδ s(j)=s(k) ] Expand, for each term prescribe an edge configuration: x : edge is open 1-x : edge is closed open edges connect the same spins (but not all!)

Edwards-Sokol covering ‘88 Conigurations: spins +/–, open edges connect the same spins (but not all of them!) P ~ (1-x) #open x #closed

Fortuin-Kasteleyn (random cluster) model ’72: Conigurations: spins +/–, open edges connect the same spins (but not all of them!) P ~ (1-x) #open x #closed Erase spins: Probability of edge configurations is ~ to (1-x) #open x #clos 2 #clusters or ( (1-x)/x ) #open 2 #clusters

Loop gas representation: Conigurations: dense loop collections. P ~ to ( (1-x)/x ) #open 2 #clusters or ( (1-x)/2 ½ x ) #open 2 ½#loops [ #loops – #open = 2#clusters+const ] Self-dual case: (1-x)/x= 2 ½, i.e. X=1/(1+ 2 ½ )

Spin, FK, Loop gas EXERCISE: P spin [σ(j)=σ(k)] = (1+ P FK [j↔k])/2 EXERCISE: Start with Q different spins (Potts model). Note: Loop gas is well-defined for all positive Q’s!

Outline: Introduction Discrete harmonic/holomorphic functions Holomorphic observables in the Ising model SLE and the interfaces in the Ising model Further developments We will discuss how to Find an discrete holomorphical observable with a conformally invariant scaling limit Using one observable, construct (conformally invariant) scaling limits of a domain wall Possible further topics: Retrieve needed a priori estimates from the observable Construct the full scaling limit Generalize to isoradial graphs (universality) Perturbation p → p crit — no conformal invariance