Search

We study epidemic spreading in complex networks by a multiple random walker approach. Each walker performs an independent simple Markovian random walk on a complex undirected (ergodic) random graph where we focus on the Barabási-Albert (BA), Erdös-Rényi (ER), and Watts-Strogatz (WS) types. Both walkers and nodes can be either susceptible (S) or infected and infectious (I), representing their state of health. Susceptible nodes may be infected by visits of infected walkers, and susceptible walkers may be infected by visiting infected nodes. No direct transmission of the disease among walkers (or among nodes) is possible. This model mimics a large class of diseases such as Dengue and Malaria with the transmission of the disease via vectors (mosquitoes). Infected walkers may die during the time span of their infection, introducing an additional compartment D of dead walkers. Contrary to the walkers, there is no mortality of infected nodes. Infected nodes always recover from their infection after a random finite time span. This assumption is based on the observation that infectious vectors (mosquitoes) are not ill and do not die from the infection. The infectious time spans of nodes and walkers, and the survival times of infected walkers, are represented by independent random variables. We derive stochastic evolution equations for the mean-field compartmental populations with the mortality of walkers and delayed transitions among the compartments. From linear stability analysis, we derive the basic reproduction numbers RM,R0 with and without mortality, respectively, and prove that RM1, the healthy state is unstable, whereas for zero mortality, a stable endemic equilibrium exists (independent of the initial conditions), which we obtained explicitly. We observed that the solutions of the random walk simulations in the considered networks agree well with the mean-field solutions for strongly connected graph topologies, whereas less well for weakly connected structures and for diseases with high mortality. Our model has applications beyond epidemic dynamics, for instance in the kinetics of chemical reactions, the propagation of contaminants, wood fires, and others.

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 introduce a measure of dissimilarity defined in terms of a metric on a hypertorus, allowing us to compare the phases of coupled oscillators. In the first part, this formalism is implemented to examine systems of networked identical phase oscillators that evolve with the Kuramoto model. In particular, we analyze the effect of the weight of an edge in the synchronization of two oscillators, the introduction of new sets of edges in interacting cycles, the effect of bias in the couplings, and the addition of a link in a ring. We also compare the synchronization of nonisomorphic graphs with four nodes. Finally, we explore the dissimilarities generated when we contrast the Kuramoto model with its linear approximation for different random initial phases in deterministic and random networks. The approach introduced provides a general tool for comparing synchronization processes on networks, allowing us to understand the dynamics of a complex system as a consequence of the coupling structure and the processes that can occur in it.

We study an epidemic model for a constant population by taking into account four compartments of the individuals characterizing their states of health. Each individual is in one of the following compartments: susceptible S; incubated, i.e., infected yet not infectious, C; infected and infectious I; and recovered, i.e., immune, R. An infection is visible only when an individual is in state I. Upon infection, an individual performs the transition pathway S→C→I→R→S, remaining in compartments C, I, and R for a certain random waiting time t_{C}, t_{I}, and t_{R}, respectively. The waiting times for each compartment are independent and drawn from specific probability density functions (PDFs) introducing memory into the model. The first part of the paper is devoted to the macroscopic S-C-I-R-S model. We derive memory evolution equations involving convolutions (time derivatives of general fractional type). We consider several cases. The memoryless case is represented by exponentially distributed waiting times. Cases of long waiting times with fat-tailed waiting-time distributions are considered as well where the S-C-I-R-S evolution equations take the form of time-fractional ordinary differential equations. We obtain formulas for the endemic equilibrium and a condition of its existence for cases when the waiting-time PDFs have existing means. We analyze the stability of healthy and endemic equilibria and derive conditions for which the endemic state becomes oscillatory (Hopf) unstable. In the second part, we implement a simple multiple-random-walker approach (microscopic model of Brownian motion of Z independent walkers) with random S-C-I-R-S waiting times in computer simulations. Infections occur with a certain probability by collisions of walkers in compartments I and S. We compare the endemic states predicted in the macroscopic model with the numerical results of the simulations and find accordance of high accuracy. We conclude that a simple random-walker approach offers an appropriate microscopic description for the macroscopic model. The S-C-I-R-S-type models open a wide field of applications allowing the identification of pertinent parameters governing the phenomenology of epidemic dynamics such as extinction, convergence to a stable endemic equilibrium, or persistent oscillatory behavior.

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 network Foursquare, where users make check-ins that indicate points of interest in the city. The data set comprises more than 90 million check-ins in 632 cities of 87 countries in 5 continents. We analyzed more than 11 million points of interest including all sorts of places: airports, restaurants, parks, hospitals, and many others. With this information, we obtained spatial and temporal patterns of activities for each city. We quantify similarities and differences of these patterns for all the cities involved and construct a network connecting pairs of cities. The links of this network indicate the similarity of temporal visitation patterns of points of interest between cities and is quantified with the Kullback-Leibler divergence between two distributions. Then, we obtained the community structure of this network and the geographic distribution of these communities worldwide. For comparison, we also use a Machine Learning algorithm-unsupervised agglomerative clustering-to obtain clusters or communities of cities with similar patterns. The main result is that both approaches give the same classification of five communities belonging to five different continents worldwide. This suggests that temporal patterns of activity can be universal, with some geographical, historical, and cultural variations, on a planetary scale., (© 2023. The Author(s).)

We propose local-biased random walks on general networks where a Markovian walker is defined by different types of biases in each node to establish transitions to its neighbors depending on their degrees. For this ergodic dynamics, we explore the capacity of the random walker to visit all the nodes characterized by a global mean first passage time. This quantity is calculated using eigenvalues and eigenvectors of the transition matrix that defines the dynamics. In the first part, we illustrate how our framework leads to optimal exploration for small-size graphs through the analysis of all the possible bias configurations. In the second part, we study the most favorable configurations in each node by using simulated annealing. This heuristic algorithm allows obtaining approximate solutions of the optimal bias in different types of networks. The results show how the local bias can optimize the exploration of the network in comparison with the unbiased random walk. The methods implemented in this research are general and open the doors to a broad spectrum of tools applicable to different random walk strategies and dynamical processes on networks.

We introduce a compartment model with memory for the dynamics of epidemic spreading in a constant population of individuals. Each individual is in one of the states S=susceptible, I=infected, or R=recovered (SIR model). In state R an individual is assumed to stay immune within a finite-time interval. In the first part, we introduce a random lifetime or duration of immunity which is drawn from a certain probability density function. Once the time of immunity is elapsed an individual makes an instantaneous transition to the susceptible state. By introducing a random duration of immunity a memory effect is introduced into the process which crucially determines the epidemic dynamics. In the second part, we investigate the influence of the memory effect on the space-time dynamics of the epidemic spreading by implementing this approach into computer simulations and employ a multiple random walker's model. If a susceptible walker meets an infectious one on the same site, then the susceptible one gets infected with a certain probability. The computer experiments allow us to identify relevant parameters for spread or extinction of an epidemic. In both parts, the finite duration of immunity causes persistent oscillations in the number of infected individuals with ongoing epidemic activity preventing the system from relaxation to a steady state solution. Such oscillatory behavior is supported by real-life observations and not captured by the classical standard SIR model.

In this paper, we analyze a massive dataset with registers of the movement of vehicles in the bus rapid transit system Metrobús in Mexico City from February 2020 to April 2021. With these records and a division of the system into 214 geographical regions (segments), we characterize the vehicles' activity through the statistical analysis of speeds in each zone. We use the Kullback-Leibler distance to compare the movement of vehicles in each segment and its evolution. The results for the dynamics in different zones are represented as a network where nodes define segments of the system Metrobús and edges describe similarity in the activity of vehicles. Community detection algorithms in this network allow the identification of patterns considering different levels of similarity in the distribution of speeds providing a framework for unsupervised classification of the movement of vehicles. The methods developed in this research are general and can be implemented to describe the activity of different transportation systems with detailed records of the movement of users or vehicles., (© 2022. The Author(s).)

We present a data-driven approach to unveil the pharmaceutical technologies of cyclodextrins (CDs) by analyzing a dataset of CD pharmaceutical patents. First, we implemented network science techniques to represent CD patents as a single structure and provide a framework for unsupervised detection of keywords in the patent dataset. Guided by those keywords, we further mined the dataset to examine the patenting trends according to CD-based dosage forms. CD patents formed complex networks, evidencing the supremacy of CDs for solubility enhancement and how this has triggered cutting-edge applications based on or beyond the solubility improvement. The networks exposed the significance of CDs to formulate aqueous solutions, tablets, and powders. Additionally, they highlighted the role of CDs in formulations of anti-inflammatory drugs, cancer therapies, and antiviral strategies. Text-mining showed that the trends in CDs for aqueous solutions, tablets, and powders are going upward. Gels seem to be promising, while patches and fibers are emerging. Cyclodextrins' potential in suspensions and emulsions is yet to be recognized and can become an opportunity area. This is the first unsupervised/supervised data-mining approach aimed at depicting a landscape of CDs to identify trending and emerging technologies and uncover opportunity areas in CD pharmaceutical research.

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 occupation probability and for the mean and global first passage times. This general approach allows us to characterize the effect of resetting on the capacity of random walk strategies to reach a particular target or to explore the network. Our formalism holds for ergodic random walks and can be implemented from the spectral properties of the random walk without resetting, providing a tool to analyze the efficiency of search strategies with resetting to multiple nodes. We apply the methods developed here to the dynamics with two reset nodes and derive analytical results for normal random walks and Lévy flights on rings. We also explore the effect of resetting to multiple nodes on a comb graph, Lévy flights that visit specific locations in a continuous space, and the Google random walk strategy on regular networks.

We introduce a general approach for the study of the collective dynamics of noninteracting random walkers on connected networks. We analyze the movement of R independent (Markovian) walkers, each defined by its own transition matrix. By using the eigenvalues and eigenvectors of the R independent transition matrices, we deduce analytical expressions for the collective stationary distribution and the average number of steps needed by the random walkers to start in a particular configuration and reach specific nodes the first time (mean first-passage times), as well as global times that characterize the global activity. We apply these results to the study of mean first-encounter times for local and nonlocal random walk strategies on different types of networks, with both synchronous and asynchronous motion.

We herein disclose how global cyclodextrin-based pharmaceutical technologies have evolved since the early 80s through a 1998 patents dataset retrieved from Derwent Innovation Index. We used text-mining techniques based on the patents semantic content to extract the knowledge contained therein, to analyze technologies related to the principal attributes of CDs: solubility, stability, and taste-masking enhancement. The majority of CDs pharmaceutical technologies are directed toward parenteral aqueous solutions. The development of oral and ocular formulations is rapidly growing, while technologies for nasal and pulmonary routes are emerging and seem to be promising. Formulations for topical, transdermal, vaginal, and rectal routes do not account for a high number of patents, but they may be hiding a great potential, representing opportunity research areas. Certainly, the progress in materials sciences, supramolecular chemistry, and nanotechnology, will influence the trend of that, apparently neglected, research. The bottom line, CDs pharmaceutical technologies are still increasing, and this trend is expected to continue in the coming years. Patent monitoring allows the identification of relevant technologies and trends to prioritize research, development, and investment in both, academia and industry. We expect the scope of this approach to be applied in the pharmaceutical field beyond CDs technological applications., Competing Interests: The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper., (© 2020 Elsevier B.V. All rights reserved.)

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 the nodes of a finite ergodic graph in a discrete-time Markovian walk governed by his specific transition matrix. With this assumption, we first derive an upper bound for the reproduction numbers. Then, we assume that a walker is in one of the states: susceptible, infectious, or recovered. An infectious walker remains infectious during a certain characteristic time. If an infectious walker meets a susceptible one on the same node, there is a certain probability for the susceptible walker to get infected. By implementing this hypothesis in computer simulations, we study the space-time evolution of the emerging infection patterns. Generally, random walk approaches seem to have a large potential to study epidemic spreading and to identify the pertinent parameters in epidemic dynamics., Competing Interests: Conflicts of interestThe authors declare that they have no conflict of interest., (© The Author(s), under exclusive licence to Springer-Verlag GmbH, DE part of Springer Nature 2021.)

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 strategies by defining the dynamics as a discrete-time Markovian process with transition probabilities between nodes expressed in terms of powers of the Laplacian matrix. We analyze the elements of the transition matrices and their respective eigenvalues and eigenvectors, the mean first passage times and global times to characterize the random walk strategies. We apply this approach to the study of particular local and nonlocal ergodic random walks on different directed networks; we explore circulant networks, the biased transport on rings and the dynamics on random networks. We study the efficiency of a fractional random walker with bias on these structures. Effects of ergodicity loss which occur when a directed network is not any more strongly connected are also discussed.

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 first passage times, which allow us to characterize the effect of resetting on the capacity of a random walker to reach a particular target or to explore a finite network. We apply the results to rings, Cayley trees, and random and complex networks. Our formalism holds for undirected networks and can be implemented from the spectral properties of the random walk without resetting, providing a tool to analyze the search efficiency in different structures with the small-world property or communities. In this way, we extend the study of resetting processes to the domain of networks.

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-destination matrix that has information of a vast number of trips. The mobility and flow of taxis can be described as a directed weighted network that connects different zones of high demand for taxis. This network has in and out degrees that follow a stretched exponential and a power law with an exponential cutoff distributions, respectively. Using the origin-destination matrix, we obtain a rank, called "OD rank", analogous to the page rank of Google, that gives the more relevant places in New York City in terms of taxi trips. We introduced a model that captures the local and global dynamics that agrees with the data. Considering the taxi trips as a proxy of human mobility in cities, it might be possible that the long-range mobility found for New York City would be a general feature in other large cities around the world.

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 configuration of the network, we analyze a Markovian random walker that hops over weighted links that quantify the capacity of transport of each connection. The weights of the links in the network evolve due to randomly occurring damage effects that reduce gradually the transport capacity of the structure. We introduce a global measure to determine the functionality of each configuration and how the system ages due to the accumulation of damage that cannot be repaired completely. Then, by assuming a minimum value of the functionality required for the system to be "alive," we explore the statistics of the lifetimes for several realizations of this process in different types of networks. Finally, we analyze the characteristic longevity of such a system and its relation with the "complexity" of the network structure. One finding is that systems with greater complexity live longer. Our approach introduces a model of aging processes relating the reduction of functionality with the accumulation of "misrepairs" and the lifetime of a complex system.

The understanding of human mobility patterns in different transportation modes is an interdisciplinary research field with a direct impact in aspects as varied as urban planning, traffic optimization, sustainability, the reduction of operating costs as well as the mitigation of pollution in urban areas. In this paper, we study the global activity of users in bike-sharing systems operating in the cities of Chicago and New York. For this transportation mode, we explore the temporal and spatial characteristics of the mobility of cyclists. In particular, through the analysis of origin-destination matrices, we characterize the spatial structure of the displacements of users. We apply a mobility model for the global activity of the system that classifies the displacements between stations in local and non-local transitions. In local transitions, cyclists move in a region around each station whereas, in the non-local case, bike users travel with long-range displacements in a similar way to Lévy flights. We reproduce the spatial dynamics by using Monte Carlo simulations. The obtained results are similar to the observed in real data and reveal that the model implemented captures important characteristics of the global spatial dynamics in the systems analyzed., Competing Interests: The authors have declared that no competing interests exist.

There is a burst of work on human mobility and encounter networks. However, the connection between these two important fields just begun recently. It is clear that both are closely related: Mobility generates encounters, and these encounters might give rise to contagion phenomena or even friendship. We model a set of random walkers that visit locations in space following a strategy akin to Lévy flights. We measure the encounters in space and time and establish a link between walkers after they coincide several times. This generates a temporal network that is characterized by global quantities. We compare this dynamics with real data for two cities: New York City and Tokyo. We use data from the location-based social network Foursquare and obtain the emergent temporal encounter network, for these two cities, that we compare with our model. We found long-range (Lévy-like) distributions for traveled distances and time intervals that characterize the emergent social network due to human mobility. Studying this connection is important for several fields like epidemics, social influence, voting, contagion models, behavioral adoption and diffusion of ideas.

In this work, we explore the spatial structure of built zones and green areas in diverse western cities by analyzing the probability distribution of areas and a coefficient that characterize their respective shapes. From the analysis of diverse datasets describing land lots in urban areas, we found that the distribution of built-up areas and natural zones in cities obey inverse power laws with a similar scaling for the cities explored. On the other hand, by studying the distribution of shapes of lots in urban regions, we are able to detect global differences in the spatial structure of the distribution of land. Our findings introduce information about spatial patterns that emerge in the structure of urban settlements; this knowledge is useful for the understanding of urban growth, to improve existing models of cities, in the context of sustainability, in studies about human mobility in urban areas, among other applications.

In this paper we study the quantum transport on networks with a temporal evolution governed by the fractional Schrödinger equation. We generalize the dynamics based on continuous-time quantum walks, with transitions to nearest neighbors on the network, to the fractional case that allows long-range displacements. By using the fractional Laplacian matrix of a network, we establish a formalism that combines a long-range dynamics with the quantum superposition of states; this general approach applies to any type of connected undirected networks, including regular, random, and complex networks, and can be implemented from the spectral properties of the Laplacian matrix. We study the fractional dynamics and its capacity to explore the network by means of the transition probability, the average probability of return, and global quantities that characterize the efficiency of this quantum process. As a particular case, we explore analytically these quantities for circulant networks such as rings, interacting cycles, and complete graphs.

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 Laplacian matrix. This fractional approach allows random walks with long-range dynamics providing a general framework for anomalous diffusion and navigation, and inducing dynamically the small-world property on any network. We obtained exact results for the stationary probability distribution, the average fractional return probability, and a global time, showing that the efficiency to navigate the network is greater if we use a fractional random walk in comparison to a normal random walk. For the case of a ring, we obtain exact analytical results showing that the fractional transition and return probabilities follow a long-range power-law decay, leading to the emergence of Lévy flights on networks. Our general fractional diffusion formalism applies to regular, random, and complex networks and can be implemented from the spectral properties of the Laplacian matrix, providing an important tool to analyze anomalous diffusion on networks.

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 navigation rules. We obtained exact expressions for the stationary probability distribution, the occupation probability, the mean first passage time, and the average time to reach a node on the network. We found that the long-range navigation using the Lévy random walk strategy, compared with the normal random walk strategy, is more efficient at reducing the time to cover the network. The dynamical effect of using the Lévy walk strategy is to transform a large-world network into a small world. Our exact results provide a general framework that connects two important fields: Lévy navigation strategies and dynamics on complex networks.