Localization transition, Lifschitz tails, and rare-region effects in network models

Does the brain behave like a (complex) network? I. Dynamics

Graph theory is now becoming a standard tool in system-level neuroscience. However, endowing observed brain anatomy and dynamics with a complex network structure does not entail that the brain actually works as a network. Asking whether the brain behaves as a network means asking whether network properties count. From the viewpoint of neurophysiology and, possibly, of brain physics, the most substantial issues a network structure may be instrumental in addressing relate to the influence of network properties on brain dynamics and to whether these properties ultimately explain some aspects of brain function. Here, we address the dynamical implications of complex network, examining which aspects and scales of brain activity may be understood to genuinely behave as a network. To do so, we first define the meaning of networkness, and analyse some of its implications. We then examine ways in which brain anatomy and dynamics can be endowed with a network structure and discuss possible ways in which network structure may be shown to represent a genuine organisational principle of brain activity, rather than just a convenient description of its anatomy and dynamics.

Master equation analysis of mesoscopic localization in contagion dynamics on higher-order networks

Simple models of infectious diseases tend to assume random mixing of individuals, but real interactions are not random pairwise encounters: they occur within various types of gatherings such as workplaces, households, schools, and concerts, best described by a higher-order network structure. We model contagions on higher-order networks using group-based approximate master equations, in which we track all states and interactions within a group of nodes and assume a mean-field coupling between them. Using the susceptible-infected-susceptible dynamics, our approach reveals the existence of a mesoscopic localization regime, where a disease can concentrate and self-sustain only around large groups in the network overall organization. In this regime, the phase transition is smeared, characterized by an inhomogeneous activation of the groups. At the mesoscopic level, we observe that the distribution of infected nodes within groups of the same size can be very dispersed, even bimodal. When considering heterogeneous networks, both at the level of nodes and at the level of groups, we characterize analytically the region associated with mesoscopic localization in the structural parameter space. We put in perspective this phenomenon with eigenvector localization and discuss how a focus on higher-order structures is needed to discern the more subtle localization at the mesoscopic level. Finally, we discuss how mesoscopic localization affects the response to structural interventions and how this framework could provide important insights for a broad range of dynamics.

An overview of epidemic models with phase transitions to absorbing states running on top of complex networks

Dynamical systems running on the top of complex networks have been extensively investigated for decades. But this topic still remains among the most relevant issues in complex network theory due to its range of applicability. The contact process (CP) and the susceptible-infected-susceptible (SIS) model are used quite often to describe epidemic dynamics. Despite their simplicity, these models are robust to predict the kernel of real situations. In this work, we review concisely both processes that are well-known and very applied examples of models that exhibit absorbing-state phase transitions. In the epidemic scenario, individuals can be infected or susceptible. A phase transition between a disease-free (absorbing) state and an active stationary phase (where a fraction of the population is infected) are separated by an epidemic threshold. For the SIS model, the central issue is to determine this epidemic threshold on heterogeneous networks. For the CP model, the main interest is to relate critical exponents with statistical properties of the network.

Efficient sampling of spreading processes on complex networks using a composition and rejection algorithm

Efficient stochastic simulation algorithms are of paramount importance to the study of spreading phenomena on complex networks. Using insights and analytical results from network science, we discuss how the structure of contacts affects the efficiency of current algorithms. We show that algorithms believed to require O ( log  N ) or even O ( 1 ) operations per update-where N is the number of nodes-display instead a polynomial scaling for networks that are either dense or sparse and heterogeneous. This significantly affects the required computation time for simulations on large networks. To circumvent the issue, we propose a node-based method combined with a composition and rejection algorithm, a sampling scheme that has an average-case complexity of O [ log ( log  N ) ] per update for general networks. This systematic approach is first set-up for Markovian dynamics, but can also be adapted to a number of non-Markovian processes and can enhance considerably the study of a wide range of dynamics on networks.

Phase transition of the susceptible-infected-susceptible dynamics on time-varying configuration model networks

We present a degree-based theoretical framework to study the susceptible-infected-susceptible (SIS) dynamics on time-varying (rewired) configuration model networks. Using this framework on a given degree distribution, we provide a detailed analysis of the stationary state using the rewiring rate to explore the whole range of the time variation of the structure relative to that of the SIS process. This analysis is suitable for the characterization of the phase transition and leads to three main contributions: (1) We obtain a self-consistent expression for the absorbing-state threshold, able to capture both collective and hub activation. (2) We recover the predictions of a number of existing approaches as limiting cases of our analysis, providing thereby a unifying point of view for the SIS dynamics on random networks. (3) We obtain bounds for the critical exponents of a number of quantities in the stationary state. This allows us to reinterpret the concept of hub-dominated phase transition. Within our framework, it appears as a heterogeneous critical phenomenon: observables for different degree classes have a different scaling with the infection rate. This phenomenon is followed by the successive activation of the degree classes beyond the epidemic threshold.

Localization in random bipartite graphs: Numerical and empirical study

We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. Motivation for this study is twofold: first, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social interaction, especially electronic commerce. We establish the position of the mobility edge and show that it strongly depends on the power in the degree distribution and on the ratio of the sizes of the two parts of the bipartite graph. At the jamming threshold, where the two parts have the same size, localization vanishes. We found that the multifractal spectrum is nontrivial in the delocalized phase, but still near the mobility edge. We also study an empirical bipartite graph, namely, the Amazon reviewer-item network. We found that in this specific graph the mobility edge disappears, and we draw a conclusion from this fact regarding earlier empirical studies of the Amazon network.

Griffiths phase on hierarchical modular networks with small-world edges

The Griffiths phase has been proposed to induce a stretched critical regime that facilitates self-organizing of brain networks for optimal function. This phase stems from the intrinsic structural heterogeneity of brain networks, i.e., the hierarchical modular structure. In this work, the Griffiths phase is studied in modified hierarchical networks with small-world connections based on the 3-regular Hanoi network. Through extensive simulations, the hierarchical level-dependent inter-module wiring probabilities are identified to determine the emergence of the Griffiths phase. Numerical results and the complementary spectral analysis of the relevant networks can be helpful for a deeper understanding of the essential structural characteristics of finite-dimensional networks to support the Griffiths phase.

Metastable localization of diseases in complex networks

We describe the phenomenon of localization in the epidemic susceptible-infective-susceptible model on highly heterogeneous networks in which strongly connected nodes (hubs) play the role of centers of localization. We find that in this model the localized states below the epidemic threshold are metastable. The longevity and scale of the metastable outbreaks do not show a sharp localization transition; instead there is a smooth crossover from localized to delocalized states as we approach the epidemic threshold from below. Analyzing these long-lasting local outbreaks for a random regular graph with a hub, we show how this localization can be detected from the shape of the distribution of the number of infective nodes.

Sampling methods for the quasistationary regime of epidemic processes on regular and complex networks

A major hurdle in the simulation of the steady state of epidemic processes is that the system will unavoidably visit an absorbing, disease-free state at sufficiently long times due to the finite size of the networks where epidemics evolves. In the present work, we compare different quasistationary (QS) simulation methods where the absorbing states are suitably handled and the thermodynamical limit of the original dynamics can be achieved. We analyze the standard QS (SQS) method, where the sampling is constrained to active configurations, the reflecting boundary condition (RBC), where the dynamics returns to the pre-absorbing configuration, and hub reactivation (HR), where the most connected vertex of the network is reactivated after a visit to an absorbing state. We apply the methods to the contact process (CP) and susceptible-infected-susceptible (SIS) models on regular and scale free networks. The investigated methods yield the same epidemic threshold for both models. For CP, that undergoes a standard collective phase transition, the methods are equivalent. For SIS, whose phase transition is ruled by the hub mutual reactivation, the SQS and HR methods are able to capture localized epidemic phases while RBC is not. We also apply the autocorrelation time as a tool to characterize the phase transition and observe that this analysis provides the same finite-size scaling exponents for the critical relaxation time for the investigated methods. Finally, we verify the equivalence between RBC method and a weak external field for epidemics on networks.

Griffiths effects of the susceptible-infected-susceptible epidemic model on random power-law networks

We provide numerical evidence for slow dynamics of the susceptible-infected-susceptible model evolving on finite-size random networks with power-law degree distributions. Extensive simulations were done by averaging the activity density over many realizations of networks. We investigated the effects of outliers in both highly fluctuating (natural cutoff) and nonfluctuating (hard cutoff) most connected vertices. Logarithmic and power-law decays in time were found for natural and hard cutoffs, respectively. This happens in extended regions of the control parameter space λ(1)<λ<λ(2), suggesting Griffiths effects, induced by the topological inhomogeneities. Optimal fluctuation theory considering sample-to-sample fluctuations of the pseudothresholds is presented to explain the observed slow dynamics. A quasistationary analysis shows that response functions remain bounded at λ(2). We argue these to be signals of a smeared transition. However, in the thermodynamic limit the Griffiths effects loose their relevancy and have a conventional critical point at λ(c)=0. Since many real networks are composed by heterogeneous and weakly connected modules, the slow dynamics found in our analysis of independent and finite networks can play an important role for the deeper understanding of such systems.

Multiple transitions of the susceptible-infected-susceptible epidemic model on complex networks

The epidemic threshold of the susceptible-infected-susceptible (SIS) dynamics on random networks having a power law degree distribution with exponent γ>3 has been investigated using different mean-field approaches, which predict different outcomes. We performed extensive simulations in the quasistationary state for a comparison with these mean-field theories. We observed concomitant multiple transitions in individual networks presenting large gaps in the degree distribution and the obtained multiple epidemic thresholds are well described by different mean-field theories. We observed that the transitions involving thresholds which vanish at the thermodynamic limit involve localized states, in which a vanishing fraction of the network effectively contributes to epidemic activity, whereas an endemic state, with a finite density of infected vertices, occurs at a finite threshold. The multiple transitions are related to the activations of distinct subdomains of the network, which are not directly connected.