Seminar at SMU Delhi

January 24, 2017 (Tuesday) , 3:30 PM at Webinar
Speaker: Mathew Penrose, University of Bath, UK
Title: The strong giant in a random dig//raph
Abstract of Talk
Consider a random directed graph on n vertices with out-degrees sampled independently at random from an arbitrary specified probability distribution on the non-negative integers, and destinations of arcs selected independently and uniformly at random. We say two vertices lie in the same strong component if they intercommunicate. We discuss the emergence of a unique giant component for large n, provided the mean out-degree exceeds 1. Time permitting, we discuss related results for other random graph models.