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.