相关论文: Survival and residence times in disordered chains …

Many natural and artificial networks evolve in time. Nodes and connections appear and disappear at various timescales, and their dynamics has profound consequences for any processes in which they are involved. The first empirical analysis…

Virtually all the emergent properties of a complex system are rooted in the non-homogeneous nature of the behaviours of its elements and of the interactions among them. However, the fact that heterogeneity and correlations can appear…

We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph…

We consider a Random Walk in Random Environment (RWRE) moving in an i.i.d.\ random field of obstacles. When the particle hits an obstacle, it disappears with a positive probability. We obtain quenched and annealed bounds on the tails of the…

We present a detailed study on the mean first-passage time of volatility processes. We analyze the theoretical expressions based on the most common stochastic volatility models along with empirical results extracted from daily data of major…

We consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…

In this paper, we derive explicit formulas for the surface averaged first exit time of a discrete random walk on a finite lattice. We consider a wide class of random walks and lattices, including random walks in a non-trivial potential…

In this paper we continue our study of exit times for random walks with independent but not necessarily identical distributed increments. Our paper "First-passage times for random walks with non-identically distributed increments" was…

In recent years, it has been well-established that adding a restart mechanism can alter the firstpassage statistics of a stochastic processes in useful and interesting ways. Though different mecha-nisms have been investigated, we derive a…

We consider discrete-time nearest-neighbor quantum walks on random environments in one dimension. Using the method based on a path counting, we present both quenched and annealed weak limit theorems for the quantum walk.

The model of directed polymer in a random environment is a fundamental model of interaction between a simple random walk and ambient disorder. This interaction gives rise to complex phenomena and transitions from a central limit theory to…

Subdiffusive motion of tracer particles in complex crowded environments, such as biological cells, has been shown to be widepsread. This deviation from brownian motion is usually characterized by a sublinear time dependence of the mean…

We study the appearance of first-order dynamical phase transitions (DPTs) as `intermittent' co-existing phases in the fluctuations of random walks on graphs. We show that the diverging time scale leading to critical behaviour is the waiting…

We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…

Random walks are powerful tools to analyze spatial-temporal patterns produced by living organisms ranging from cells to humans. At the same time, it is evident that these patterns are not completely random but are results of a convolution…

We consider a mortal random walker on a family of hierarchical graphs in the presence of some trap sites. The configuration comprising the graph, the starting point of the walk, and the locations of the trap sites is taken to be exactly…

We study the effect of a large obstacle on the so called residence time, i.e., the time that a particle performing a symmetric random walk in a rectangular (2D) domain needs to cross the strip. We observe a complex behavior, that is we find…

In this paper we consider the one-dimensional, biased, randomly trapped random walk when the trapping times have infinite variance. We prove sufficient conditions for the suitably scaled walk to converge to a transformation of a stable…

Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…

We present a coarse-grained model for stochastic transport of noninteracting chemical signals inside neuronal dendrites and show how first-passage properties depend on the key structural factors affected by neurodegenerative disorders or…