This cute animation reminded me of this paper of Kenyon and Wilson on the combinatorics of electrical circuits: http://www.ams.org/journals/tran/2011-363-03/S0002-9947-2010-04964-5/home.html … In their terms, this graph is an example of a "grove" on a ~20x20 square grid with ~80 red+blue "nodes". 1/3https://twitter.com/jagarikin/status/1130995437891047426 …
-
-
The grove in the animation yields a partition called the "uncrossing" as there are no crossings (paths between nodes). Crossings (when they exist) are related to loop-erased random walks and their continuum limits are "multichordal SLE₂" curves! 3/3pic.twitter.com/HvCCTCyM9w
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.