Back to search

University of Washington

Three Problems in Discrete Probability

Abstract

dc:description.abstract

In this thesis we present three problems. The first problem is to find a good description of the number of fixed points of a 231-avoiding permutation. We use a bijection from Dyck paths to 231-avoiding permutations that allows us to compute the scaled distribution of the number of fixed points of a 231-avoiding permutation chosen uniformly at random. We also show a strong connection with a these permutations and Brownian excursion. The second problem is a study of bootstrap percolation on the Hamming torus. We give a thorough description of the behavior of this model for finite lattices of all dimensions when the percolation threshold is 2. Lastly we present a problem on jigsaw percolation as a model for collaborative problem solving. This process considers a pair of graphs on a shared set of vertices and forms clusters of vertices based on the edges of the two underlying graphs. We consider the process where both graphs are Erdos-Renyi random graphs.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Slivken, Erik Dustin
Advisor dc:contributor.advisor
  • Hoffman, Christopher

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • Copyright is held by the individual authors.
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1773/26528

Chain of custody

source
Harvested from
University of Washington
Base URL
digital.lib.washington.edu/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Slivken, Erik Dustin. Three Problems in Discrete Probability. 2014. http://hdl.handle.net/1773/26528