"Random Graphs" Faculty Advisor: Dr. Robin Lock, Mathematics, Computer Science, and Statistics Dept.

Poster Presentation Abstract:
 A random graph is simply a collection of vertices and edges where the edges occur by some random process.  Because of the aspect of randomness in these graphs, can theory be helpful in determining the likelihood of certain graphical properties?  For example, what is the probability that a random graph will be connected or planar or many other various graphical properties?  This talk will discuss how such probabilities can be calculated and how they might depend on the relationships between graph size (n) and probability for each edge (p).

Created: 4/21/03