Large real-world networks although being globally sparse, in terms of the number of edges, have their nodes/vertices connected by relatively short paths. In addition, such networks are locally dense, i.e., vertices lying in a small neighborhood of a given vertex are connected by many edges. This observation is called the “small-world” phenomenon, and it has generated many attempts, both theoretical and experimental, to build and study appropriate models of small-world networks. The first attempt to explain this phenomenon and to build a more realistic model was introduced by Watts and Strogatz in 1998 followed by the publication of an alternative approach by Kleinberg in 2000. The current chapter is devoted to the presentation of both models.

To describe coauthorship networks, we begin with the Erdös number, which links mathematicians to their famously prolific colleague through the papers they have collaborated on. Coauthorship networks help us capture collaborative patterns and identify important features that characterize them. We can also use them to predict how many collaborators a scientist will have in the future based on her coauthorship history. We find that collaboration networks are scale-free, following a power-law distribution. As a consequence of the Matthew effect, frequent collaborators are more likely to collaborate, becoming hubs in their networks. We then explore the small-world phenomenon evidenced in coauthorship networks, which is sometimes referred to as “six degrees of separation.” To understand how a network’s small-worldliness impacts creativity and success, we look to teams of artists collaborating on Broadway musicals, finding that teams perform best when the network they inhabit is neither too big or too small. We end by discussing how connected components within networks provide evidence for the “invisible college.”