Graphings and Unimodularity

Details Graphings and Unimodularity Graphings and Unimodularity

2012-03-11

arxiv.org/abs/1203.2346v1

The Waterloo Mathematics Review, Volume 1, Issue 3, 2011, pp. 17-32

Mathematics

Combinatorics

This article is based on the research done in the Summer of 2011 under the supervision of Dr. Vladimir Pestov; 18 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Graphings and Unimodularity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Graphings and Unimodularity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphings and Unimodularity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14630