This book concentrates on mining networks, a subfield within data science. Many data science problems can be viewed as a study of some properties of complex networks in which nodes represent the entities that are being investigated, and edges represent relations between these entities. In these networks (for example, the Instagram and Facebook online social networks), nodes not only contain some useful information (such as the user’s profile, photos, and tags) but are also internally connected to other nodes (relations based on follower requests, similar users’ behaviour, age, and geographic location). Such networks are often large-scale, decentralized, and evolve dynamically over time. Mining complex networks to understand the principles governing the organization and the behaviour of such networks is crucial for a broad range of fields of study, including information and social sciences, economics, biology, and neuroscience. The field has seen significant advancements since the first edition was published. Changes and updates to this edition include:New material and examples on random geometric graphs. The chapter on node embeddings was augmented in several places including a discussion on classical vs. structural embeddings, more details on graph neural networks (GNNs), as well as other directions. Several new tools and techniques are introduced on mining hypergraphs. New material on post-processing for overlapping communities. A new focus on a framework for embedding graphs codeveloped by the authors. A short chapter on fairness in network mining models. This book is aimed at being suitable for an upper-year undergraduate course or a graduate course.