Augusto Teixeira (IMPA)



Similar documents
INDISTINGUISHABILITY OF ABSOLUTELY CONTINUOUS AND SINGULAR DISTRIBUTIONS

The positive minimum degree game on sparse graphs

ON DEGREES IN THE HASSE DIAGRAM OF THE STRONG BRUHAT ORDER

Every tree contains a large induced subgraph with all degrees odd

arxiv: v1 [math.pr] 5 Dec 2011

SEQUENCES OF MAXIMAL DEGREE VERTICES IN GRAPHS. Nickolay Khadzhiivanov, Nedyalko Nenov

All trees contain a large induced subgraph having all degrees 1 (mod k)

Stationary random graphs on Z with prescribed iid degrees and finite mean connections

An algorithmic classification of open surfaces

arxiv: v1 [math.co] 7 Mar 2012

A PRIORI ESTIMATES FOR SEMISTABLE SOLUTIONS OF SEMILINEAR ELLIPTIC EQUATIONS. In memory of Rou-Huai Wang

Exponential time algorithms for graph coloring

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Graphs without proper subgraphs of minimum degree 3 and short cycles

An inequality for the group chromatic number of a graph

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

Connectivity and cuts

Sequence of Mathematics Courses

x a x 2 (1 + x 2 ) n.

Finitely Additive Dynamic Programming and Stochastic Games. Bill Sudderth University of Minnesota

Duality of linear conic problems

The Heat Equation. Lectures INF2320 p. 1/88

EXIT TIME PROBLEMS AND ESCAPE FROM A POTENTIAL WELL

BOUNDED COHOMOLOGY CHARACTERIZES HYPERBOLIC GROUPS

Smooth functions statistics

Odd induced subgraphs in graphs of maximum degree three

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Cycles in a Graph Whose Lengths Differ by One or Two

LECTURE 15: AMERICAN OPTIONS

Total colorings of planar graphs with small maximum degree

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

CURVES WHOSE SECANT DEGREE IS ONE IN POSITIVE CHARACTERISTIC. 1. Introduction

Low upper bound of ideals, coding into rich Π 0 1 classes

Influences in low-degree polynomials

Cacti with minimum, second-minimum, and third-minimum Kirchhoff indices

On an anti-ramsey type result

About the inverse football pool problem for 9 games 1

Labeling outerplanar graphs with maximum degree three

A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

FOUNDATIONS OF ALGEBRAIC GEOMETRY CLASS 22

On end degrees and infinite cycles in locally finite graphs

THE BANACH CONTRACTION PRINCIPLE. Contents

8.1 Examples, definitions, and basic properties

Metric Spaces. Chapter 1

CONSTANT-SIGN SOLUTIONS FOR A NONLINEAR NEUMANN PROBLEM INVOLVING THE DISCRETE p-laplacian. Pasquale Candito and Giuseppina D Aguí

No: Bilkent University. Monotonic Extension. Farhad Husseinov. Discussion Papers. Department of Economics

A simple criterion on degree sequences of graphs

SOLUTIONS TO ASSIGNMENT 1 MATH 576

The Henstock-Kurzweil-Stieltjes type integral for real functions on a fractal subset of the real line

s-convexity, model sets and their relation

SCORE SETS IN ORIENTED GRAPHS

Linear Programming I

1. Introduction. PROPER HOLOMORPHIC MAPPINGS BETWEEN RIGID POLYNOMIAL DOMAINS IN C n+1

Parabolic Equations. Chapter 5. Contents Well-Posed Initial-Boundary Value Problem Time Irreversibility of the Heat Equation

A STABILITY RESULT ON MUCKENHOUPT S WEIGHTS

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

Diablo Valley College Catalog

Row Ideals and Fibers of Morphisms

Finite speed of propagation in porous media. by mass transportation methods

136 CHAPTER 4. INDUCTION, GRAPHS AND TREES

Tree sums and maximal connected I-spaces

ABSTRACT. For example, circle orders are the containment orders of circles (actually disks) in the plane (see [8,9]).

FIRST YEAR CALCULUS. Chapter 7 CONTINUITY. It is a parabola, and we can draw this parabola without lifting our pencil from the paper.

On the largest prime factor of x 2 1

Mathematics 31 Pre-calculus and Limits

Cycles and clique-minors in expanders

COURSE SYLLABUS Pre-Calculus A/B Last Modified: April 2015

RANDOM INTERVAL HOMEOMORPHISMS. MICHA L MISIUREWICZ Indiana University Purdue University Indianapolis

1 if 1 x 0 1 if 0 x 1

Lecture 1: Course overview, circuits, and formulas

CS 598CSC: Combinatorial Optimization Lecture date: 2/4/2010

9 More on differentiation

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

Finding and counting given length cycles

2.3 Convex Constrained Optimization Problems

UNIVERSITY GRADUATE STUDIES PROGRAM SILLIMAN UNIVERSITY DUMAGUETE CITY. Master of Science in Mathematics

Powers of Two in Generalized Fibonacci Sequences

Classification of Cartan matrices

Embedding nearly-spanning bounded degree trees

ON THE NUMBER OF REAL HYPERSURFACES HYPERTANGENT TO A GIVEN REAL SPACE CURVE

Conductance, the Normalized Laplacian, and Cheeger s Inequality

Factoring & Primality

Trimming a Tree and the Two-Sided Skorohod Reflection

Lectures 5-6: Taylor Series

Max-Min Representation of Piecewise Linear Functions

Basic Concepts of Point Set Topology Notes for OU course Math 4853 Spring 2011

On the existence of G-equivariant maps

ARBITRAGE-FREE OPTION PRICING MODELS. Denis Bell. University of North Florida

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Transcription:

Augusto Teixeira (IMPA)

partially joint with Elisabetta Candellero (Warwick) Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 1 / 19

Percolation Physical phenomenon: Fluid through porous medium Material sciences, epidemics, networks Main motivations: Phase transition Universality Challanges Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 2 / 19

Mathematical model Broadbent, Hammersley 57 Infinite graph G = (V, E), e.g. Z d Parameter p [0, 1] Open each vertex x V independently with probability p Connectivity properties of the induced subgraph Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 3 / 19

Phase transition p = 0.500 p = 0.593 p = 0.700 Is the origin connected to infinity? θ(p) 1 θ(p) = P[o ] p c (G) = sup{p; θ(p) = 0} 0 p c 1 p Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 4 / 19

On Z d A lot is known: d 2 non-trivial transition (p c (0, 1)) not true for d = 1 d 2 θ smooth for p > p c d 11 θ continuous + critical behavior d = 2 θ continuous + critical behaviour Still a lot to learn: θ continuous for all d? critical behavior for all d? Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 5 / 19

Other graphs Is p c (G) (0, 1)? If degree G bounded by p c 1/. What about p c (G) < 1? The first step in a study of percolation on other graphs ( ) will be to prove that the critical probability on these graphs is smaller than one. Benjamini, Schramm Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 6 / 19

Other graphs We know p c (G) < 1 for: Regular trees (strong symmetries) Expanders [Benjamini, Schramm] Cayley: with exponential growth [Lyons] Cayley: finitely generated, with one end [Babson, Benjamini] Cayley: intermediate growth [Muchnik, Pak] Techniques range from Entropy vs energy Transport principle Analytical tools Homology... Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 7 / 19

Isoperimetric inequalities p c (Z 1 ) = 1, does dimension play a role? On R d, every compact A Z d with smooth boundary: A c d A (d 1)/d (recall B = c d B (d 1)/d ) Definition dim(g) d def inf A V ; finite A A (d 1)/d > 0 Examples: Z d, Sirpinsky graphs, regular trees... Very useful concept to study random walks on G Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 8 / 19

Benjamini-Schramm s question Question Is it true that dim(g) > 1 implies p c (G) < 1? Two results in this direction: Theorem (Kozma) If G is planar, with polynomial growth, no accumulation points then: dim(g) > 1 p c (G) < 1. Theorem (Candellero, T.) If G is transitive, with polynomial growth, then: dim(g) > 1 p c (G) < 1. Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 9 / 19

Local isoperimetric inequalities Definition - local isoperimetric dimension dim l (G) d def inf B=B(x,r) inf A B; A B /2 B A A (d 1)/d > 0 Counterexamples: regular trees, two Z d s glued... Theorem (T.) If G has polynomial growth, then: dim l (G) > 1 p c (G) < 1. Moreover, p u (G) < 1, dependent models, Ising [Häggström]. Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 10 / 19

Renormalization Multi-scale, in a nutshell: Coarse-graining procedure Process dynamics Geometry aware Robust to changes Well adapted for perturbative systems Well adapted for Z d Various models: rwre, sand-piles, interface motion... Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 11 / 19

Renormalization example Let us show p c (Z 2 ) > 0: L k = 5 k, for k 0 A k+1 A k A k q k+1 10000q 2 k A k = L k f (p) = cp 2 3L k q k (p) = P[A k ] 0 p 3L k+1 L k Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 12 / 19

Renormalization steps Multi-scale, a perturbative recipe: Find suitable scale sequence L k Get a paving structure on G Define bad events A k Show A k cascades Chose parameter to start induction A few advantages: Very resilient to changes in the model Provides quantitative estimates Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 13 / 19

Hypotheses Polynomial growth Allows paving: Local isoperimetric inequality Big flow between sets: Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 14 / 19

Separation events A A Lemma The separation events are cascading. S(x, L) = there exist sets A, A in B(x, L) with diameters L/100 and which are not connected

Separation events A A Lemma The separation events are cascading. S(x, L) = there exist sets A, A in B(x, L) with diameters L/100 and which are not connected

Separation events A A Lemma The separation events are cascading. S(x, L) = there exist sets A, A in B(x, L) with diameters L/100 and which are not connected Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 15 / 19

Classic isoperimetric inequality The arms from A and A need not meet: A A Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 16 / 19

Embedding a tree Transitivity implies a tree could be embedded in G: Contradicting polynomial growth. Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 17 / 19

Bibliography Itai Benjamini and Oded Schramm, Percolation beyond Z d, many questions and a few answers, Electron. Comm. Probab. 1 (1996), no. 8, 71 82. Gady Kozma, Percolation, perimetry, planarity., Rev. Mat. Iberoam. 23 (2007), no. 2, 671 676 (English). Russell Lyons, Random walks and the growth of groups, C. R. Acad. Sci. Paris Sér. I Math. 320 (1995), no. 11, 1361 1366. Russell Lyons and Yuval Peres, Probability on trees and networks, Cambridge University Press, Cambridge, 2011. A. Teixeira, Percolation and local isoperimetric inequalities, ArXiv e-prints (2014). E. Candellero and A. Teixeira, Percolation and isoperimetry on transitive graphs, preprint (2015). Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 18 / 19

Thank you! Augusto Teixeira (IMPA) Percolation and isoperimetry SPA - Oxfort, 2015 19 / 19