14 citations · 53 across the 9 of their papers we have counts for
7 papers · 1 filter
Prime stars multiplexes
Alfonso Allen-Perkins, Roberto F. S. Andrade
This work investigates the class of prime star multiplexes, in which each of its layers , , consists of a regular cycle graph where any node has neighbor…
Fractional dynamics on circulant multiplex networks: optimal coupling and long-range navigation for continuous-time random walks
Alfonso Allen-Perkins, Roberto F. S. Andrade
This work analyzes fractional continuous-time random walks on two-layer multiplexes. A node-centric dynamics is used, in which it is assumed a Poisson distribution of a walker to b…
Markov chain approach to anomalous diffusion on Newman-Watts networks
Alfonso Allen-Perkins, Alfredo Blanco Serrano, Thiago Albuquerque de Assis +2
A Markov chain (MC) formalism is used to investigate the mean-square displacement (MSD) of a random walker on Newman-Watts (NW) networks. It leads to a precise analysis of the cond…
Random spherical graphs
Alfonso Allen-Perkins
This work addresses a modification of the random geometric graph (RGG) model by considering a set of points uniformly and independently distributed on the surface of a -sphe…
Superdiffusion on complex networks: the role of shortcuts and long-range interactions
Alfonso Allen-Perkins, Alfredo Blanco Serrano, Thiago Albuquerque de Assis +2
This work addresses the superdiffusive motion of a discrete time random walker on ordered discrete substrates and complex networks with the presence of long-range interactions (LRI…
Relaxation time of the global order parameter on multiplex networks: the role of interlayer coupling in Kuramoto oscillators
Alfonso Allen-Perkins, Thiago Albuquerque de Assis, Juan Manuel Pastor +1
This work considers the timescales associated with the global order parameter and the interlayer synchronization of coupled Kuramoto oscillators on multiplexes. For the two-layer m…
Two-walks degree assortativity in graphs and networks
Alfonso Allen-Perkins, Juan Manuel Pastor, Ernesto Estrada
Degree ssortativity is the tendency for nodes of high degree (resp.low degree) in a graph to be connected to high degree nodes (resp. to low degree ones). It is sually quantified b…