activity
20122025
most citedLong-Range Navigation on Complex Networks using Lévy Random Walks

108 citations · 628 across the 28 of their papers we have counts for

collaborators

28 papers

cond-mat.stat-mech2025

Dissimilarity measures for generalized Lotka-Volterra systems on networks

Nicolás A. Márquez, Maryam Chaib De Mares, Alejandro P. Riascos

In this paper, we introduce a general framework to quantify dissimilarities between generalized Lotka-Volterra dynamical processes, ranging from classical predator-prey systems to…

physics.soc-ph2025★ 1 cited

From motifs to Lévy flights: Modeling urban mobility in Bogotá's public transport system

Juan F. Alayón-Martínez, Alejandro P. Riascos

In this paper, we study two years of access card validation records from Bogotá's multimodal public transport system, comprising over 2.3 billion trips across bus rapid transit, fe…

cond-mat.stat-mech2025★ 4 cited

Mean first-encounter times of simultaneous random walkers with resetting on networks

Daniel Rubio-Gómez, Alejandro P. Riascos, José L. Mateos

We investigate the dynamics of simultaneous random walkers with resetting on networks and derive exact analytical expressions for the mean first-encounter times of Markovian random…

cond-mat.stat-mech2024

Random walks with long-range memory on networks

Ana Gabriela Guerrero-Estrada, Alejandro P. Riascos, Denis Boyer

We study an exactly solvable random walk model with long-range memory on arbitrary networks. The walker performs unbiased random steps to nearest-neighbor nodes and intermittently…

cond-mat.stat-mech2024★ 4 cited

Antifragility of stochastic transport on networks with damage

L. K. Eraso-Hernandez, A. P. Riascos

A system is called antifragile when damage acts as a constructive element improving the performance of a global function. In this paper, we analyze the emergence of antifragility i…

cond-mat.stat-mech2023

Dissimilarity between synchronization processes on networks

Alejandro P. Riascos

In this study, we present a general framework for comparing two dynamical processes that describe the synchronization of oscillators coupled through networks of the same size. We i…

physics.soc-ph2023★ 15 cited

Temporal visitation patterns of points of interest in cities on a planetary scale: a network science and machine learning approach

Francisco Betancourt, Alejandro P. Riascos, José L. Mateos

We aim to study the temporal patterns of activity in points of interest of cities around the world. In order to do so, we use the data provided by the online location-based social…

cond-mat.stat-mech2022★ 3 cited

A measure of dissimilarity between diffusive processes on networks

Alejandro P. Riascos, Francisco Hernández Padilla

In this paper, we present a framework to compare the differences in the occupation probabilities of two random walk processes, which can be generated by modifications of the networ…

cond-mat.stat-mech2021★ 8 cited

Optimal exploration of random walks with local bias on networks

Christopher Sebastian Hidalgo Calva, Alejandro P. Riascos

We propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors d…

q-bio.PE2021★ 28 cited

A simple model of epidemic dynamics with memory effects

Michael Bestehorn, Thomas M. Michelitsch, Bernard A. Collet +2

We introduce a modified SIR model with memory for the dynamics of epidemic spreading in a constant population of individuals. Each individual is in one of the states susceptible ($…

physics.soc-ph2021★ 8 cited

Evolution of transport under cumulative damage in metro systems

L. K. Eraso-Hernandez, A. P. Riascos, T. M. Michelitsch +1

One dominant aspect of cities is transport and massive passenger mobilization which remains a challenge with the increasing demand on the public as cities grow. In addition, public…

cond-mat.stat-mech2021★ 14 cited

Discrete-time random walks and Lévy flights on arbitrary networks: when resetting becomes advantageous?

Alejandro P. Riascos, Denis Boyer, José L. Mateos

The spectral theory of random walks on networks of arbitrary topology can be readily extended to study random walks and Lévy flights subject to resetting on these structures. When…

math.PR2021★ 1 cited

Asymmetric random walks with bias generated by discrete-time counting processes

Thomas M. Michelitsch, Federico Polito, Alejandro P. Riascos

We introduce a new class of asymmetric random walks on the one-dimensional infinite lattice. In this walk the direction of the jumps (positive or negative) is determined by a discr…

cond-mat.stat-mech2021★ 44 cited

Diffusive transport on networks with stochastic resetting to multiple nodes

Fernanda H. González, Alejandro P. Riascos, Denis Boyer

We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. We deduce analytical expressions for the stationary oc…

cond-mat.stat-mech2020★ 10 cited

Random walks on networks with preferential cumulative damage: Generation of bias and aging

L. K. Eraso-Hernandez, A. P. Riascos, T. M. Michelitsch +1

In this paper, we explore the reduction of functionality in a complex system as a consequence of cumulative random damage and imperfect reparation, a phenomenon modeled as a dynami…

physics.soc-ph2020★ 31 cited

A markovian random walk model of epidemic spreading

Michael Bestehorn, Alejandro P. Riascos, Thomas M. Michelitsch +1

We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently t…

cond-mat.stat-mech2020★ 19 cited

Mean encounter times for multiple random walkers on networks

Alejandro P. Riascos, David P. Sanders

We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of independent (Markov…

cond-mat.stat-mech2020★ 21 cited

Nonlocal biased random walks and fractional transport on directed networks

A. P. Riascos, T. M. Michelitsch, A. Pizarro-Medina

In this paper, we study nonlocal random walk strategies generated with the fractional Laplacian matrix of directed networks. We present a general approach to analyzing these strate…

cond-mat.stat-mech2019★ 1 cited

Generalized space-time fractional dynamics in networks and lattices

Thomas M. Michelitsch, Alejandro Perez Riascos, Bernard Collet +2

We analyze generalized space-time fractional motions on undirected networks and lattices. The continuous-time random walk (CTRW) approach of Montroll and Weiss is employed to subor…

cond-mat.stat-mech2019★ 96 cited

Random walks on networks with stochastic resetting

Alejandro P. Riascos, Denis Boyer, Paul Herringer +1

We study random walks with stochastic resetting to the initial position on arbitrary networks. We obtain the stationary probability distribution as well as the mean and global firs…

physics.soc-ph2019★ 17 cited

Aging in transport processes on networks with stochastic cumulative damage

A. P. Riascos, J. Wang-Michelitsch, T. M. Michelitsch

In this paper we explore the evolution of transport capacity on networks with stochastic incidence of damage and accumulation of faults in their connections. For each damaged confi…

cond-mat.stat-mech2019★ 18 cited

Continuous time random walk and diffusion with generalized fractional Poisson process

Thomas M. Michelitsch, Alejandro P. Riascos

A non-Markovian counting process, the `generalized fractional Poisson process' (GFPP) introduced by Cahoy and Polito in 2013 is analyzed. The GFPP contains two index parameters $0<…

cond-mat.stat-mech2019★ 20 cited

Generalized fractional Poisson process and related stochastic dynamics

Thomas M. Michelitsch, Alejandro P. Riascos

We survey the 'generalized fractional Poisson process' (GFPP). The GFPP is a renewal process generalizing Laskin's fractional Poisson counting process and was first introduced by C…

cond-mat.stat-mech2019★ 4 cited

Random walks on weighted networks: Exploring local and non-local navigation strategies

A. P. Riascos, José L. Mateos

In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general appro…