2015
Nov
03

# Dynamics & probability: Asaf Nachmias (Tel Aviv)

2:00pm to 3:00pm

## Location:

Manchester building, Hebrew University of Jerusalem, (Room 209)

Title: Indistinguishability of trees in uniform spanning forests
Abstract:
The uniform spanning forest (USF) of an infinite connected graph G is the weak limit of the uniform spanning tree measure taken on exhausting finite subgraphs of G. It is easy to see that it is supported on spanning graphs of G with no cycles, but it need not be connected. Indeed, a classical result of Pemantle ('91) asserts that when G=Zd, the USF is almost surely a connected tree if and only if d=1,2,3,4.