相关论文: Fast graphs for the random walker

We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…

We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \[ \operatorname{Var}_x(\tau_y)+\mathbb E_x\tau_y \ge \frac{(\mathbb E_x\tau_y)^2}{1+\log n}, \]…

We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…

This paper presents necessary and sufficient conditions for on- and off-diagonal transition probability estimates for random walks on weighted graphs. On the integer lattice and on may fractal type graphs both the volume of a ball and the…

For a finite graph $G=(V,E)$ let $G^*$ be obtained by considering a random perfect matching of $V$ and adding the corresponding edges to $G$ with weight $\varepsilon$, while assigning weight 1 to the original edges of $G$. We consider…

The graph obtained from the integer grid Z x Z by the removal of all horizontal edges that do not belong to the x-axis is called a comb. In a random walk on a graph, whenever a walker is at a vertex v, in the next step it will visit one of…

We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…

The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…

For any given vertices $u$ and $v$ in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex $v$ starting at vertex $u$. The expected value of the hitting time is the…

The paper presents two results. The first one provides separate conditions for the upper and lower estimate of the distribution of the exit time from balls of a random walk on a weighted graph. The main result of the paper is that the lower…

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

Let $(X_n)_{n\geq 0}$ be a reversible random walk on a graph $G$ satisfying an anchored isoperimetric inequality. We give upper bounds for exit time (and occupation time in transient case) by X of any set which contains the root. As an…

Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…

This paper studies the on- and off-diagonal upper estimate and the two-sided transition probability estimate of random walks on weighted graphs.

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…

We consider a linearly edge-reinforced random walk on a class of two-dimensional graphs with constant initial weights. The graphs are obtained from $\mathbb{Z}^2$ by replacing every edge by a sufficiently large, but fixed number of edges in…

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…

We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…

We consider a random walk in a random environment (RWRE) on the strip of finite width $\mathbb{Z} \times \{1,2,\ldots,d\}$. We prove both quenched and averaged large deviation principles for the position and the hitting times of the RWRE.…