相关论文: Crossover behaviors in branching annihilating attr…

We study biased random walk on subcritical and supercritical Galton-Watson trees conditioned to survive in the transient, sub-ballistic regime. By considering offspring laws with infinite variance, we extend previously known results for the…

If the three dimensional self-avoiding walk (SAW) is conformally invariant, then one can compute the hitting densities for the SAW in a half-space and in a sphere. The ensembles of SAW's used to define these hitting densities involve walks…

In this paper, we investigate a model for a $1+1$ dimensional self-interacting and partially directed self-avoiding walk, usually referred to by the acronym IPDSAW. The interaction intensity and the free energy of the system are denoted by…

We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

This paper investigates the long-time behavior of double branching annihilating random walkers with nearest-neighbor dependent rates. The system consists of even number of particles which can execute nearest-neighbor random walk and they…

We study an annealed model of Uniform Infinite Planar Quadrangulation (UIPQ) with an infinite two-sided self-avoiding walk (SAW), which can also be described as the result of glueing together two independent uniform infinite…

Mott variable range hopping is a fundamental mechanism for low-temperature electron conduction in disordered solids in the regime of Anderson localization. In a mean field approximation, it reduces to a random walk (shortly, Mott random…

We present some exact results for branching and annihilating random walks. We compute the nonuniversal threshold value of the annihilation rate for having a phase transition in the simplest reaction-diffusion system belonging to the…

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

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 consider a one-dimensional random walk among biased i.i.d. conductances, in the case where the random walk is transient but sub-ballistic: this occurs when the conductances have a heavy-tail at $+\infty$ or at $0$. We prove that the…

For a continuous-time catalytic branching random walk (CBRW) on Z, with an arbitrary finite number of catalysts, we study the asymptotic behavior of position of the rightmost particle when time tends to infinity. The mild requirements…

Dynamical systems having many coexisting attractors present interesting properties from both fundamental theoretical and modelling points of view. When such dynamics is under bounded random perturbations, the basins of attraction are no…

We study a generalized interacting self-avoiding walk (ISAW) model with nearest- and next nearest-neighbor (NN and NNN) interactions on the square and cubic lattices. In both dimensions, the phase diagrams show coil and globule phases…

In order to study long chain polymers many lattice models accommodate a pulling force applied to a particular part of the chain, often a free endpoint. This is in addition to well-studied features such as energetic interaction between the…

Although the title seems self-contradictory, it does not contain a misprint. The model we study is a seemingly minor modification of the "true self-avoiding walk" (TSAW) model of Amit, Parisi, and Peliti in two dimensions. The walks in it…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

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…

Random walk (RW)-based algorithms have long been popular in distributed systems due to low overheads and scalability, with recent growing applications in decentralized learning. However, their reliance on local interactions makes them…