相关论文: Random walk attracted by percolation clusters

We investigate the diffusion limited aggregation of particles executing persistent random walks. The scaling properties of both random walks and large aggregates are presented. The aggregates exhibit a crossover between ballistic and…

Random walk is an explainable approach for modeling natural processes at the molecular level. The Random Permutation Set Theory (RPST) serves as a framework for uncertainty reasoning, extending the applicability of Dempster-Shafer Theory.…

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [Tadi\'c, Physica A {\bf 293},…

We study the second order of the number of excursions of a simple random walk with a bias that drives a return toward the origin along the axes introduced by P. Andreoletti and P. Debs \cite{AndDeb3}. This is a crucial step toward deriving…

Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…

We consider random walks perturbed at zero which behave like (possibly different) random walks with i.i.d. increments on each half lines and restarts at $0$ whenever they cross that point. We show that the perturbed random walk, after being…

Stretched exponential relaxation ($\exp{-(t/\tau)}^{\beta_K}$) is observed in a large variety of systems but has not been explained so far. Studying random walks on percolation clusters in curved spaces whose dimensions range from 2 to 7,…

We have numerically studied the trapping problem in a two-dimensional lattice where particles are continuously generated. We have introduced interaction between particles and directionality of their movement. This model presents a critical…

In this paper we explore the features of a graph generated by random walkers with nodes that have evolutionary attractiveness and Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on…

We consider the distribution of the duration time, the time elapsed since it began, of a diffusion process given its present position, under the assumption that the process began at the origin. For unbiased diffusion, the distribution does…

We study a generalization of the standard trapping problem of random walk theory in which particles move subdiffusively on a one-dimensional lattice. We consider the cases in which the lattice is filled with a one-sided and a two-sided…

We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…

The following random process on $\Z^4$ is studied. At first visit to a site, the two first coordinates perform a (2-dimensional) simple random walk step. At further visits, it is the last two coordinates which perform a simple random walk…

Movements of molecular motors on cytoskeletal filaments are described by directed walks on a line. Detachment from this line is allowed to occur with a small probability. Motion in the surrounding fluid is described by symmetric random…

The involution walk is the random walk on $S_n$ generated by involutions with a binomially distributed with parameter $1-p$ number of $2$-cycles. This is a parallelization of the transposition walk. The involution walk is shown in this…

The eigenvalue spectra of the transition probability matrix for random walks traversing critically disordered clusters in three different types of percolation problems show that the random walker sees a developing Euclidean signature for…

The study of random walks has increasingly been popular across diverse disciplines such as statistics, mathematics, quantum physics, where they are used to model paths consisting of successive random steps in a mathematical space. A…

Motivated by novel results in the theory of correlated sequences, we analyze the dynamics of random walks with long-term memory (binary chains with long-range correlations). In our model, the probability for a unit bit in a binary string…

In this paper we prove that, under the assumption of quasi-transitivity, if a branching random walk on ${{\mathbb{Z}}^d}$ survives locally (at arbitrarily large times there are individuals alive at the origin), then so does the same process…

The Random Walk Pinning Model (RWPM) is a statistical mechanics model in which the trajectory of a continuous time random walk $X=(X_t)_{t\geq 0}$ is rewarded according to the time it spends together with a moving catalyst. More…