The Fariborz Maseeh Department of Mathematics and Stastics
Assistant Professor in Mathematics Candidate
Carnegie Mellon University
Random and Pseudo-Random Graphs
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."
Deepak Bal is a current graduate student in the Algorithms, Combinatorics and Optimization program a Carnegie Mellon University studying under the supervision of Alan Frieze. He completed his undergraduate studies at The Ohio State University in Mathematics and Computer Science. He will receive his doctoral degree in May 2013.
Friday, February 15th, 2013 at 3:15PM
Neuberger Hall room 454
This event is free and open to the public.