Complex networks articles within Nature Communications

Featured

  • Article
    | Open Access

    Mapping complex networks to underlying geometric spaces can help understand the structure of networked systems. Here the authors propose a class of machine learning algorithms for efficient embedding of large real networks to the hyperbolic space, with potential impact on big network data analysis.

    • Alessandro Muscoloni
    • , Josephine Maria Thomas
    •  & Carlo Vittorio Cannistraci
  • Article
    | Open Access

    Multiplex networks consist of a collection of interacting layers and occur in social and technological systems. Here Osat et al. investigate optimal percolation which relates to the process of optimally dismantling multiplex networks and show that simplified versions of this problem lead to error.

    • Saeed Osat
    • , Ali Faqeeh
    •  & Filippo Radicchi
  • Article
    | Open Access

    Complex networks represent systems such as neural networks and air traffic as interconnected nodes that organize themselves into subsets. Here Bertolero et al. propose a subset which they call the diverse club, which offers an alternative to the commonly used rich club.

    • M. A. Bertolero
    • , B. T. T. Yeo
    •  & M. D’Esposito
  • Article
    | Open Access

    Cancer is caused by accumulating genetic mutations. Here, the authors investigate the cooperative effect of these mutations in colorectal cancer patients and identify a giant cluster of mutation-propagating modules that undergoes percolation transition during tumorigenesis.

    • Dongkwan Shin
    • , Jonghoon Lee
    •  & Kwang-Hyun Cho
  • Article
    | Open Access

    Cascade propagation models represent a range of processes on networks, such as power-grid blackouts and epidemic outbreaks. Here the authors investigate temporal profiles of avalanches and show how nonsymmetric average avalanche shapes can occur at criticality.

    • James P. Gleeson
    •  & Rick Durrett
  • Article
    | Open Access

    The description of temporal networks is usually simplified in terms of their dynamic community structures, whose identification however relies on a priori assumptions. Here the authors present a data-driven method that determines relevant timescales for the dynamics and uses it to identify communities.

    • Tiago P. Peixoto
    •  & Martin Rosvall
  • Article
    | Open Access

    Reconstruction of time-resolved interactions in networks is more challenging than for the time-independent case, as causal relations limit accessibility to empirical data. Here the authors propose a method based on first-arrival observations of a diffusion process to infer stochastic temporal networks.

    • Xun Li
    •  & Xiang Li
  • Article
    | Open Access

    It is believed that patterns of social ties are related to individuals’ financial status. Here the authors substantiate this concept by quantitatively demonstrating that a measure of an individual’s location and influence within their social network can be used to infer their economic wellness.

    • Shaojun Luo
    • , Flaviano Morone
    •  & Hernán A. Makse
  • Article
    | Open Access

    The energy required to control a dynamical complex network can be prohibitively large when there are only a few control inputs. Here the authors demonstrate that if only a subset of the network is targeted the energy requirements decrease exponentially.

    • Isaac Klickstein
    • , Afroza Shirin
    •  & Francesco Sorrentino
  • Article
    | Open Access

    Collective phenomena in many-body systems include synchronization in classical and entanglement in quantum systems. Here the authors study isolated many-body quantum systems and demonstrate that synchronization emerges intrinsically, accompanied by the onset of quantum coherence and persistent entanglement.

    • Dirk Witthaut
    • , Sandro Wimberger
    •  & Marc Timme
  • Article
    | Open Access

    The spread of instabilities in financial systems, similarly to ecosystems, is influenced by topological features of the underlying network structures. Here the authors show, independently of specific financial models, that market integration and diversification can drive the system towards instability.

    • Marco Bardoscia
    • , Stefano Battiston
    •  & Guido Caldarelli
  • Article
    | Open Access

    An articulation point in a network is a node whose removal disconnects the network. Here the authors develop analytical tools to study key issues pertinent to articulation points, such as the expected number of them and the network vulnerability against their removal, in arbitrary complex networks.

    • Liang Tian
    • , Amir Bashan
    •  & Yang-Yu Liu
  • Article
    | Open Access

    Complex networks have been conjectured to be hidden in metric spaces, which offer geometric interpretation of networks’ topologies. Here the authors extend this concept to weighted networks, providing empirical evidence on the metric natures of weights, which are shown to be reproducible by a gravity model.

    • Antoine Allard
    • , M. Ángeles Serrano
    •  & Marián Boguñá
  • Article
    | Open Access

    Energy dissipation characterizes the states far from equilibrium, whilst how it affects the local organization remains elusive. Here, Muruganet al. show that the non-equilibrium systems exhibit topologically protected boundary modes that have been known in electronic and mechanical systems.

    • Arvind Murugan
    •  & Suriyanarayanan Vaikuntanathan
  • Article
    | Open Access

    Identifying and quantifying dissimilarities among graphs is a problem of practical importance, but current approaches are either limited or computationally demanding. Here, the authors propose an efficiently computable measure for network comparison that can identify structural topological differences.

    • Tiago A. Schieber
    • , Laura Carpi
    •  & Martín G. Ravetti
  • Article
    | Open Access

    Whole-brain networks of long-range neuronal pathways are characterized by interdependencies between structural features. Here the author shows that module hierarchy and rich club features in these networks are structural byproducts (spandrels) of module and hub constraints, but not of wiring-cost constraints.

    • Mikail Rubinov
  • Article
    | Open Access

    Network science and game theory have been traditionally combined to analyse interactions between nodes of a network. Here, the authors model competition for importance among networks themselves, and reveal dominance of the underdogs in the fate of networks-of-networks.

    • Jaime Iranzo
    • , Javier M. Buldú
    •  & Jacobo Aguirre
  • Article
    | Open Access

    Flexible information routing underlies the function of many biological and artificial networks. Here, the authors present a theoretical framework that shows how information can be flexibly routed across networks using collective reference dynamics and how local changes may induce remote rerouting.

    • Christoph Kirst
    • , Marc Timme
    •  & Demian Battaglia
  • Article
    | Open Access

    Understanding how to control complex networks can be useful to steer interconnected systems towards a desired state. Here, the authors introduce the concept of network permeability, a unified metric of the propensity of a network to be controllable taking into account physical and economic constrains.

    • Francesco Lo Iudice
    • , Franco Garofalo
    •  & Francesco Sorrentino
  • Article |

    Structural patterns such as communities are used to understand the architecture of complex networks, but this is typically obtained for a purely static case. Here the authors introduce a generalized formalism that includes the statistical properties of the event timings.

    • Jean-Charles Delvenne
    • , Renaud Lambiotte
    •  & Luis E. C. Rocha
  • Article
    | Open Access

    Network controllability has numerous applications in natural and technological systems. Here, Gao et al.develop a theoretical approach and a greedy algorithm to study target control—the ability to efficiently control a preselected subset of nodes—in complex networks.

    • Jianxi Gao
    • , Yang-Yu Liu
    •  & Albert-László Barabási
  • Article
    | Open Access

    Although it has been possible to calculate the conditions for exerting complete control over a directed complex network, for undirected and weighted networks this calculation is inexact. Yuan et al. develop a general framework for determining the controllability of any complex network.

    • Zhengzhong Yuan
    • , Chen Zhao
    •  & Ying-Cheng Lai
  • Article |

    The control of a complex network can be achieved by different combinations of relatively few driver nodes. Tao Jia and colleagues show that this can lead to two distinct control modes—centralized or distributed—that determine the number of nodes that can act as driver node.

    • Tao Jia
    • , Yang-Yu Liu
    •  & Albert-László Barabási