This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the XII International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2023). The carefully selected papers cover a wide range of theoretical topics such as network embedding and network geometry; community structure, network dynamics; diffusion, epidemics and spreading processes; machine learning and graph neural networks as well as all the main network applications, including social and political networks; networks in finance and economics; biological networks and technological networks.

This book highlights cutting-edge research in the field of network science, offering scientists, researchers, students, and practitioners a unique update on the latest advances in theory and a multitude of applications. It presents the peer-reviewed proceedings of the Eighth International Conference on Complex Networks and their Applications (COMPLEX NETWORKS 2019), which took place in Lisbon, Portugal, on December 10–12, 2019. The carefully selected papers cover a wide range of theoretical topics such as network models and measures; community structure, and network dynamics; diffusion, epidemics, and spreading processes; resilience and control as well as all the main network applications, including social and political networks; networks in finance and economics; biological and neuroscience networks; and technological networks.

A comprehensive introduction to the theory and applications of complex network science, complete with real-world data sets and software tools.

The availability of large data sets have allowed researchers to uncover complex properties such as large scale fluctuations and heterogeneities in many networks which have lead to the breakdown of standard theoretical frameworks and models. Until recently these systems were considered as haphazard sets of points and connections. Recent advances have generated a vigorous research effort in understanding the effect of complex connectivity patterns on dynamical phenomena. For example, a vast number of everyday systems, from the brain to ecosystems, power grids and the Internet, can be represented as large complex networks. This new and recent account presents a comprehensive explanation of these effects.

Fuelled by the big data paradigm, the study of networks is an interdisciplinary field that is growing at the interface of many branches of science including mathematics, physics, computer science, biology, economics and the social sciences. This book, written by experts from the Network Science community, covers a wide range of theoretical and practical advances in this highly active field, highlighting the strong interconnections between works in different disciplines. The eleven chapters take the reader through the essential concepts for the structural analysis of networks, and their applications to real-world scenarios. Being self-contained, the book is intended for researchers, graduate and advanced undergraduate students from different intellectual backgrounds. Each chapter combines mathematical rigour with rich references to the literature, while remaining accessible to a wide range of readers who wish to understand some of the key issues encountered in many aspects of networked everyday life.

This book brings together two emerging research areas: synchronization in coupled nonlinear systems and complex networks, and study conditions under which a complex network of dynamical systems synchronizes. While there are many texts that study synchronization in chaotic systems or properties of complex networks, there are few texts that consider the intersection of these two very active and interdisciplinary research areas. The main theme of this book is that synchronization conditions can be related to graph theoretical properties of the underlying coupling topology. The book introduces ideas from systems theory, linear algebra and graph theory and the synergy between them that are necessary to derive synchronization conditions. Many of the results, which have been obtained fairly recently and have until now not appeared in textbook form, are presented with complete proofs. This text is suitable for graduate-level study or for researchers who would like to be better acquainted with the latest research in this area. Sample Chapter(s). Chapter 1: Introduction (76 KB). Contents: Graphs, Networks, Laplacian Matrices and Algebraic Connectivity; Graph Models; Synchronization in Networks of Nonlinear Continuous-Time Dynamical Systems; Synchronization in Networks of Coupled Discrete-Time Systems; Synchronization in Network of Systems with Linear Dynamics; Agreement and Consensus Problems in Groups of Interacting Agents. Readership: Graduate students and researchers in physics, applied mathematics and engineering.

From foundations to state-of-the-art; the tools and philosophy you need to build network models.

The book integrates approaches from mathematics, physics and computer sciences to analyse the organisation of complex networks. Every organisational principle of networks is defined, quantified and then analysed for its influences on the properties and functions of molecular, biological, ecological and social networks.

This book concentrates on mining networks, a subfield within data science. Data science uses scientific and computational tools to extract valuable knowledge from large data sets. Once data is processed and cleaned, it is analyzed and presented to support decision-making processes. Data science and machine learning tools have become widely used in companies of all sizes. Networks are often large-scale, decentralized, and evolve dynamically over time. Mining complex networks aim to understand the principles governing the organization and the behavior of such networks is crucial for a broad range of fields of study. Here are a few selected typical applications of mining networks: Community detection (which users on some social media platforms are close friends). Link prediction (who is likely to connect to whom on such platforms). Node attribute prediction (what advertisement should be shown to a given user of a particular platform to match their interests). Influential node detection (which social media users would be the best ambassadors of a specific product). This textbook is suitable for an upper-year undergraduate course or a graduate course in programs such as data science, mathematics, computer science, business, engineering, physics, statistics, and social science. This book can be successfully used by all enthusiasts of data science at various levels of sophistication to expand their knowledge or consider changing their career path. Jupiter notebooks (in Python and Julia) accompany the book and can be accessed on https://www.ryerson.ca/mining-complex-networks/. These not only contain all the experiments presented in the book, but also include additional material. Bogumił Kamiński is the Chairman of the Scientific Council for the Discipline of Economics and Finance at SGH Warsaw School of Economics. He is also an Adjunct Professor at the Data Science Laboratory at Ryerson University. Bogumił is an expert in applications of mathematical modeling to solving complex real-life problems. He is also a substantial open-source contributor to the development of the Julia language and its package ecosystem. Paweł Prałat is a Professor of Mathematics in Ryerson University, whose main research interests are in random graph theory, especially in modeling and mining complex networks. He is the Director of Fields-CQAM Lab on Computational Methods in Industrial Mathematics in The Fields Institute for Research in Mathematical Sciences and has pursued collaborations with various industry partners as well as the Government of Canada. He has written over 170 papers and three books with 130 plus collaborators. François Théberge holds a B.Sc. degree in applied mathematics from the University of Ottawa, a M.Sc. in telecommunications from INRS and a PhD in electrical engineering from McGill University. He has been employed by the Government of Canada since 1996 where he was involved in the creation of the data science team as well as the research group now known as the Tutte Institute for Mathematics and Computing. He also holds an adjunct professorial position in the Department of Mathematics and Statistics at the University of Ottawa. His current interests include relational-data mining and deep learning.

Analyzing the behavior of complex networks is an important element in the design of new man-made structures such as communication systems and biologically engineered molecules. Because any complex network can be represented by a graph, and therefore in turn by a matrix, graph theory has become a powerful tool in the investigation of network performance. This self-contained 2010 book provides a concise introduction to the theory of graph spectra and its applications to the study of complex networks. Covering a range of types of graphs and topics important to the analysis of complex systems, this guide provides the mathematical foundation needed to understand and apply spectral insight to real-world systems. In particular, the general properties of both the adjacency and Laplacian spectrum of graphs are derived and applied to complex networks. An ideal resource for researchers and students in communications networking as well as in physics and mathematics.