Charlie Steinhorn - Vassar College
Randomness and Modular Arithmetic
The random graph can be understood as the undirected graph whose vertices are the natural numbers such that edges between vertices are determined by flipping a coin. The first part of the talk focuses on the random graph from a naive probabilistic point of view. The second part of the talk deals with a particular class of finite graphs that ``approximate'' the random graph. The surprise here is that these finite graphs are constructed using modular arithmetic.
[Program Information | Faculty | Mathematics Seminar | Mathematics Links]
[Math Department Home Page | Marist College]