Publications -- navigation

The information on this website are distributed only for academic and research purposes.

  Information transfer in community structured multiplex networks

Frontiers in Physics 3, 61 - http://dx.doi.org/10.3389/fphy.2015.00061 - 2015

A. Sole-Ribalta, C. Granell, S. Gómez and A. Arenas


The study of complex networks that account for different types of interactions has become a subject of interest in the last few years, specially because its representational power in the description of users interactions in diverse online social platforms (Facebook, Twitter, Instagram, etc.). The mathematical description of these interacting networks has been coined under the name of multilayer networks, where each layer accounts for a type of interaction. It has been shown that diffusive processes on top of these networks present a phenomenology that cannot be explained by the naive superposition of single layer diffusive phenomena but require the whole structure of interconnected layers. Nevertheless, the description of diffusive phenomena on multilayer networks has obviated the fact that social networks have strong mesoscopic structure represented by different communities of individuals driven by common interests, or any other social aspect. In this work, we study the transfer of information in multilayer networks with community structure. The final goal is to understand and quantify, if the existence of well-defined community structure at the level of individual layers, together with the multilayer structure of the whole network, enhances or deteriorates the diffusion of packets of information.

  Navigability of interconnected networks under random failures

PNAS 11, 8351 - DOI: 10.1073/pnas.1318469111 - 2014

M. De Domenico, A. Sole-Ribalta, S. Gomez, A. Arenas


Assessing the navigability of interconnected networks (transporting information, people, or goods) under eventual random failures is of utmost importance to design and protect critical infrastructures. Random walks are a good proxy to determine this navigability, specifically the coverage time of random walks, which is a measure of the dynamical functionality of the network. Here, we introduce the theoretical tools required to describe random walks in interconnected networks accounting for structure and dynamics inherent to real systems. We develop an analytical approach for the covering time of random walks in interconnected networks and compare it with extensive Monte Carlo simulations. Generally speaking, interconnected networks are more resilient to random failures than their individual layers per se, and we are able to quantify this effect. As an application, which we illustrate by considering the public transport of London, we show how the efficiency in exploring the multiplex critically depends on layers’ topology, interconnection strengths, and walk strategy. Our findings are corroborated by data-driven simulations, where the empirical distribution of check-ins and checks-out is considered and passengers travel along fastest paths in a network affected by real disruptions. These findings are fundamental for further development of searching and navigability strategies in real interconnected systems.

  On the Routability of the Internet

Dynamics On and Of Complex Networks, Volume 2, A. Mukherjee, M. Choudhury, F. Peruani, N. Ganguly and B. Mitra (eds.), Modeling and Simulation in Science, Engineering and Technology, 41-54 - - 2013

P. Erola, S. Gomez and A. Arenas


The Internet is increasingly changing the way we do everyday tasks at work, at home, and how we communicate with one another. In its entrails, the Internet is structured as a network of networks. From a bottom-up perspective, the Internet is made up of networks of routers, each one under the control of a single technical administration. These networks are called Autonomous Systems (AS). An AS can use an exterior gateway protocol to route packets to other ASes [35] forming one of the largest synthetic complex system ever built. The Internet1 comprises a decentralized collection of more than 30,000 computer networks from all around the world. Two ASes are connected if and only if they establish a business relationship (customer-provider or peer-topeer relationships), making the Internet a “living” self-organized system