Graduate Students
Department Home Undergraduate Graduate CNA CCF Information
Graduate Programs     
Graduate Home Ph D Programs Masters Degree Ph D Program Requirements Course Descriptions Current Courses Admissions Current Graduate Students Graduate Student Seminar SIAM Chapter Seminar Recent Graduates Incoming Students

Apply Now
Graduate Seminar

Deepak Bal
Carnegie Mellon University
Title: Random and Pseudo-Random Graphs

Abstract: Random graphs have been an area of much research since their introduction in the 1950's. Pseudo-random graphs are graphs which approximate random graphs in some way. In recent years, such graphs have found many interesting applications in computer science as well as being of interest to discrete mathematicians. In this talk I will describe some results in random and pseudo-random graphs including packing edge-disjoint spanning subgraphs and the analysis of algorithms on random graphs using the so called "differential equations method."

Date: Thursday, February 7, 2013
Time: 5:30 pm
Location: Wean Hall 8220
Submitted by:  Brian Kell