This special issue of the European Journal of Applied Mathematics features research articles on networks, one of the most exciting areas of applied mathematics.

We study the behaviour of network diffusions based on the PageRank random walk from a set of seed nodes. These diffusions are known to reveal small, localized clusters (or communities), and also large macro-scale clusters by varying a parameter that has a dual-interpretation as an accuracy bound and as a regularization level. We propose a new method that quickly approximates the result of the diffusion for all values of this parameter. Our method efficiently generates an approximate solution path or regularization path associated with a PageRank diffusion, and it reveals cluster structures at multiple size-scales between small and large. We formally prove a runtime bound on this method that is independent of the size of the network, and we investigate multiple optimizations to our method that can be more practical in some settings. We demonstrate that these methods identify refined clustering structure on a number of real-world networks with up to 2 billion edges.

We introduce several novel and computationally efficient methods for detecting “core–periphery structure” in networks. Core–periphery structure is a type of mesoscale structure that consists of densely connected core vertices and sparsely connected peripheral vertices. Core vertices tend to be well-connected both among themselves and to peripheral vertices, which tend not to be well-connected to other vertices. Our first method, which is based on transportation in networks, aggregates information from many geodesic paths in a network and yields a score for each vertex that reflects the likelihood that that vertex is a core vertex. Our second method is based on a low-rank approximation of a network's adjacency matrix, which we express as a perturbation of a tensor-product matrix. Our third approach uses the bottom eigenvector of the random-walk Laplacian to infer a coreness score and a classification into core and peripheral vertices. We also design an objective function to (1) help classify vertices into core or peripheral vertices and (2) provide a goodness-of-fit criterion for classifications into core versus peripheral vertices. To examine the performance of our methods, we apply our algorithms to both synthetically generated networks and a variety of networks constructed from real-world data sets.

The central theme of complex systems research is to understand the emergent macroscopic properties of a system from the interplay of its microscopic constituents. The emergence of macroscopic properties is often intimately related to the structure of the microscopic interactions. Here, we present an analytical approach for deriving necessary conditions that an interaction network has to obey in order to support a given type of macroscopic behaviour. The approach is based on a graphical notation, which allows rewriting Jacobi's signature criterion in an interpretable form and which can be applied to many systems of symmetrically coupled units. The derived conditions pertain to structures on all scales, ranging from individual nodes to the interaction network as a whole. For the purpose of illustration, we consider the example of synchronization, specifically the (heterogeneous) Kuramoto model and an adaptive variant. The results complete and extend the previous analysis of Do et al. (2012Phys. Rev. Lett.108, 194102).

The master stability function is a powerful tool for determining synchrony in high-dimensional networks of coupled limit cycle oscillators. In part, this approach relies on the analysis of a low-dimensional variational equation around a periodic orbit. For smooth dynamical systems, this orbit is not generically available in closed form. However, many models in physics, engineering and biology admit to non-smooth piece-wise linear caricatures, for which it is possible to construct periodic orbits without recourse to numerical evolution of trajectories. A classic example is the McKean model of an excitable system that has been extensively studied in the mathematical neuroscience community. Understandably, the master stability function cannot be immediately applied to networks of such non-smooth elements. Here, we show how to extend the master stability function to non-smooth planar piece-wise linear systems, and in the process demonstrate that considerable insight into network dynamics can be obtained. In illustration, we highlight an inverse period-doubling route to synchrony, under variation in coupling strength, in globally linearly coupled networks for which the node dynamics is poised near a homoclinic bifurcation. Moreover, for a star graph, we establish a mechanism for achieving so-called remote synchronisation (where the hub oscillator does not synchronise with the rest of the network), even when all the oscillators are identical. We contrast this with node dynamics close to a non-smooth Andronov–Hopf bifurcation and also a saddle node bifurcation of limit cycles, for which no such bifurcation of synchrony occurs.

In this paper, we present a distributed Proportional-Integral (PI) strategy with self-tuning adaptive gains for reaching asymptotic consensus in networks of non-identical linear agents under constant disturbances. Alternative adaptive strategies are presented, based on global or local measures of the agents' disagreement. The proposed approaches are validated on a representative numerical example. Preliminary analytical results further confirm the viability of the self-tuning strategies.

The ability to directly record human face-to-face interactions increasingly enables the development of detailed data-driven models for the spread of directly transmitted infectious diseases at the scale of individuals. Complete coverage of the contacts occurring in a population is however generally unattainable, due for instance to limited participation rates or experimental constraints in spatial coverage. Here, we study the impact of spatially constrained sampling on our ability to estimate the epidemic risk in a population using such detailed data-driven models. The epidemic risk is quantified by the epidemic threshold of the SIRS model for the propagation of communicable diseases, i.e. the critical value of disease transmissibility above which the disease turns endemic. We verify for both synthetic and empirical data of human interactions that the use of incomplete data sets due to spatial sampling leads to the underestimation of the epidemic risk. The bias is however smaller than the one obtained by uniformly sampling the same fraction of contacts: it depends non-linearly on the fraction of contacts that are recorded, and becomes negligible if this fraction is large enough. Moreover, it depends on the interplay between the timescales of population and spreading dynamics.

Within the online media universe, there are many underlying communities. These may be defined, for example, through politics, location, health, occupation, extracurricular interests or retail habits. Government departments, charities and commercial organisations can benefit greatly from insights about the structure of these communities; the move to customer-centred practices requires knowledge of the customer base. Motivated by this issue, we address the fundamental question of whether a sub-network looks like a collection of individuals who have effectively been picked at random from the whole, or instead forms a distinctive community with a new, discernible structure. In the former case, to spread a message to the intended user base it may be best to use traditional broadcast media (TV, billboard), whereas in the latter case a more targeted approach could be more effective. In this work, we therefore formalise a concept of testing for sub-structure and apply it to social interaction data. First, we develop a statistical test to determine whether a given sub-network (induced sub-graph) is likely to have been generated by sampling nodes from the full network uniformly at random. This tackles an interesting inverse alternative to the more widely studied “forward” problem. We then apply the test to a Twitter reciprocated mentions network where a range of brand name based sub-networks are created via tweet content. We correlate the computed results against the independent views of 16 digital marketing professionals. We conclude that there is great potential for social media based analytics to quantify, compare and interpret online brand allegiances systematically, in real time and at large scale.

In the social sciences, networks are used to represent relationships between social actors, be they individuals or aggregates. The structural importance of these actors is assessed in terms of centrality indices which are commonly defined as graph invariants. Many such indices have been proposed, but there is no unifying theory of centrality. Previous attempts at axiomatic characterization have been focused on particular indices, and the conceptual frameworks that have been proposed alternatively do not lend themselves to mathematical treatment.

We show that standard centrality indices, although seemingly distinct, can in fact be expressed in a common framework based on path algebras. Since, as a consequence, all of these indices preserve the neighbourhood-inclusion pre-order, the latter provides a conceptually clear criterion for the definition of centrality indices.