相关论文: Close or connected? Distance and connectivity effe…
Understanding the topological characteristics of complex networks and how they affect navigability is one of the most important goals in science today, as it plays a central role in various economic, biological, ecological and social…
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…
A lot of previous work showed that the sectional mean first-passage time (SMFPT), i.e., the average of mean first-passage time (MFPT) for random walks to a given hub node (node with maximum degree) averaged over all starting points in…
Random walks have been proposed as a simple method of efficiently searching, or disseminating information throughout, communication and sensor networks. In nature, animals (such as ants) tend to follow correlated random walks, i.e., random…
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…
Random walks process on networks plays a fundamental role in understanding the importance of nodes and the similarity of them, which has been widely applied in PageRank, information retrieval, and community detection, etc. Individual's…
We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds ($F$) and…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
A vast variety of real-life networks display the ubiquitous presence of scale-free phenomenon and small-world effect, both of which play a significant role in the dynamical processes running on networks. Although various dynamical processes…
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…
Random walks have wide application in real lives, ranging from target search, reaction kinetics, polymer chains, to the forecast of the arrive time of extreme events, diseases or opinions. In this paper, we consider discrete random walks on…
The first-passage time (FPT) is the time it takes a system variable to cross a given boundary for the first time. In the context of Markov networks, the FPT is the time a random walker takes to reach a particular node (target) by hopping…
The presence of temporal correlations in random movement trajectories is a widespread phenomenon across biological, chemical and physical systems. The ubiquity of persistent and anti-persistent motion in many natural and synthetic systems…
We study the statistics of the first passage of a random walker to absorbing subsets of the boundary of compact domains in different spatial dimensions. We describe a novel diagnostic method to quantify the trajectory-to-trajectory…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
Transport in complex networks can describe a variety of natural and human-engineered processes including biological, societal and technological ones. However, how the properties of the source and drain nodes can affect transport subject to…
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…
Self-interacting random walks are endowed with long range memory effects that emerge from the interaction of the random walker at time $t$ with the territory that it has visited at earlier times $t'<t$. This class of non Markovian random…
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…