Mathematics Colloquia and Seminars

Return to Colloquia & Seminar listing

The inhomogeneous random graph, which I refer to as a multitype random graph, generalizes the Erdős–Rényi random graph by incorporating different types of nodes. Although not yet widely used to model real-world networks, they have a great amount of flexibility and a simple description which facilitates analysis. I will briefly cover known results on some important network properties: component sizes, typical distance, and mixing time. Finally, since a good upper bound on the mixing time is known only in the single type case, I will discuss the case of multiple types in detail.