منابع مشابه
A scaling law for random walks on networks
The dynamics of many natural and artificial systems are well described as random walks on a network: the stochastic behaviour of molecules, traffic patterns on the internet, fluctuations in stock prices and so on. The vast literature on random walks provides many tools for computing properties such as steady-state probabilities or expected hitting times. Previously, however, there has been no g...
متن کاملScaling properties of random walks on small-world networks.
Using both numerical simulations and scaling arguments, we study the behavior of a random walker on a one-dimensional small-world network. For the properties we study, we find that the random walk obeys a characteristic scaling form. These properties include the average number of distinct sites visited by the random walker, the mean-square displacement of the walker, and the distribution of fir...
متن کاملPower-law random walks.
In this paper, random walks with independent steps distributed according to a Q-power-law probability distribution function with Q=1/(1-q) are studied. In the case q>1, we show that (i) a stochastic representation of the location of the walk after n steps can be explicitly given (for both finite and infinite variance) and (ii) a clear connection with the superstatistics framework can be establi...
متن کاملRandom walks on temporal networks.
Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various time scales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis of the temporal patterns characterizing dynamic networks are still recent, so that many questions remain open. Here, we study how random walks, as a paradigm...
متن کاملRandom Walks on Multiplex Networks
Multiplex networks are receiving increasing interests because they allow to model relationships between networked agents on several layers simultaneously. In this letter, we extend well-known random walks to multiplexes and we introduce a new type of walk that can exist only in multiplexes. We derive exact expressions for vertex occupation time and the coverage. Finally, we show how the efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Communications
سال: 2014
ISSN: 2041-1723
DOI: 10.1038/ncomms6121