108 citations · 628 across the 28 of their papers we have counts for
20 papers · 1 filter
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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…
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<…
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…
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…
Fractional random walk lattice dynamics
Thomas Michelitsch, Bernard Collet, Alejandro Perez Riascos +2
We analyze time-discrete and continuous `fractional' random walks on undirected regular networks with special focus on cubic periodic lattices in dimensions. The fract…
Fractional dynamics on networks: Emergence of anomalous diffusion and Lévy flights
A. P. Riascos, José L. Mateos
We introduce a formalism of fractional diffusion on networks based on a fractional Laplacian matrix that can be constructed directly from the eigenvalues and eigenvectors of the La…
Long-Range Navigation on Complex Networks using Lévy Random Walks
A. P. Riascos, José L. Mateos
We introduce a strategy of navigation in undirected networks, including regular, random, and complex networks, that is inspired by Lévy random walks, generalizing previous navigati…