Skip to main content
Article thumbnail
Location of Repository

Weak Convergence of Laws of Finite Graphs

By Igor Artemenko

Abstract

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.Comment: This is a Fall 2010 Honours research project done under the supervision of Dr. Vladimir Pestov at the University of Ottawa; 33 pages, 5 figures, uses tkz-graph.st

Topics: Mathematics - Combinatorics, 05C99
Year: 2011
OAI identifier: oai:arXiv.org:1103.5517
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.5517 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.