相关论文: Controlling the efficiency of trapping in treelike…
It is known that the heterogeneity of scale-free networks helps enhancing the efficiency of trapping processes performed on them. In this paper, we show that transport efficiency is much lower in a fractal scale-free network than in…
Relatively general techniques for computing mean first-passage time (MFPT) of random walks on networks with a specific property are very useful, since a universal method for calculating MFPT on general graphs is not available because of…
We study random walks on a family of treelike regular fractals with a trap fixed on a central node. We obtain all the eigenvalues and their corresponding multiplicities for the associated stochastic master equation, with the eigenvalues…
The explicit determinations of the mean first-passage time (MFPT) for trapping problem are limited to some simple structure, e.g., regular lattices and regular geometrical fractals, and determining MFPT for random walks on other media,…
The regular hyperbranched polymers (RHPs), also known as Vicsek fractals, are an important family of hyperbranched structures which have attracted a wide spread attention during the past several years. In this paper, we study the…
Designing optimal structure favorable to diffusion and effectively controlling the trapping process are crucial in the study of trapping problem---random walks with a single trap. In this paper, we study the trapping problem occurring on…
We develop novel numerical methods and perturbation approaches to determine the mean first passage time (MFPT) for a Brownian particle to be captured by either small stationary or mobile traps inside a bounded 2-D confining domain. Of…
It has been recently reported that the reciprocity of real-life weighted networks is very pronounced, however its impact on dynamical processes is poorly understood. In this paper, we study random walks in a scale-free directed weighted…
A wide variety of real-life networks share two remarkable generic topological properties: scale-free behavior and modular organization, and it is natural and important to study how these two features affect the dynamical processes taking…
The determination of mean first-passage time (MFPT) for random walks in networks is a theoretical challenge, and is a topic of considerable recent interest within the physics community. In this paper, according to the known connections…
The family of Vicsek fractals is one of the most important and frequently-studied regular fractal classes, and it is of considerable interest to understand the dynamical processes on this treelike fractal family. In this paper, we…
The mean first passage time~(MFPT) of random walks is a key quantity characterizing dynamic processes on disordered media. In a random fractal embedded in the Euclidean space, the MFPT is known to obey the power law scaling with the…
Random walks including non-nearest-neighbor jumps appear in many real situations such as the diffusion of adatoms and have found numerous applications including PageRank search algorithm, however, related theoretical results are much less…
Efficiently controlling the diffusion process is crucial in the study of diffusion problem in complex systems. In the sense of random walks with a single trap, mean trapping time(MTT) and mean diffusing time(MDT) are good measures of…
In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…
In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…
Explicit determination of the mean first-passage time (MFPT) for trapping problem on complex media is a theoretical challenge. In this paper, we study random walks on the Apollonian network with a trap fixed at a given hub node (i.e. node…
We study unbiased discrete random walks on the FSFT based on the its self-similar structure and the relations between random walks and electrical networks. First, we provide new methods to derive analytic solutions of the MFPT for any pair…
Tracking the movement of tracer particles has long been a strategy for uncovering complex structures. Here, we study discrete-time random walks on finite Cayley trees to infer key parameters such as tree depth and geometric bias toward the…
We study discrete random walks on the NFSFT and provide new methods to calculate the analytic solutions of the MFPT for any pair of nodes, the MTT for any target node and MDT for any source node. Further more, using the MTT and the MDT as…