Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
