Local statistics of the abelian sandpile model David B. Wilson TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A.

Slides:



Advertisements
Similar presentations
The Primal-Dual Method: Steiner Forest TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A AA A A A AA A A.
Advertisements

The Cover Time of Random Walks Uriel Feige Weizmann Institute.
Matroid Bases and Matrix Concentration
Exact Inference in Bayes Nets
Small Subgraphs in Random Graphs and the Power of Multiple Choices The Online Case Torsten Mütze, ETH Zürich Joint work with Reto Spöhel and Henning Thomas.
Upper bounds for asymmetric Ramsey properties of random graphs Reto Spöhel, ETH Zürich Joint work with Yoshiharu Kohayakawa, Universidade de São Paulo.
On the monotonicity of the expected volume of a random simplex Luis Rademacher Computer Science and Engineering The Ohio State University TexPoint fonts.
Circles in Aztec Diamonds. Aztec Diamonds in Groves. Circles in Groves? Limiting Behavior of Combinatorial Models.
Boundary Partitions in Trees and Dimers Richard W. Kenyon and David B. Wilson University of British Columbia Brown University Microsoft Research (Connection.
The double-dimer model and skew Young diagrams Richard W. Kenyon David B. Wilson Brown University Microsoft Research TexPoint fonts used in EMF. Read the.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees Nick Harvey U. Waterloo Department of Combinatorics and Optimization Joint work with Isaac.
Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees Nick Harvey University of Waterloo Department of Combinatorics and Optimization Joint.
Graph Sparsifiers by Edge-Connectivity and Random Spanning Trees Nick Harvey U. Waterloo C&O Joint work with Isaac Fung TexPoint fonts used in EMF. Read.
Max-Min Fair Allocation of Indivisible Goods Amin Saberi Stanford University Joint work with Arash Asadpour TexPoint fonts used in EMF. Read the TexPoint.
Coloring the edges of a random graph without a monochromatic giant component Reto Spöhel (joint with Angelika Steger and Henning Thomas) TexPoint fonts.
Continuous Random Variables. For discrete random variables, we required that Y was limited to a finite (or countably infinite) set of values. Now, for.
Graphs CS-240/341. Uses for Graphs computer networks and routing airline flights geographic maps course prerequisite structures tasks for completing a.
Rectangle Visibility Graphs: Characterization, Construction, Compaction Ileana Streinu (Smith) Sue Whitesides (McGill U.)
What is the next line of the proof? a). Let G be a graph with k vertices. b). Assume the theorem holds for all graphs with k+1 vertices. c). Let G be a.
Probabilistic one-player vertex-coloring games via deterministic two-player games The deterministic game Torsten Mütze, ETH Zürich Joint work with Thomas.
Cache Performance Analysis of Traversals and Random Accesses R. E. Ladner, J. D. Fix, and A. LaMarca Presented by Tomer Shiran.
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Small Subgraphs in Random Graphs and the Power of Multiple Choices The Online Case Torsten Mütze, ETH Zürich Joint work with Reto Spöhel and Henning Thomas.
Gaussians Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read the TexPoint.
cover times, blanket times, and majorizing measures Jian Ding U. C. Berkeley James R. Lee University of Washington Yuval Peres Microsoft Research TexPoint.
The Magnetic Field of a Solenoid AP Physics C Montwood High School R. Casao.
Joint Distribution of two or More Random Variables
On Rearrangements of Fourier Series Mark Lewko TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AAA A AAA A A A A.
L7.1b Continuous Random Variables CONTINUOUS RANDOM VARIABLES NORMAL DISTRIBUTIONS AD PROBABILITY DISTRIBUTIONS.
Fluid Limits for Gossip Processes Vahideh Manshadi and Ramesh Johari DARPA ITMANET Meeting March 5-6, 2009 TexPoint fonts used in EMF. Read the TexPoint.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
1 7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to.
Graph Sparsifiers Nick Harvey Joint work with Isaac Fung TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A.
An algorithmic proof of the Lovasz Local Lemma via resampling oracles Jan Vondrak IBM Almaden TexPoint fonts used in EMF. Read the TexPoint manual before.
Boundary Partitions in Trees and Dimers Richard W. Kenyon and David B. Wilson University of British ColumbiaMicrosoft Research (Connection probabilities.
Ad Hoc and Sensor Networks – Roger Wattenhofer –3/1Ad Hoc and Sensor Networks – Roger Wattenhofer – Topology Control Chapter 3 TexPoint fonts used in EMF.
Multiple Random Variables Two Discrete Random Variables –Joint pmf –Marginal pmf Two Continuous Random Variables –Joint Distribution (PDF) –Joint Density.
Continuous Variables Write message update equation as an expectation: Proposal distribution W t (x t ) for each node Samples define a random discretization.
Theory of impedance networks: A new formulation F. Y. Wu FYW, J. Phys. A 37 (2004)
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
Prof. David R. Jackson ECE Dept. Fall 2014 Notes 15 ECE 2317 Applied Electricity and Magnetism 1.
PROBABILITY AND STATISTICS FOR ENGINEERING Hossein Sameti Department of Computer Engineering Sharif University of Technology Two Random Variables.
Planar graphs with no 5- cycles, 6-cycles or intersecting triangles are 3-colorable Carl Yerger, Davidson College Clemson Mini-Conference 2012.
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Embeddings, flow, and cuts: an introduction University of Washington James R. Lee.
On sets of large doubling, ¤ (4) sets, and error-correcting codes Allison LewkoMark Lewko Columbia University Institute for Advanced Study TexPoint fonts.
An algorithmic proof of the Lovasz Local Lemma via resampling oracles Jan Vondrak IBM Almaden TexPoint fonts used in EMF. Read the TexPoint manual before.
EEE APPENDIX B Transformation of RV Huseyin Bilgekul EEE 461 Communication Systems II Department of Electrical and Electronic Engineering Eastern.
Chapter 5 Joint Probability Distributions and Random Samples  Jointly Distributed Random Variables.2 - Expected Values, Covariance, and Correlation.3.
Generating Random Spanning Trees via Fast Matrix Multiplication Keyulu Xu University of British Columbia Joint work with Nick Harvey TexPoint fonts used.
An algorithmic proof of the Lovasz Local Lemma via resampling oracles Jan Vondrak IBM Almaden TexPoint fonts used in EMF. Read the TexPoint manual before.
On the path-avoidance vertex-coloring game Torsten Mütze, ETH Zürich Joint work with Reto Spöhel (MPI Saarbrücken) TexPoint fonts used in EMF. Read the.
CHAPTER 7 Determinant s. Outline - Permutation - Definition of the Determinant - Properties of Determinants - Evaluation of Determinants by Elementary.
Contagion in Networks Networked Life NETS 112 Fall 2015 Prof. Michael Kearns.
Applied Electricity and Magnetism
Networked Life NETS 112 Fall 2018 Prof. Michael Kearns
Networked Life NETS 112 Fall 2017 Prof. Michael Kearns
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
Networked Life NETS 112 Fall 2016 Prof. Michael Kearns
TexPoint fonts used in EMF.
CS723 - Probability and Stochastic Processes
GRAPHS Lecture 17 CS2110 Spring 2018.
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
1 cm 1 cm 1 cm.
7. Two Random Variables In many experiments, the observations are expressible not as a single quantity, but as a family of quantities. For example to record.
Chromatic Number of the Odd-Distance Graph
Agenda Bell Ringer Bell Ringer
CS723 - Probability and Stochastic Processes
Networked Life NETS 112 Fall 2019 Prof. Michael Kearns
Presentation transcript:

Local statistics of the abelian sandpile model David B. Wilson TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAA A

Key ingredients Bijection between ASM’s and spanning trees: Dhar Majumdar—Dhar Cori—Le Borgne Bernardi Athreya—Jarai Basic properties of spanning trees Pemantle Benjamini—Lyons—Peres—Schramm Computation of topologically defined events for spanning trees Kenyon—Wilson

[sandpile demo]

Infinite volume limit Infinite volume limit exists (Athreya—Jarai ’04) Pr[h=0]= (Majumdar—Dhar ’91) Other one-site probabilities computed by Priezzhev (’93)

Priezzhev (’94)

Jeng—Piroux—Ruelle (’06)

[burning bijection demo]

Underlying graphUniform spanning tree

Uniform spanning tree on infinite grid Pemantle: limit of UST on large boxes converges as boxes tend to Z^d Pemantle: limiting process has one tree if d 4

UST and LERW on Z^2 Benjamini-Lyons-Peres-Schramm: UST on Z^d has one end if d>1, i.e., one path to infinity

Local statistics of UST Local statistics of UST can be computed via determinants of transfer impedance matrices (Burton—Pemantle) Why doesn’t this give local statistics of sandpiles?

Sandpile density and LERW Conjecture: path to infinity visits neighbor to right with probability 5/16 (Levine—Peres, Poghosyan—Priezzhev)

Sandpile density and LERW Theorem: path to infinity visits neighbor to right with probability 5/16 (Poghosyan-Priezzhev-Ruelle, Kenyon-W) JPR integral evaluates to ½ (Caracciolo—Sportiello)

Kenyon—W

Joint distribution of heights at two neighboring vertices

Higher dimensional marginals of sandpile heights Pr[3,2,1,0 in 4x1 rectangle] =

Sandpiles on hexagonal lattice (One-site probabilities also computed by Ruelle)

Sandpiles on triangular lattice

Groves: graph with marked nodes

Uniformly random grove

Goal: compute ratios of partition functions in terms of electrical quantities

Arbitrary finite graph with two special nodes Kirchhoff’s formula for resistance 3 spanning trees 5 2-tree forests with nodes 1 and 2 separated

Arbitrary finite graph with two special nodes (Kirchoff) 3 three

Arbitrary finite graph with four special nodes? All pairwise resistances are equal Need more than boundary measurements (pairwise resistances) Need information about internal structure of graph

Planar graph Special vertices called nodes on outer face Nodes numbered in counterclockwise order along outer face Circular planar graphs circular planar planar, not circular planar