Random triangulated surfaces are created by taking an even number, n, of triangles and arbitrarily ”gluing” together pairs of edges until every edge has been paired. The resulting surface can be described in terms of its number of boundary cycles, a random variable denoted by h. Building upon the work of Nicholas Pippenger and Kristin Schleich, and using a recent result from Alex Gamburd, we establish an improved approximation for the expectation of h for certain values of n. We use a computer simulation to exactly determine the distribution of h for small values of n, and present a method for calculating these probabilities. We also conduct an investigation into the related problem of creating one connected component out of n triangles.
Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1208 |
Date | 01 May 2008 |
Creators | Fleming, Kevin |
Publisher | Scholarship @ Claremont |
Source Sets | Claremont Colleges |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | HMC Senior Theses |
Page generated in 0.0015 seconds