spanning trees forests and limit shapes
play

spanning trees, forests and limit shapes R. Kenyon (Brown - PowerPoint PPT Presentation

spanning trees, forests and limit shapes R. Kenyon (Brown University) UST on Z 2 Prob(degree = 2) = 1 trunk properties (K, Wilson): 2 2 1) k Prob( ) = ( { k 3 Given a graph G : 4 2 1 Let d : R V R E be the incidence matrix:


  1. spanning trees, forests and limit shapes R. Kenyon (Brown University)

  2. UST on Z 2

  3. Prob(degree = 2) = 1 trunk properties (K, Wilson): 2 √ 2 − 1) k Prob( ) = ( { k

  4. 3 Given a graph G : 4 2 1 Let d : R V → R E be the incidence matrix:   1 − 1 0 0 1 0 − 1 0     1 0 0 − 1     0 1 − 1 0   0 0 1 − 1 Define ∆ = d ∗ Cd, where C is a diagonal matrix of conductances. X ∆ f ( v ) = c vw ( f ( v ) − f ( w )) w ∼ v X Y Thm (Kirchho ff 1865) det ∆ 0 = c e sp. trees e remove a row and column from ∆

  5. Z 2 Example G = ∆ f ( v ) = 4 f ( v ) − f ( v + 1) − f ( v + i ) − f ( v − 1) − f ( v − i ) ∆ is a “convolution” operator; its Fourier transform is multiplication by P ( z, w ): P ( z, w ) = 4 − z − 1 z − w − 1 w. What do the roots of P ( z, w ) = ˆ ∆ tell us about ∆ ? Q.

  6. (potential kernel) The Green’s function G ( x, y ) = − 1 z x w y − 1 Z 4 − z − 1 /z − w − 1 /w dz dw 4 π 2 T 2 For large x, y , the only relevant part of P = 0 is near (1 , 1).

  7. What about a slightly di ff erent setting? 2 2 Periodic conductances: 2 2 2 2 2 2 ✓ ◆ 5 − w − 1 /w − 2 − 1 /z ˆ ∆ = − 2 − z 5 − w − 1 /w ∆ = w 2 + 1 w 2 − 10 w − 10 w − 2 z − 2 P ( z, w ) = det ˆ z + 22

  8. P = 0 has topology away from ( z, w ) = (1 , 1): log | w | 4 2 0 - 2 - 4 - 4 - 2 0 2 4 log | z | Q. What properties of spanning trees involve other points of P = 0? Q. Combinatorially, what is the meaning of the coe ffi cients of P ?

  9. A. The UST is one of a two-parameter family of probability measures indexed by points ( z, w ) on P ( z, w ) = 0. UST ↔ (1 , 1) Other points correspond to measures on “essential spanning forests” sample configuration from another measure (triangular lattice)

  10. On a strip graph, µ 1 µ 2 µ 3 µ 4

  11. “Cube groves” of Carroll/Speyer were discovered in the study the cube recurrence . (2004)

  12. P ( z, w ) counts cycle-rooted spanning forests (CRSFs) on the torus (subgraphs in which each component is a tree plus one edge) Y ! X (2 − z i w j − z − i w − j ) k , P ( z, w ) = Thm: c e e CRSFs C where C has k cycles of homology class ( i, j ). 2 e.g. P ( z, w ) = w 2 + 1 w 2 − 10 w − 10 w − 2 z − 2 z + 22 = 2(2 − z − 1 z ) + (2 − w − 1 w ) 2 + 6(2 − w − 1 w ) N 1 : (+. . . ) The set of homology classes forms a convex polygon N : the Newton polygon of P, symmetric around (0 , 0)

  13. If we enlarge the fundamental domain (take a cover of the torus) ( N 10 = 10 N 1 ) N 10 : for the 10 × 10 cover Real points ( s, t ) in N 1 parametrize measures µ s,t on planar configurations with fixed average slope and density of crossings: a random sample from µ . 3 ,. 5 .

  14. UST CRSFs with average slope 1 / 2

  15. * Thm: The measures µ s,t are determinantal (for edges). The kernel is given by K ( z, w ) [ e ] , [ f ] z x 1 − x 2 w y 1 − y 2 1 ZZ dz dw ( K s,t ) e,f = 4 π 2 P ( z, w ) iz iw | z | = e X , | w | = e Y Note: The only dependence on s, t is in contour of integration. *There is a matrix K such that Pr ( e 1 , . . . , e k ∈ T ) = det[ K ( e i , e j ) i,j =1 ,...,k ]

  16. The free energy (growth rate) of µ s,t is the growth rate of the appropriate coe ffi cient of P n × n ( z, w ): 1000 500 0 20 0 10 - 20 0 - 10 1 n 2 log([ z sn w tn ] P n × n ( z, w )) σ ( s, t ) = lim n →∞

  17. Legendre duality ( s, t ) ↔ ( x, y ) s, t -plane x, y -plane y = log | w | 4 2 r R N 1 : r σ 0 - 2 uncritical points the amoeba of P - 4 - 4 - 2 0 2 4 x = log | z | For s, t an uncritical point, µ s,t has exponential decay of correlations!

  18. If the graph G has larger fundamental domain, the phase space is richer: 10 log | w | 5 0 - 5 - 10 - 10 - 5 0 5 10 log | z |

  19. Boundary connections and limit shapes Given a region with a spanning forest connecting certain boundary vertices...

  20. Find a uniform spanning forest with the same boundary connections...

  21. More generally, start with a CRSF on a multiply connected domain (possibly having certain boundary connections)...and find a uniform sample with same homotopy type and connections.

  22. Limit shapes “measured foliation” Given a domain U ⊂ R 2 and “unsigned 1-form” | dy | satisfying a certain Lipschitz condition: | dy ( u ) | u ∈ N for u ∈ S 1 the limit of the CRSF process | dy ✏ | on U ∩ ✏ Z 2 with local slope approximating | dy | exists, and is the unique unsigned 1-form maximizing ZZ σ ( | dy | ) dA. U

  23. How to sample CRSFs with given topology? ...MCMC add and remove “cubes” whose faces are decorated with spanning tree edges (or dual edges).

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend