On information spreading in multiplex networks with gossip mechanism

In this work, we investigate information spreading in multiplex networks, adopting the gossip (random-walk) based model. Two key features of multiplex networks allow potentially much faster information spreading: availability of multiple channels and communication actions for each user, and more choices on neighbor contacting. As a first work in this area, we explore the impact of layer number, layer similarity, and average node degree on the efficiency of information spreading, and theoretically prove our results. Another observation is that multiplex network structure can improve network connectivity. Simulation results are provided to support and complement theoretical analysis.

[1]  Mason A. Porter,et al.  Multilayer networks , 2013, J. Complex Networks.

[2]  Dawei Zhao,et al.  Multiple routes transmitted epidemics on multiplex networks , 2013, ArXiv.

[3]  H. E. McKean,et al.  Tables of the Incomplete Beta Function , 1968 .

[4]  Devavrat Shah,et al.  Gossip Algorithms , 2009, Found. Trends Netw..

[5]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[6]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[7]  H. Dai,et al.  Asynchronous Gossip in Multiplex Networks , 2016 .

[8]  Z. Wang,et al.  The structure and dynamics of multilayer networks , 2014, Physics Reports.

[9]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[10]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[11]  Sergio Gómez,et al.  On the dynamical interplay between awareness and epidemic spreading in multiplex networks , 2013, Physical review letters.

[12]  B. Bollobás.  The evolution of random graphs , 1984 .