Related papers: Mean trapping time for an arbitrary node on regula…
This is a pedagogical review of the subject of linear polymers on deterministic finitely ramified fractals. For these, one can determine the critical properties exactly by real-space renormalization group technique. We show how this is used…
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical…
When a large number N of independent diffusing particles are placed upon a site of a d-dimensional Euclidean lattice randomly occupied by a concentration c of traps, what is the m-th moment <t^m_{j,N}> of the time t_{j,N} elapsed until the…
We study random walks on the giant component of Hyperbolic Random Graphs (HRGs), in the regime when the degree distribution obeys a power law with exponent in the range $(2,3)$. In particular, we first focus on the expected time for a…
We analyze the diffusion of charged and neutral tracers suspended in an electrolyte embedded in a channel of varying cross-section. Making use of systematic approximations, the diffusion equation governing the motion of tracers is mapped…
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…
State-of-the-art ray tracing techniques operate on hierarchical acceleration structures such as BVH trees which wrap objects in a scene into bounding volumes of decreasing sizes. Acceleration structures reduce the amount of ray-scene…
In entangled polymer systems, there are several characteristic time scales, such as the entanglement time and the disengagement time. In molecular simulations, the longest relaxation time (the disengagement time) can be determined by the…
We show that residence time measure can be used to identify the geometrical and transmission properties of a defect along a path. The model we study is based on a one--dimensional simple random walk. The sites of the lattice are regular,…
We study diffusion with a bias towards a target node in networks. This problem is relevant to efficient routing strategies in emerging communication networks like optical networks. Bias is represented by a probability $p$ of the…
First passage time (FPT) theory is often used to estimate timescales in cellular and molecular biology. While the overwhelming majority of studies have focused on the time it takes a given single Brownian searcher to reach a target,…
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…
A survey of a variety of computational procedures for finding the mean first passage times in Markov chains is presented. The author recently developed a new accurate computational technique, an Extended GTH Procedure, Hunter (Special…
Above two dimensions, diffusion of a particle in a medium with quenched random traps is believed to be well-described by the annealed continuous time random walk (CTRW). We propose an approximate expression for the first-passage-time (FPT)…
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…
We demonstrate that the source to target mean first passage time (MFPT) is approximately given by the potential difference of an electrostatic problem which shows that the MFPT scales like the resistance between the target and a distant…
Thermally activated escape of an over-damped particle from a metastable well under the action of a time-ramped force is studied. We express the mean first passage time (MFPT) as the solution to a partial differential equation, which we…
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…
In this paper, we propose a class of growth models, named Fibonacci trees $F(t)$, with respect to the intrinsic advantage of Fibonacci sequence $\{F_{t}\}$. First, we turn out model $F(t)$ to have power-law degree distribution with exponent…
In this paper we develop an encounter-based model of a run-and-tumble particle (RTP) confined to a finite interval $[0,L]$ with partially absorbing, sticky boundaries at both ends. We assume that the particle switches between two constant…