An invariant process on a Cayley graph G is a random labeling of its vertices which is invariant under group multiplications. In this work we answer three natural questions about invariant processes on Cayley graphs. The first asks if there is an invariant planar percolation where both the open and closed vertices span a connected subgraph with critical probability strictly less than 1. The second asks if the existence of a monotone coupling between two invariant random subgraphs implies the existence of a monotone coupling which is also invariant? The third one asks if a factor of independent uniform labeling which also has uniform margins then the components spanned by identically labeled vertices must be finite? We show that in each case a relevant example does exist. In the way the questions are formulated this means that the answer to the first question is "yes" while the answer for the second and third is "no".
|Commitee:||Bercovici, Hari, Bradley, Richard, Fisher, David|
|School Location:||United States -- Indiana|
|Source:||DAI-B 72/08, Dissertation Abstracts International|
|Subjects:||Applied Mathematics, Mathematics|
|Keywords:||Cayley graphs, Groups, Invariant processes, Percolation, Probability, Trees|
Copyright in each Dissertation and Thesis is retained by the author. All Rights Reserved
The supplemental file or files you are about to download were provided to ProQuest by the author as part of a
dissertation or thesis. The supplemental files are provided "AS IS" without warranty. ProQuest is not responsible for the
content, format or impact on the supplemental file(s) on our system. in some cases, the file type may be unknown or
may be a .exe file. We recommend caution as you open such files.
Copyright of the original materials contained in the supplemental file is retained by the author and your access to the
supplemental files is subject to the ProQuest Terms and Conditions of use.
Depending on the size of the file(s) you are downloading, the system may take some time to download them. Please be