Related papers: Superdiffusion on complex networks: the role of sh…
Interactions in time-varying complex systems are often very heterogeneous at the topological level (who interacts with whom) and at the temporal level (when interactions occur and how often). While it is known that temporal heterogeneities…
We propose an approximation for the first return time distribution of random walks on undirected networks. We combine a message-passing solution with a mean-field approximation, to account for the short- and long-term behaviours…
The dynamical discrete web is a system of one-dimensional coalescing random walks that evolves in an extra dynamical time parameter. At any deterministic dynamical time, the paths behave as coalescing simple symmetric random walks. This…
Interactions among units in complex systems occur in a specific sequential order thus affecting the flow of information, the propagation of diseases, and general dynamical processes. We investigate the Laplacian spectrum of temporal…
In this paper a lattice model for diffusional transport of particles in the interphase cell nucleus is proposed. Dense networks of chromatin fibers are created by three different methods: randomly distributed, non-interconnected obstacles,…
We introduce a model of interacting Random Walk, whose hopping amplitude depends on the number of walkers/particles on the link. The mesoscopic counterpart of such a microscopic dynamics is a diffusing system whose diffusivity depends on…
In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Loops are subgraphs responsible for the multiplicity of paths going from one to another generic node in a given network. In this paper we present an analytic approach for the evaluation of the average number of loops in random scale-free…
Most real-world networks are endowed with the small-world property, by means of which the maximal distance between any two of their nodes scales logarithmically rather than linearly with their size. The evidence sparkled a wealth of studies…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
In temporal networks, both the topology of the underlying network and the timings of interaction events can be crucial in determining how some dynamic process mediated by the network unfolds. We have explored the limiting case of the speed…
Networks are commonly used to define underlying interaction structures where infections, information, or other quantities may spread. Although the standard approach has been to aggregate all links into a static structure, some studies…
Network growth models that embody principles such as preferential attachment and local attachment rules have received much attention over the last decade. Among various approaches, random walks have been leveraged to capture such…
Many of the biological, social and man-made networks around us are inherently dynamic, with their links switching on and off over time. The evolution of these networks is often non-Markovian, and the dynamics of their links correlated.…
We study the properties of random walks on complex trees. We observe that the absence of loops reflects in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
Long-distance characteristics of small-world networks have been studied by means of self-avoiding walks (SAW's). We consider networks generated by rewiring links in one- and two-dimensional regular lattices. The number of SAW's $u_n$ was…
We study, on a $d$ dimensional hypercubic lattice, a random walk which is homogeneous except for one site. Instead of visiting this site, the walker hops over it with arbitrary rates. The probability distribution of this walk and the…
Diffusion in a multidimensional energy surface with minima and barriers is a problem of importance in statistical mechanics and also has wide applications, such as protein folding. To understand it in such a system, we carry out theory and…