Related papers: "True" self-avoiding walks on general trees

In this paper, we study the scaling limit of a class of random walks which behave like simple random walks outside of a bounded region around the origin and which are subject to a partial reflection near the origin. If the probability of…

We study the mean first passage time of a one-dimensional random walker with step sizes decaying exponentially in discrete time. That is step sizes go like $\lambda^{n}$ with $\lambda\leq1$ . We also present, for pedagogical purposes, a…

We study asymptotic behavior, for large time $n$, of the transition probability of a two-dimensional random walk killed when entering into a non-empty finite subset $A$. We show that it behaves like $4 \tilde u_A(x) \tilde u_{-A}(-y) (\lg…

We show a central limit theorem for random walk on a Galton-Watson tree, when the edges of the tree are assigned randomly uniformly elliptic conductances. When a positive fraction of edges is assigned a small conductance $\varepsilon$, we…

The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this context, we investigate…

We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root. We prove that in the setting of multiplicative…

We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener index, and related graph invariants. In the case of trees we obtain a simple identity relating hitting times to the Wiener index. It is…

We prove that if $(X_n)_{n\geq 0}$ is a random walk on a transient graph such that the Green's function decays at least polynomially along the random walk, then $(X_n)_{n\geq 0}$ has infinitely many cut times almost surely. This condition…

Let $\Gamma$ be a non-elementary relatively hyperbolic group with a finite generating set. Consider a finitely supported admissible and symmetric probability measure $\mu$ on $\Gamma$ and a probability measure $\nu$ on $\mathbb{N}$ with…

We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…

Let $W$ be an integer valued random variable satisfying $E[W] =: \delta \geq 0$ and $P(W<0)>0$, and consider a self-interacting random walk that behaves like a simple symmetric random walk with the exception that on the first visit to any…

An intrinsic branching structure within the transient random walk on a strip in a random environment is revealed. As applications, which enables us to express the hitting time explicitly, and specifies the density of the absolutely…

We study a one-dimensional lattice random walk with an absorbing boundary at the origin and a movable partial reflector. On encountering the reflector, at site x, the walker is reflected (with probability r) to x-1 and the reflector is…

We consider random walks with independent but not necessarily identical distributed increments. Assuming that the increments satisfy the well-known Lindeberg condition, we investigate the asymptotic behaviour of first-passage times over…

We study paths of time-length $t$ of a continuous-time random walk on $\mathbb Z^2$ subject to self-interaction that depends on the geometry of the walk range and a collection of random, uniformly positive and finite edge weights. The…

We prove some theorems about self-avoiding walks attached to an impenetrable surface (i.e. positive walks) and subject to a force. Specifically we show the force dependence of the free energy is identical when the force is applied at the…

A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…

Let $\{S_n, n\geq1\}$ be a random walk wih independent and identically distributed increments and let $\{g_n,n\geq1\}$ be a sequence of real numbers. Let $T_g$ denote the first time when $S_n$ leaves $(g_n,\infty)$. Assume that the random…

We investigate the phase diagram of branching annihilating random walks with one and two offsprings in one dimension. A walker can hop to a nearest neighbor site or branch with one or two offsprings with relative ratio. Two walkers…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…