Random Walks on Multiplex Networks

TL;DR

This paper extends random walk models to multiplex networks, deriving exact formulas for exploration metrics and analyzing how topology and strategies influence navigability in interconnected layered systems.

Contribution

It introduces a novel type of random walk specific to multiplex networks and provides analytical expressions for key exploration properties.

Findings

Coverage depends on layer topology and inter-connection weights

New multiplex-specific random walk type introduced

Exploration efficiency varies with walk strategy and network structure

Abstract

Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this supplementary material for the paper "Navigability of interconnected networks under random failures", we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficiency in exploring the multiplex critically depends on the underlying topology of layers, the weight of their inter-connections and the strategy adopted to walk.