اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDistinct nodes visited by random walkers on scale-free networks
220
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and cover time are known. However, many recent applications such as search engines and recommender systems involve multiple random walkers on complex networks. In this work, based on numerical simulations, we show that the fraction of nodes of scale-free network not visited by $W$ random walkers in time $t$ has a stretched exponential form independent of the details of the network and number of walkers. This leads to a power-law relation between nodes not visited by $W$ walkers and by one walker within time $t$. The problem of finding the distinct nodes visited by $W$ walkers, effectively, can be reduced to that of a single walker. The robustness of the results is demonstrated by verifying them on four different real-world networks that approximately display scale-free structure.
قيم البحث
اقرأ أيضاً
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting nodes. Us
ing a renewal approach, we derive exact expressions of the occupation probability of the walker in each node and mean-field first-passage time between arbitrary two nodes. All the results are relevant to the spectral properties of the transition matrix in the absence of resetting. We demonstrate our results on circular networks, stochastic block models, and Barabasi-Albert scale-free networks, and find the advantage of the resetting processes to multiple resetting nodes in global searching on such networks.
We consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record time $t$ whe
n the walker visits a site of the subset for the first time. The record time $t$ is a partial covering time when $v<n$ and a total covering time when $v=n$. The probability distributions for the number of records $s$, the record value $v$ and the record (covering) time $t$, involving $r$-Stirling numbers, are obtained using generating function techniques. The mean values, variances and skewnesses are deduced from the generating functions. In the scaling limit the probability distributions for $s$ and $v$ lead to the same Gaussian density. The fluctuations of the record time $t$ are also Gaussian at partial covering, when $n-v={mathrm O}(n)$. They are distributed according to the type-I Gumbel extreme-value distribution at total covering, when $v=n$. A discrete sequence of generalized Gumbel distributions, indexed by $n-v$, is obtained at almost total covering, when $n-v={mathrm O}(1)$. These generalized Gumbel distributions are crossing over to the Gaussian distribution when $n-v$ increases.
The probability distribution of the number $s$ of distinct sites visited up to time $t$ by a random walk on the fully-connected lattice with $N$ sites is first obtained by solving the eigenvalue problem associated with the discrete master equation. T
hen, using generating function techniques, we compute the joint probability distribution of $s$ and $r$, where $r$ is the number of sites visited only once up to time $t$. Mean values, variances and covariance are deduced from the generating functions and their finite-size-scaling behaviour is studied. Introducing properly centered and scaled variables $u$ and $v$ for $r$ and $s$ and working in the scaling limit ($ttoinfty$, $Ntoinfty$ with $w=t/N$ fixed) the joint probability density of $u$ and $v$ is shown to be a bivariate Gaussian density. It follows that the fluctuations of $r$ and $s$ around their mean values in a finite-size system are Gaussian in the scaling limit. The same type of finite-size scaling is expected to hold on periodic lattices above the critical dimension $d_{rm c}=2$.
Methods connecting dynamical systems and graph theory have attracted increasing interest in the past few years, with applications ranging from a detailed comparison of different kinds of dynamics to the characterisation of empirical data. Here we inv
estigate the effects of the (multi)fractal properties of a time signal, common in sequences arising from chaotic or strange attractors, on the topology of a suitably projected network. Relying on the box counting formalism, we map boxes into the nodes of a network and establish analytic expressions connecting the natural measure of a box with its degree in the graph representation. We single out the conditions yielding to the emergence of a scale-free topology, and validate our findings with extensive numerical simulations.
Motivated by the psychological literature on the peak-end rule for remembered experience, we perform an analysis within a random walk framework of a discrete choice model where agents future choices depend on the peak memory of their past experiences
. In particular, we use this approach to investigate whether increased noise/disruption always leads to more switching between decisions. Here extreme value theory illuminates different classes of dynamics indicating that the long-time behaviour is dependent on the scale used for reflection; this could have implications, for example, in questionnaire design.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
