Event Type:

Probability Seminar

Date/Time:

Thursday, May 14, 2015 - 12:00 to 13:00

Location:

GILK 115

Guest Speaker:

Institution:

Willamette University

Abstract:

Consider a graph where each edge is given an independent uniform [0,1] length. In 1985, Frieze proved that the expected length of the minimum spanning tree with these random edge lengths of the complete graph converge as the number of vertices go to infinity. Since then there have been numerous refinements and generalizations of this result. In this talk, I will give a survey of some of these results including the work we completed during the Willamette Valley REU Consortium for Mathematics Research in 2008 where we derived a polynomial representation of the expected length of the minimum spanning tree.