Related papers: Attraction time for strongly reinforced walks
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 discuss a particular kind of quantum walk on a general graph. We affix two semi-infinite lines to a general finite graph, which we call tails. On the tails, the particle making the walk simply advances one unit at each time step, so that…
We reconsider a classical, well-studied problem from applied probability. This is the max-sum equivalence of randomly weighted sums, and the originality is because we manage to include interdependence among the primary random variables, as…
We consider integer-valued random walks with independent but not identically distributed increments, and extend to this context several classical estimates, including a local limit theorem, precise small-ball estimates (both conditional on…
In this paper we show that on bounded degree graphs and general trees, the cover time of the simple random walk is asymptotically equal to the product of the number of edges and the square of the expected supremum of the Gaussian free field…
Given any $\gamma>0$ and for $\eta=\{\eta_v\}_{v\in \mathbb Z^2}$ denoting a sample of the two-dimensional discrete Gaussian free field on $\mathbb Z^2$ pinned at the origin, we consider the random walk on~$\mathbb Z^2$ among random…
We consider a variant of self-repelling random walk on the integer lattice Z where the self-repellence is defined in terms of the local time on oriented edges. The long-time asymptotic scaling of this walk is surprisingly different from the…
We continue the investigation of the localization phenomenon for a Vertex Reinforced Random Walk on the integer lattice. We provide some partial results towards a full characterization of the weights for which localization on 5 sites occurs…
We consider a continuous time simple random walk on a subset of the square lattice with wired boundary conditions: the walk transitions at unit edge rate on the graph obtained from the lattice closure of the subset by contracting the…
We consider random walks with finite second moment which drifts to $-\infty$ and have heavy tail. We focus on the events when the minimum and the final value of this walk belong to some compact set. We first specify the associated…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
A certain class of directed metric graphs is considered. Asymptotics for a number of possible endpoints of a random walk at large times is found.
An infinite convergent sum of independent and identically distributed random variables discounted by a multiplicative random walk is called perpetuity, because of a possible actuarial application. We give three disjoint groups of sufficient…
We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…
The asymptotics of the probability that the self-intersection local time of a random walk on $\Z^d$ exceeds its expectation by a large amount is a fascinating subject because of its relation to some models from Statistical Mechanics, to…
We consider branching random walks and contact processes on infinite, connected, locally finite graphs whose reproduction and infectivity rates across edges are inversely proportional to vertex degree. We show that when the ambient graph is…
We study the dynamics in C^2 of superattracting fixed point germs and of polynomial maps near infinity. In both cases we show that the asymptotic attraction rate is a quadratic integer, and construct a plurisubharmonic function with the…
Graph products have been extensively applied to model complex networks with striking properties observed in real-world complex systems. In this paper, we study the hitting times for random walks on a class of graphs generated iteratively by…
We show that the expected time for a random walk on a (multi-)graph $G$ to traverse all $m$ edges of $G$, and return to its starting point, is at most $2m^2$; if each edge must be traversed in both directions, the bound is $3m^2$. Both…