Related papers: Effective target arrangement in a deterministic sc…
In this paper, we consider discrete time random walks on the pseudofractal scale-free web (PSFW) and we study analytically the related first passage properties. First, we classify the nodes of the PSFW into different levels and propose a…
We study a random walk in random environment on the non-negative integers. The random environment is not homogeneous in law, but is a mixture of two kinds of site, one in asymptotically vanishing proportion. The two kinds of site are (i)…
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…
Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…
We investigate the effects of markovian resseting events on continuous time random walks where the waiting times and the jump lengths are random variables distributed according to power law probability density functions. We prove the…
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…
A heterogeneous continuous time random walk is an analytical formalism for studying and modeling diffusion processes in heterogeneous structures on microscopic and macroscopic scales. In this paper we study both analytically and numerically…
First passage of stochastic processes under resetting has recently been an active research topic in the field of statistical physics. However, most of previous studies mainly focused on the systems with continuous time and space. In this…
We derive an approximate formula for the mean first-passage time (MFPT) to a small absorbing target of arbitrary shape inside an elongated domain of a slowly varying axisymmetric profile. For this purpose, the original Poisson equation in…
In many complex systems, for the activity f(i) of the constituents or nodes i, a power-law relationship was discovered between the standard deviation sigma(i) and the average strength of the activity: sigma(i) ~ <f(i)>^alpha; universal…
In this paper we study some aspects of search for an immobile target by a swarm of N non-communicating, randomly moving searchers (numbered by the index k, k = 1, 2,..., N), which all start their random motion simultaneously at the same…
We study first-passage statistics for one-dimensional random walks $S_n$ with independent and identically distributed jumps starting from the origin. We focus on the joint distribution of the first-passage time $\tau_b$ and first-passage…
This paper presents a new simulation-based approach to address the stochastic Dynamic Traffic Assignment (DTA) problem, focusing on large congested networks and dynamic settings. The proposed methodology incorporates a random walk model…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
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 present a novel computational method of first-passage times between a starting site and a target site of regular bounded lattices. We derive accurate expressions for all the moments of this first-passage time, validated by numerical…
The determination of the mean first passage time (MFPT) for a Brownian particle in a bounded 2-D domain containing small absorbing traps is a fundamental problem with biophysical applications. The average MFPT is the expected capture time…
We study the first hitting time statistics between a one-dimensional run-and-tumble particle and a target site that switches intermittently between visible and invisible phases. The two-state dynamics of the target is independent of the…
Quantifying how spatial disorder affects the movement of a diffusing particle or agent is fundamental to target search studies. When diffusion occurs on a network, that is on a highly disordered environment, we lack the mathematical tools…
We study the effect of a resetting point randomly distributed around the origin on the mean first passage time of a Brownian searcher moving in one dimension. We compare the search efficiency with that corresponding to reset to the origin…