No abstract

Quantifying the differences between networks is a challenging and ever-present problem in network science. In recent years, a multitude of diverse, ad hoc solutions to this problem have been introduced. Here, we propose that simple and well-understood ensembles of random networks—such as Erdős–Rényi graphs, random geometric graphs, Watts–Strogatz graphs, the configuration model and preferential attachment networks—are natural benchmarks for network comparison methods. Moreover, we show that the expected distance between two networks independently sampled from a generative model is a useful property that encapsulates many key features of that model. To illustrate our results, we calculate this within-ensemble graph distance and related quantities for classic network models (and several parameterizations thereof) using 20 distance measures commonly used to compare graphs. The within-ensemble graph distance provides a new framework for developers of graph distances to better understand their creations and for practitioners to better choose an appropriate tool for their particular task.

Existing information-theoretic frameworks based on maximum entropy network ensembles are not able to explain the emergence of heterogeneity in complex networks. Here, we fill this gap of knowledge by developing a classical framework for networks based on finding an optimal trade-off between the information content of a compressed representation of the ensemble and the information content of the actual network ensemble. We introduce a novel classical network ensemble satisfying a set of soft constraints and we find the optimal distribution of the constraints for this ensemble. We show that for the classical network ensemble in which the only constraints are the expected degrees a power-law degree distribution is optimal. Also, we study spatially embedded networks finding that the interactions between nodes naturally lead to non-uniform spread of nodes in the embedding space, leading in some cases to a fractal distribution of nodes. This result is consistent with the so called `blessing of non-uniformity' of data, i.e. the fact that real world data typically do not obey uniform distributions. The pertinent features of real-world air transportation networks are well described by the proposed framework.

Complex systems throughout nature and society are often best represented as networks. Over the last two decades, alongside the increased availability of large network datasets, we have witnessed the rapid rise of network science (Amaral & Ottino, 2004;Barabási, 2016;Newman, 2018;Vespignani et al., 2008). This field is built around the idea that an increased understanding of the complex structural properties of a variety systems will allow us to better observe, predict, and even control the behavior of these systems.

Spatiotemporal chaos collapses to either a rest state or a propagating pulse solution in a single layer of diffusively coupled, excitable Morris-Lecar neurons. Weak synaptic coupling of two such layers reveals system intrinsic switching of spatiotemporal activity patterns within and between the layers at irregular times. Within a layer, switching sequences include spatiotemporal chaos, erratic and regular pulse propagation, spontaneous network wide neuron activity, and rest state. A momentary substantial reduction in neuron activity in one layer can reinitiate transient spatiotemporal chaos in the other layer, which can induce a swap of spatiotemporal chaos with a pulse state between the layers. Presynaptic input maximizes the distance between propagating pulses, in contrast to pulse merging in the absence of synapses.