Graphings and Unimodularity
arXiv:1203.2346
Abstract
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures. Furthermore, we work out in full detail a proof of a known result, which states that weak limits preserve unimodularity.
This article is based on the research done in the Summer of 2011 under the supervision of Dr. Vladimir Pestov; 18 pages