相关论文: Osculating Random Walks on Cylinders

We introduce a new class of models for polymer collapse, given by random walks on regular lattices which are weighted according to multiple site visits. A Boltzmann weight $\omega_l$ is assigned to each $(l+1)$-fold visited lattice site,…

We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…

We consider an exactly solvable model of branching random walk with random selection, which describes the evolution of a population with $N$ individuals on the real line. At each time step, every individual reproduces independently, and its…

In a \emph{rotor walk} the exits from each vertex follow a prescribed periodic sequence. On an infinite Eulerian graph embedded periodically in $\R^d$, we show that any simple rotor walk, regardless of rotor mechanism or initial rotor…

This article studies vertex reinforced random walks that are non-backtracking (denoted VRNBW), i.e. U-turns forbidden. With this last property and for a strong reinforcement, the emergence of a path may occur with positive probability.…

There is a close connection between intersections of Brownian motion paths and percolation on trees. Recently, ideas from probability on trees were an important component of the multifractal analysis of Brownian occupation measure, in joint…

We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…

We study periodic Brownian paths, wrapped around the surface of a cylinder. One characteristic of such a path is its width square, $w^2$, defined as its variance. Though the average of $w^2$ over all possible paths is well known, its full…

We consider a branching random walk on the lattice, where the branching rates are given by an i.i.d. Pareto random potential. We describe the process, including a detailed shape theorem, in terms of a system of growing lilypads. As an…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

We give sharp, uniform estimates for the probability that a random walk of n steps on the reals avoids a half-line [y,infinity) given that it ends at the point x. The estimates hold for general continuous or lattice distributions provided…

Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…

Consider a nearest neighbor random walk on the two-dimensional integer lattice, where each vertex is initially labeled either `H' or `V', uniformly and independently. At each discrete time step, the walker resamples the label at its current…

Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…

We consider a system of independent one-dimensional random walkers where new particles are added at the origin at fixed rate whenever there is no older particle present at the origin. A Poisson ansatz leads to a semi-linear lattice heat…

It is shown that the path of a simple random walk on any graph, consisting of all vertices visited and edges crossed by the walk, is almost surely a recurrent subgraph.

We have studied self-avoiding walks contained within an $L \times L$ square whose end-points can lie anywhere within, or on, the boundaries of the square. We prove that such walks behave, asymptotically, as walks crossing a square (WCAS),…

Planar run-and-tumble walks with orthogonal directions of motion are considered. After formulating the problem with generic transition probabilities among the orientational states, we focus on the symmetric case, giving general expressions…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

Nearest neighbor random walks in the quarter plane that are absorbed when reaching the boundary are studied. The cases of positive and zero drift are considered. Absorption probabilities at a given time and at a given site are made…