In this article, we present a survey of different types of random walk models with local and
non-local transitions on undirected weighted networks. We present a general approach by …

We analyze the massive data set of more than one billion taxi trips in New York City, from
January 2009 to December 2015. With these records of seven years, we generate an origin …

This book analyzes stochastic processes on networks and regular structures such as lattices
by employing the Markovian random walk approach. Part 1 is devoted to the study of local …

In this paper, we explore different Markovian random walk strategies on networks with
transition probabilities between nodes defined in terms of functions of the Laplacian matrix …

We study the predator-prey game, an intriguing collective and dynamic process in nature, on
complex networks. The game is over when the prey and the predator meet at the same …

Our investigation centres on assessing the importance of a biased parameter (α) in a
multiplex Markov chain (MMC) model that is characterized by biased random walks in …

Random walks constitute a basic mechanism for diffusion processes occurring on multiplex
networks composed by different layers describing interactions of different nature. However …

It has been recognized that random search processes are an important branch of network
science. The importance originates from their broad relevance ranging from disease …

Transport on weighted graphs is a general framework to study a variety of physical and
social phenomena, serving to characterize the transport efficiency or propagation of …

We introduce lowest-degree preference random walks on complex networks for which the
walker concurrently adopts random walk strategy and lowest-degree search strategy …