Weak Convergence of Laws of Finite Graphs

Details Weak Convergence of Laws of Finite Graphs Weak Convergence of Laws of Finite Graphs

2011-03-29

arxiv.org/abs/1103.5517v1

Mathematics

Combinatorics

This is a Fall 2010 Honours research project done under the supervision of Dr. Vladimir Pestov at the University of Ottawa; 33

Scientific paper

The law of a finite graph is a probability measure induced by the orbits of the graph under its automorphism group. Every law satisfies the intrinsic mass transport principle, which is also known as unimodularity. We discuss the convergence of sequences of laws of finite graphs. Of particular importance is a conjecture proposed by Aldous and Lyons that claims every unimodular measure is a limit of a sequence of laws. Aside from this open problem, other directions of research are also mentioned. We work out in detail a number of results and examples, some of which are new, and others that have been previously stated without proofs. These results include a new characterization of laws of finite connected graphs, a description of the topological space of paths, and a proof that the compact space of weak limits of laws is convex.

Affiliated with

Also associated with

No associations

Rating

Weak Convergence of Laws of Finite Graphs 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 Weak Convergence of Laws of Finite Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Weak Convergence of Laws of Finite Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-162495