Percolation on isoradial graphs Ioan Manolescu Joint work with - PowerPoint PPT Presentation

Isoradial graphs – details Isoradial Graphs G isoradial graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Track system Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Isoradial Graphs G isoradial graph G ∗ dual isoradial graph G � diamond graph Track system Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 11 / 25

Isoradial graphs – details Conditions Conditions for isoradial graphs. Bounded angles condition : There exist ǫ 0 > 0 such that for any edge e , θ e ∈ [ ǫ 0 , π − ǫ 0 ]. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 12 / 25

Isoradial graphs – details Conditions Conditions for isoradial graphs. Bounded angles condition : There exist ǫ 0 > 0 such that for any edge e , θ e ∈ [ ǫ 0 , π − ǫ 0 ]. t 0 t − 1 t 1 s 2 Square grid property : s 1 Families of ”parallel” tracks ( s i ) i ∈ Z and ( t j ) j ∈ Z . The number of intersections on s i between s 0 t j and t j +1 is uniformly bounded by a con- stant I . (same for t ). Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 12 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Isoradial graphs – details Conditions Examples: Penrose tilings and no square grid Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 13 / 25

Star–triangle transformation Star–triangle transformation A A p 2 p 1 O B B p 0 C C κ △ ( p ) = p 0 + p 1 + p 2 − p 0 p 1 p 2 = 1 . Take ω , respectively ω ′ , according to the measure on the left, respectively right. The families of random variables � � � ω ′ � ω x ← → y : x , y = A , B , C , x ← → y : x , y = A , B , C , have the same joint law. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 14 / 25

Star–triangle transformation Coupling T (1 − p 0 ) p 1 p 2 p 0 (1 − p 1 ) p 2 p 0 p 1 (1 − p 2 ) p 0 p 1 p 2 P P P P T and similarly for all single edges T S S and similarly for all pairs of edges S (1 − p 0 ) p 1 p 2 p 0 (1 − p 1 ) p 2 p 0 p 1 (1 − p 2 ) p 0 p 1 p 2 P P P P where P = (1 − p 0 )(1 − p 1 )(1 − p 2 ) . Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 15 / 25

Star–triangle transformation Path transformation A A O B C B C A A A O B C B C B C A A O B C B C Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 16 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Track exchange Two parallel tracks s 1 and s 2 with no intersection between them. We may exchange s 1 and s 2 using star–triangle transformations. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 17 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Initial Principal Secondary Probability configuration outcome outcome of secondary outcome θ 2 p π − θ 1 p θ 2 p θ 1 p π − θ 2 θ 1 θ 2 Open paths are p π − θ 1 p π − θ 2+ θ 1 preserved (unless p θ 1 p θ 2 − θ 1 θ 1 the deleted edge was θ 2 part of the path). p θ 2 p π − θ 2+ θ 1 p π − θ 2 p θ 2 − θ 1 θ 1 θ 2 p θ 2 p π − θ 2+ θ 1 p π − θ 2 p θ 2 − θ 1 θ 1 θ 2 p π − θ 1 p π − θ 2+ θ 1 p θ 1 p θ 2 − θ 1 θ 1 Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 18 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Strategy Proposition If two isoradial square lattices have same transverse angles for the vertical/horizontal tracks, and one has the box-crossing property, then so does the other. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 19 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Strategy Proposition If two isoradial square lattices have same transverse angles for the vertical/horizontal tracks, and one has the box-crossing property, then so does the other. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 19 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

From Z 2 to isoradial square lattice. Proof for box-crossing property Transport of horizontal crossings Construct a mixed isoradial square lattice: ”regular” in the gray part, ”irregular” in the rest. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 20 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property From square lattices to general graphs Track stacking P gen ( C h [ B ( ρ N , N )]) ≥ P sq ( C h [ B ( I ρ N , N )]) P sq ( C v [ B ( N , N )]) 2 Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 21 / 25

Proof for box-crossing property Arm exponents Transport of the arm exponents . . . . . . using the same strategy as for the box-crossing property. Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 22 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices c 1 P reg ( A k ( n )) ≤ P irreg ( A k ( n )) Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices c 1 P reg ( A k ( n )) ≤ P irreg ( A k ( n )) Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25

Proof for box-crossing property Arm exponents Square lattices c 1 P reg ( A k ( n )) ≤ P irreg ( A k ( n )) ≤ c 2 P reg ( A k ( n )) . Ioan Manolescu (University of Geneva) Percolation on isoradial graphs 15 August 2013 23 / 25