Figure 1. Illustration of the Lévy flight navigation strategy on a multiplex network.

In the toy model, we consider a three-layer multiplex network and show two different paths that can lead the walker to the yellow node (one involves a Lévy flight and the other implies that the walker follows the topological path of the graph). The right panel summarizes the different elementary steps that a walker can adopt in our model as indicated.