Local and global convergence - PowerPoint PPT Presentation

1 / 30
About This Presentation
Title:

Local and global convergence

Description:

Title: Slide 1 Author: lovasz Last modified by: Lov sz L szl Created Date: 11/9/2003 4:09:10 AM Document presentation format: Diavet t s a k perny re (4:3 ... – PowerPoint PPT presentation

Number of Views:66
Avg rating:3.0/5.0
Slides: 31
Provided by: lov53
Category:

less

Transcript and Presenter's Notes

Title: Local and global convergence


1
Dedicated to the Memory of Oded Schramm
Local and global convergence in bounded degree
graphs
László Lovász Eötvös Loránd University, Budapest
Joint work with Christian Borgs, Jennifer Chayes
and Jeff Kahn
2
The Benjamini-Schramm limit
G simple graph with all degrees D
BG(v,r) nodes at distance r from node v
Ar simple rooted graphs with all degrees D
and radius r
v random uniform node ? BG(v,r) random graph in
Ar
PG(A) P(BG(v,r)A)
3
The Benjamini-Schramm limit
A1

4
The Benjamini-Schramm limit
? maximal paths from rooted
countable graphs with degrees D
?A maximal paths through A
A ?-algebra generated by the ?A
P probability measure on (?,A)
P has some special properties
5
Other limit constructions
6
Other limit constructions
?
7
Other limit constructions
Measure preserving graph G(0,1,E) (a) all
degrees D (b) X?0,1 Borel ? N(X) is Borel
R.Kleinberg L
8
Other limit constructions
Graphing G(0,1,E)
Elek
9
Homomorphism functions
10
Homomorphism functions
Examples
11
Homomorphism functions
We know
12
Homomorphism functions
13
Left and right convergence
14
Left and right convergence
15
Examples
16
Examples
Feketes Lemma ? convergence
17
Examples
18
Examples
19
Examples
20
Examples
Construct auxiliary graph G
21
Examples
22
Left and right convergence
23
Analogy the dense case
Left-convergence (homomorphisms from small
graphs)
Right-convergence (homomorphisms into small
graphs)
Distance of two graphs (optimal overlay
convergent?Cauchy)
Limit objects (2-variable functions)
Approximation by bounded-size graphs (Szemerédi
Lemma, sampling)
Parameters continuous at infinity (parameter
testing)
24
Limit objects
25
Limit objects
LS
26
Amenable (hyperfinite) limits
Small cut decomposition
27
Amenable (hyperfinite) limits
G1,G2, amenable (hyperfinite)
Can be decomposed into bounded pieces by small
cut decomposition.
28
Amenable graphs and hyperfinite limits
29
Regularity Lemma?
?-homogeneous ? small cut decomposition, each
piece H satisfies
Every sufficiently large graph of bounded degree
can be decomposed into quasi-homogeneous
pieces by small cuts.
Elek Lippner Angel - Szegedy
30
Regularity Lemma?
Easy observation
Alon
A construction for H? Effective bound on q?
Write a Comment
User Comments (0)
About PowerShow.com