Related papers: Vertex reinforced random walks with exponential in…
We consider a model for random walks on random environments (RWRE) with random subset of the d-dimensional Euclidean lattice as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the…
We study a model of multi-excited random walk on a regular tree which generalizes the models of the once excited random walk and the digging random walk introduced by Volkov (2003). We show the existence of a phase transition of the…
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous…
Self-repelling two-leg (biped) spider walk is considered where the local stochastic movements are governed by two independent control parameters $ \beta_d$ and $ \beta_h $, so that the former controls the distance ($ d $) between the legs…
This paper investigates the Einstein relation; the connection between the volume growth, the resistance growth and the expected time a random walk needs to leave a ball on a weighted graph. The Einstein relation is proved under different…
We consider random walks in random Dirichlet environment (RWDE) which is a special type of random walks in random environment where the exit probabilities at each site are i.i.d. Dirichlet random variables. On $\Z^d$, RWDE are parameterized…
This work deals with the stationary analysis of two-dimensional partially homogeneous nearest-neighbour random walks. Such type of random walks in the quarter plane are characterized by the fact that the one-step transition probabilities…
This paper concerns the Vertex reinforced jump process (VRJP), the Edge reinforced random walk (ERRW) and their link with a random Schr\"odinger operator. On infinite graphs, we define a 1-dependent random potential $\beta$ extending that…
In this letter we study the NP-complete vertex cover problem on finite connectivity random graphs. When the allowed size of the cover set is decreased, a discontinuous transition in solvability and typical-case complexity occurs. This…
We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "intensity" of the loop-erased random walk in…
We consider a preferential attachment random graph with self-reinforcement. Each time a new vertex comes in, it attaches itself to an old vertex with a probability that is proportional to the sum of the degrees of that old vertex at all…
We introduce a model of graph-constrained dynamic choice with reinforcement modeled by positively $\alpha$-homogeneous rewards. We show that its empirical process, which can be written as a stochastic approximation recursion with Markov…
It has been conjectured that the critical density of the Activated Random Walk model is strictly less than one for any value of the sleeping rate. We prove this conjecture on $\mathbb{Z}^d$ when $d \geq 3$ and, more generally, on graphs…
We study convergence to stationarity for random walks on dynamic random digraphs with given degree sequences. The digraphs undergo full regeneration at independent geometrically distributed random time intervals with parameter $\alpha$.…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
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…
Recent advancements in model-free deep reinforcement learning have enabled efficient agent training. However, challenges arise when determining the region of attraction for these controllers, especially if the region does not fully cover…