# Information transfer in community structured multiplex networks

- Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Tarragona, Spain

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.

## 1. Introduction

The study of transport properties of networks is becoming increasingly important due to the constantly growing amount of information and commodities being transferred through them. A particular focus of these studies is how to make the capacity of the diffusion of information in the network maximal while minimizing the delivery time. In the basic approach information is formed by units, the “packets,” and the handling of information for processing and distribution takes finite time. Both network packet routing strategies and network topology play an essential role in networks' traffic flow. In realistic settings, like online social networks, the knowledge that any one has about the topology of the network is limited to its local area of influence. Consequently, much of the focus in recent studies has been on “searchability,” the process of sending information to a target when the trajectory to reach the target is unknown. Moreover, given the limited capability of nodes to handle information packets and redistribute them, the problem of congestion arises [1–3]. It has been observed, both in real world networks and in model communication networks, that the network flow collapses when the load (number of packets to be processed) is above a certain threshold [3].

In general, most real and engineered systems include multiple subsystems and layers of connectivity, and it is important to take such features into account when trying to obtain a complete understanding of them. It is thus necessary to generalize the “traditional” network theory to multilayer systems in a comprehensive fashion [4, 5]. Generally speaking, up to now, the description of networks so far has been developed using a single and combined snapshot of the connectivity, which is a reflection of instantaneous interactions or accumulated interactions in a certain time window. This description is limited when trying to understand the intricate variability of real complex systems, which contain many different time scales [6] and coexisting structural patterns forming the real network of interactions [7]. This is the case of e-social networks that are constantly changing [8], having some connections with very short lifetime and others that are persistent. Interest groups [9] are constantly being developed and growing, and individual nodes participate through different interests at the same time. An accurate description of such complexity should take into account these differences of interactions and their evolution through time. In the last couple of years, the scientific community on networks theory has focused on this issue and proposed a solution that has been commonly referred to as the multiplex network structure [4].

General flows on multiplex networks have also been in the focus of network scientists [10–17], and the consequences of having such topologies have been shown to be far from trivial. For example, in Solé-Ribalta et al. [18] the authors found that a general diffusive process on top of the multiplex structure is able to speed up the less diffusive of the layers. It could also give rise to a super-diffusion process thus enhancing the diffusion of both layers. This striking result appears when the diffusion between the layers of the multiplex is faster than that occurring within each of the layers. These consequences are also observed in the discrete representation of diffusion by random walkers [17], and have explicit consequences on the navigability of the multiplex structure.

Here we fix our attention in the process of information transfer on top of multiplex networks. Specifically, we aim at determining the structural effects of a multiplex network endowing community structure, i.e., modular at each layer, on the dynamics of information transfer. To this end we have investigated a particular set up in which multiplex networks are built connecting different modular networks, and determining analytically the onset of congestion in the information flow. Our results reveal that when the community structure of the different layers is equivalent and the communities overlap, the multiplex offers higher resilience to congestion and consequently the system may improve information transfer compared to the individual layers. On the other side when the community structure is considerably different and communities still overlap the multiplex structure offers a balancing environment where the efficiency of the system is averaged. On the intermediate situation, that is community structure is similar in both layers and communities overlap, the effect of the multiplex structure is devastating and hinders information transfer by reducing the onset of congestion in the system.

## 2. Materials and Methods

The proposed dynamical model considers that information flows through networks in atomic and discrete packets that are sent from an origin node to a destination node. Each node is an independent agent that can store as many packets as necessary. However, to have a realistic picture of communication we must assume that the nodes have a finite capacity to process and deliver packets. That is, a node will take longer to deliver two packets than just one. This physical constraint of the agents on delivering information can derive in network congestion. When the amount of information a particular agent receives is too large, it is not able to handle all the packets and some of them remain undelivered for extremely long periods of time. In this study, the interest is focused on when congestion occurs depending on the topology of the multiplex network, in particular, in relation to its community structure.

### 2.1. Dynamics of Information Transfer

The dynamics of the model is as follows. At each time step *t*, information packets are created at every node with rate ρ (injection rate). Therefore, ρ is the control parameter: small values of ρ correspond to low density of packets and high values of ρ correspond to the generation of a large amount of packets. When a new packet is created, a destination node, different from the origin, is chosen (uniformly) at randomly in the network. Thus, during the following time steps *t* + 1, *t* + 2, …, *t* + *T*, the packet travels toward its destination. Once the packet reaches the destination node, it is delivered and disappears from the network.

The time that a packet remains in the network is related not only to the length of the path between the source and the target nodes, but also to the volume of packets that share its path. Nodes with high loads, i.e., high volume of accumulated packets, will take longer to deliver packets or, in other words, it will take more time steps for packets to cross regions of the network that are highly congested. We assume, without loss of generality, that nodes can handle only one packet per time step (i.e., the delivery rate is τ = 1), and undelivered packets are stored in a first-in-first-out queue attached to each node. The paths followed by packets between source and destination nodes are decided using a routing strategy, being shortest paths and random walks the most prominent strategies. It is important to note, however, that the model is not deterministic. For example, there may be several shortest paths between two nodes, one of them chosen randomly in the delivery of the corresponding packet. Moreover, the order in which packets are stored in the queues when several of them arrive in the same time step is undefined.

Previous work on single layer networks [3] shows that for low values of the injection rate of packets ρ there is no accumulation of packets at any node in the network. Moreover, it is stated that the number of packets that arrive at node *i* is, on average, ρ*B*_{i}/(*N* − 1), where *B*_{i} is the effective betweenness of node *i* and *N* the number of nodes in the network. The effective betweenness is defined as the ratio between the number of paths that pass through node *i*, and the total number of paths traversing the network between any pair of nodes [19].

The onset of congestion is reached when a node receives more packets than it can deliver per time step, i.e., ρ*B*_{i}/(*N* − 1) > 1. Therefore, the first node that collapses (*i**) is the one with largest effective betweenness (*B _{i}** = max

_{i}(

*B*)), and the maximum injection rate for which the network is congestion free, the critical injection rate ρ

_{i}_{c}, is given by

The rest of the nodes will collapse with larger injection rates. However, up to now, it is not known how to analytically compute their critical injection rates since they not only depend on the topological betweenness but also on the overall network congestion.

In the generalization of the routing dynamics exposed to multiplex networks, the average number of packets arriving to node *i* in layer α is ρ*LB*_{iα}/(*N* − 1), where *L* is the number of layers of the multiplex network and *B*_{iα} is the effective betweenness of node *i* in layer α. Thus, the critical injection rate also depends on the effective betweenness, which encapsulates the routing strategy and the topology of the network:

Next, we extend the concept of betweenness to multiplex networks allowing the computation of the onset of congestion.

### 2.2. Computation of betweenness in the Multiplex

The extension of any centrality measures to multiplex networks is not straightforward and requires special care. In many situations several extensions are possible and the choice of it may depend on the problem at hand. Many attempts have been done to extend single layer centrality measures to the multiplex framework [20–22]. Here, we follow the line described in De Domenico et al. [23], which is mathematically grounded on the tensorial formalism for multilayer networks [24].

We start by defining a walk between two individuals *s* and *t* on a multiplex network as a sequence of nodes, following intralayer and/or interlayer edges, which starts at node *s* “in any layer” and finishes in node *t* “in any layer.” Note that in this definition we do not care about the layer, just the node. The reasoning behind this lack of discrimination is that, in the multiplex structure, the different node replicas in the different layers correspond to the same individual (social networks) or location (transportation networks), thus it is only important to know if the packet has arrived, but not in which layer. Figure 1 shows an example of a walk between two nodes in a multilayer network where non-trivial effects can be observed because of the presence of interlayer connections that affect the navigation through the networked system [17].

**Figure 1. Example of a walk (dotted trajectory) between two individuals s and t using a multilayer network**. The walker can jump between nodes within the same layer, or it might switch to another layer. This illustration evidences how multilayer structure allows a walker to move between nodes that belong to different (disconnected) components on a given layer (L1).

Given the definition of a walk in the multiplex topology, the effective betweenness of a node *i* in layer α, *B*_{iα}, can be directly obtained as the fraction of walks that pass through node *i* in layer α for every possible origin-destination pair (*s, t*). In some cases it might be convenient to obtain the betweenness of node *i* irrespective of the layer. In this case, the betweenness can be obtained just by accumulation of the individual contributions of each layer where *i* is represented, *B _{i}* = ∑

_{α}

*B*

_{iα}.

For the specific case of the *shortest path betweenness*, every walk is restricted to be the path with minimum distance that starts from the source node *s* in any layer, and reaches the destination node *t* in any layer. The distance function may take into account the weights of the edges the path traverses. In this work, without loss of generality, we assume the edges' weights are unitary and define the distance as the number of traversed edges in the path. The shortest path between two locations may be degenerated and consequently the set of shortest paths may contain paths using a single layer (classical shortest paths) and paths which change layer (pure multiplex paths). For an accurate computation of the shortest path betweenness special care must be taken with the path degeneration. A good and efficient algorithm can be found in Solé-Ribalta et al. [25].

Equivalently to the shortest path betweenness, the *random walk betweenness* depends on the particular definition of the network traversal procedure. In this case, a random walk is defined as a walk in which, at each time step, the next visited node is chosen with uniform random probability among the neighbors of the last visited node. The random walk betweenness is usually computed considering a transition matrix obtained from the adjacency matrix of the network. For a detailed description of random walks in a multiplex network, see [17]. In this document we will use the classic random walk definition. For the random walk betweenness the walk degeneracy is enormous and consequently is impractical to compute the betweenness accounting for all the possible individual random walks. Fortunately, the random walk betweenness can be efficiently computed using matrix inversion and absorbing random walks [26].

### 2.3. Community Structure in Multiplex

Networks representative of complex systems are characterized by having community structure, meaning the presence of dense groups of nodes with sparse connections between them [27]. It is known that dynamical processes running on top of such networks have a big dependency on community structure, which affects the process either by fostering or hampering it [28–30]. As evidenced in several works [7, 31], when the different layers of a multiplex network exhibit community structure, the influence on the overall system is not trivial to determine.

Here, to uncover the basic effects of communities in information flow process, we propose a simple setting with imposed community structure where communities fully overlap between layers and the degree of each node of the network is kept constant. Each multiplex network consists of two layers, and each layer has 256 nodes distributed in four communities (64 nodes per community) [32]. The links are generated in such a way that the density of links inside the communities is always higher than the density between them. The networks are generated independently for each layer, resulting in a two-layer multiplex network with different community structure in each layer.

For the experiments, we consider 12 different multiplex community structures and 300 different realizations for each. For all of them, we fix the bottom layer (L1) to *k*_{in} = 31 and *k*_{out} = 1 (i.e., 31 edges inside the community and 1 link outside, per node), which displays strong and clear communities, and we vary the community structure of the top layer (L2), which ranges from the previous strong block structure to a more diluted one (*k*_{in} = 20 and *k*_{out} = 12) where the communities are almost imperceptible. We quantify the strength of the community structure of the L2 layer using a mixing parameter defined as μ = *k*_{out}/〈*k*〉. Figure 2 depicts three examples of such generated networks.

**Figure 2. Samples of the multiplex networks generated, represented by means of their superposed adjacency matrices**. From left to right, the top layer diffuses its community structure (increasing mixing parameter), while the bottom layer remains fixed.

## 3. Results

To evaluate the influence of the multiplex networks with community structure in information transfer we assess several aspects of the information transfer dynamics, namely the shortest paths distribution, the packets ingoing rate of each node and the critical injection rate of the network.

Figure 3 shows the obtained distribution of shortest paths in the different layers of the multiplex. In the case of having equivalent community structure in both layers (leftmost points in the plot), the multiplex structure provides a very good load balance where the same fraction of paths traverse using layer 1 and 2. In general, we can conclude that the effect of the multiplex is negligible for the overall system behavior since only a very small fraction of paths (0.5%) makes use of the full multiplex structure. In fact, paths using both layers of the multiplex are only used in the case where the origin and destination are in different communities. As we increase the mixing parameter of the second layer, its community structure dilutes, enhancing the communication between communities but slightly hindering the transfer of information internally. This effect is evident in Figure 3, which shows a large increase of intercommunity trips in the second layer and a small increase of intracommunity paths in the first layer. At the same time, the improvement of intercommunity paths in the more diffuse layer yields a disappearance of the (already small number of) shortest paths using both layers.

**Figure 3. Shortest paths distribution in a multiplex network with community structure as a function of the mixing parameter**. The plot shows the fraction of shortest paths that traverse the network using only layer 1 (with fixed topology), using only layer 2 (with varying topology) and using the full multiplex structure. The horizontal axis corresponds to the mixing parameter. For the paths that only use a single layer, we divide the contribution between paths where the source and target nodes are within the same community and in different communities. There are no intracommunity paths that use both layers.

To assess the microscopic behavior of the system we show how the ingoing rate of packets to each node varies with respect to the mixing parameter. We compute the ingoing rate of each node of the multiplex structure as

Results are shown in Figure 4. For the shortest path routing strategy (subplot A) we observe a clear distinction between the behavior of nodes in layers 1 and 2. As can be seen in Figure 3, the main effect on the increasing of the mixing parameter is clearly a migration of the shortest paths from layer 1 to layer 2, i.e., paths that traversed layer 1 now find a more efficient route through layer 2, which has a more diluted community structure. This migration of paths should increase the ingoing rate of nodes in layer 2 similarly to the observed decrease of ingoing packets of layer 1. This is the situation for small mixing parameters, but increasing the mixing parameter means also an increase in the efficiency of layer 2 routing packets between nodes in different communities, which in turn substantially reduces the overall node betweenness provoking an interesting tradeoff that will prescribe the final efficiency of the full system. These two opposed effects (migration of shortest paths and reduction of node betweenness) have a huge impact on the ingoing rate of nodes in layer 2, which experience a constant decrease after the maximum ingoing rate is reached. For the random routing strategy the scenario is completely different. The increase of the mixing parameter has an equivalent impact in both layers, which experience an important decrease of the ingoing rate.

**Figure 4. Ingoing rate of each node in the network for different mixing parameter values, and two routing strategies: shortest paths (A) and random walks (B)**. The different colors indicate the layer to which the node belongs to.

Figures 5, 6 show the effect of the community structure on the critical injection rate ρ_{c}. For the shortest path routing strategy (Figure 5) the critical injection rate of the multiplex network reaches its minimum value around μ = 0.1. This minimum indicates that there is a worst-case scenario for which the multiplex topology is less efficient than the individual layers. On the other side, the behavior of the critical injection rate of layer 2 is monotonically increasing. This situation is expected since a less clear community structure leads to a reduction of the average shortest path, which in turn is positively correlated with a decrease of the node betweenness.

**Figure 5. Comparison of the critical injection rate of layer 1, layer 2 and the multiplex for different mixing parameter values and shortest path routing strategy**. The values of the critical injection rate for single layer network and multiplex networks are computed using Equations (1) and (2) respectively.

**Figure 6. Comparison of the critical injection rate of layer 1, layer 2 and the multiplex for different mixing parameter values and random walk routing strategy**. The values of the critical injection rate for single layer network and multiplex networks are computed using Equations (1) and (2) respectively.

In general, if we compare the values of ρ_{c} for the multiplex network and the separate layers L1 and L2, we clearly observe three possible situations: (i) the multiplex is more resilient to congestion (efficient) than the individual layers. This situation arises when both layers have a similar community structure. (ii) The multiplex is less efficient than any of the layers. This setup corresponds to the minimum resilience of the multiplex structure. And (iii), the multiplex efficiency achieves a medium value which is a trade-off between the resilience of both layers. In a real setup, this situation would mean that joining those two layers in a multiplex improves the resilience observed in one layer at the cost of deteriorating the resilience observed in the second layer. However, as we can observe in the plot, the reduction of the efficiency is larger than the average of the efficiency of both layers and consequently the coupling of layers is inefficient.

With respect to the random walk routing strategy (Figure 6), the situation is completely different. For similar community structures the multiplex worsens the efficiency, because the paths get trapped within the communities. For different community structures, in general, we obtain a efficiency that corresponds to the average efficiency of both layers.

## 4. Discussion

We have shown that packet information flow can be compromised when community structure is considered in some layer of the multiplex network structure. Since community structure implies the presence of topological bottlenecks, the information flows migrate to those layers where these constraints are relaxed (diluted communities). We have shown that community structures produce a non-trivial effect in the transfer of information and in the resilience to information flow congestion, that here defines the efficiency of the structure. Essentially, the better defined the communities, the more affected the packet transportation. Information tries to avoid bottlenecks and packets migrate toward the layer where the community structure is diluted, because it is more efficient, but as a direct consequence of this migration the most efficient layer becomes overloaded. This nonlinear relation makes the problem of assessing the performance of the multiplex structure particularly challenging.

Using the analytical approach presented, we are able to determine for any multiplex topology what is the onset of congestion in the information flow and how it compares with the onset of the individual layers. We have also provided results, for very specific scenarios, of shortest path and random walk routing strategies respectively. The results show that the shortest path approach heavily depend on the particular sharpness of the prescribed communities. This work provides the starting point for the discrete flow analysis of more complicated scenarios of community structure in multiplex networks.

## Author Contributions

All the authors contributed equally to the article.

## Conflict of Interest Statement

The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.

## Acknowledgments

This work has been supported by Ministerio de Economía y Competitividad (Grant FIS2012-38266) and European Commission FET-Proactive Projects PLEXMATH (Grant 317614). AA also acknowledges partial financial support from the ICREA Academia and the James S. McDonnell Foundation.

## References

1. Guimera R, Arenas A, Dıaz-Guilera A. Communication and optimal hierarchical networks. *Phys A Stat Mech Appl*. (2001) **299**:247–52. doi: 10.1016/S0378-4371(01)00302-8

2. Arenas A, Danon L, Díaz-Guilera A, Guimerà R. Local search with congestion in complex communication networks. In: Bubak M, van Albada GD, Sloot PMA, Dongarra J, editors. *Computational Science-ICCS 2004*. Kraków: Springer (2004). p. 1078–85. doi: 10.1007/978-3-540-24688-6_139

3. Guimerà R, Diaz-Guilera A, Vega-Redondo F, Cabrales A, Arenas A. Optimal network topologies for local search with congestion. *Phys Rev Lett.* (2002) **89**:248701. doi: 10.1103/PhysRevLett.89.248701

4. Kivelä M, Arenas A, Barthelemy M, Gleeson JP, Moreno Y, Porter MA. Multilayer networks. *J Comp Netw.* (2014) **2**:203–71. doi: 10.1093/comnet/cnu016

5. Boccaletti S, Bianconi G, Criado R, del Genio CI, Gómez-Gardeñes J, Romance M, et, al. The structure and dynamics of multilayer networks. *Phys Rep.* (2014) **544**:1–122. doi: 10.1016/j.physrep.2014.07.001

6. Gauvin L, Panisson A, Cattuto C. Detecting the community structure and activity patterns of temporal networks: a non-negative tensor factorization approach. *PLoS ONE* (2014) **9**:e86028. doi: 10.1371/journal.pone.0086028

7. Mucha PJ, Richardson T, Macon K, Porter MA, Onnela JP. Community structure in time-dependent, multiscale, and multiplex networks. *Science* (2010) **328**:876–8. doi: 10.1126/science.1184819

8. Godoy-Lorite A, Guimera R, Sales-Pardo M. Long-term evolution of techno-social networks: statistical regularities, predictability and stability of social behaviors. (2015). arXiv:1506:01516

10. Brummitt CD, Lee KM, Goh KI. Multiplexity-facilitated cascades in networks. *Phys Rev E* (2012) **85**:045102. doi: 10.1103/PhysRevE.85.045102

11. Yağan O, Gligor V. Analysis of complex contagions in random multiplex networks. *Phys Rev E* (2012) **86**:036103. doi: 10.1103/PhysRevE.86.036103

12. Lambiotte R, Delvenne JC, Barahona M. Random walks, markov processes and the multiscale modular organization of complex networks. *Netw Sci Eng IEEE Trans.* (2014) **1**:76–90. doi: 10.1109/TNSE.2015.2391998

13. Lambiotte R, Salnikov V, Rosvall M. Effect of memory on the dynamics of random walks on networks. *J Comp Netw.* (2015) **3**:177–88. doi: 10.1093/comnet/cnu017

14. Bagnoli F, Massaro E. Risk perception and epidemic spreading in multiplex networks. In: *ISCS 2014: Interdisciplinary Symposium on Complex Systems.* Florence: Springer (2015). p. 319–32. doi: 10.1007/978-3-319-10759-2_33

15. Zhao D, Li L, Peng H, Luo Q, Yang Y. Multiple routes transmitted epidemics on multiplex networks. *Phys Lett A* (2014) **378**:770–6. doi: 10.1016/j.physleta.2014.01.014

16. Gómez S, Díaz-Guilera A, Gómez-Gardeñes J, Pérez-Vicente CJ, Moreno Y, Arenas A. Diffusion Dynamics on Multiplex Networks. *Phys Rev Lett.* (2013) **110**:028701. doi: 10.1103/PhysRevLett.110.028701

17. De Domenico M, Solé-Ribalta A, Gómez S, Arenas A. Navigability of interconnected networks under random failures. *Proc Natl Acad Sci USA.* (2014) **111**:8351–6. doi: 10.1073/pnas.1318469111

18. Solé-Ribalta A, De Domenico M, Kouvaris NE, Díaz-Guilera A, Gómez S, Arenas A. Spectral properties of the Laplacian of multiplex networks. *Phys Rev E* (2013) **88**:032807. doi: 10.1103/PhysRevE.88.032807

19. Newman M. *Networks: An Introduction*. New York, NY, USA: Oxford University Press, Inc. (2010). doi: 10.1093/acprof:oso/9780199206650.001.0001

20. Halu A, Mondragón RJ, Panzarasa P, Bianconi G. Multiplex PageRank. *PLoS ONE* (2013) **8**:e78293. doi: 10.1371/journal.pone.0078293

21. Battiston F, Nicosia V, Latora V. Structural measures for multiplex networks. *Phys Rev E* (2014) **89**:032804. doi: 10.1103/PhysRevE.89.032804

22. Sola L, Romance M, Criado R, Flores J, del Amo AG, Boccaletti S. Eigenvector centrality of nodes in multiplex networks. *Chaos* (2013) **3**:033131. doi: 10.1063/1.4818544

23. De Domenico M, Solé-Ribalta A, Omodei E, Gómez S, Arenas A. Ranking in interconnected multilayer networks reveals versatile nodes. *Nat Commun.* (2015) **6**:6868. doi: 10.1038/ncomms7868

24. De Domenico M, Solé-Ribalta A, Cozzo E, Kivelä M, Moreno Y, Porter MA, et al. Mathematical formulation of multilayer networks. *Phys Rev X* (2013) **3**:041022. doi: 10.1103/PhysRevX.3.041022

25. Solé-Ribalta A, De Domenico M, Gómez S, Arenas A. Centrality rankings in multiplex networks. In: *ACM Web Science Conference, WebSci '14*, Bloomington, IN (2014). p. 149–55. doi: 10.1145/2615569.2615687

26. Solé-Ribalta A, De Domenico M, Gómez S, Arenas A. Random walk centrality in interconnected multilayer networks. (2015). arXiv:1506.07165

27. Fortunato S. Community detection in graphs. *Phys Rep.* (2010) **486**:75–174. doi: 10.1016/j.physrep.2009.11.002

28. Liu Z, Hu B. Epidemic spreading in community networks. *Eur Lett.* (2005) **72**:315. doi: 10.1209/epl/i2004-10550-5

29. Arenas A, Díaz-Guilera A, Pérez-Vicente CJ. Synchronization Reveals Topological Scales in Complex Networks. *Phys Rev Lett.* (2006) **96**:114102. doi: 10.1103/PhysRevLett.96.114102

30. Arenas A, Daz-Guilera A, Prez-Vicente CJ. Synchronization processes in complex networks. *Phys D Nonlin Phenom.* (2006) **224**:27–34. doi: 10.1016/j.physd.2006.09.029

31. Bennett L, Kittas A, Muirhead G, Papageorgiou LG, Tsoka S. Detection of composite communities in multiplex biological networks. *Sci. Rep.* (2015) **5**:10345. doi: 10.1038/srep10345

Keywords: complex networks, information diffusion, multivariate analysis, community structure, centrality

Citation: Solé-Ribalta A, Granell C, Gómez S and Arenas A (2015) Information transfer in community structured multiplex networks. *Front. Phys*. 3:61. doi: 10.3389/fphy.2015.00061

Received: 30 June 2015; Accepted: 28 July 2015;

Published: 18 August 2015.

Edited by:

Taha Yasseri, University of Oxford, UKReviewed by:

Renaud Lambiotte, University of Namur, BelgiumNuno A. M. Araújo, Universidade de Lisboa, Portugal

Copyright © 2015 Solé-Ribalta, Granell, Gómez and Arenas. This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.

*Correspondence: Albert Solé-Ribalta, Departament d'Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Avinguda Països Catalans 26, 43007 Tarragona, Spain, albert.sole@urv.cat