Related papers: Linearly edge-reinforced random walks
We give a simple proof for recurrence of vertex reinforced jump process on \(\mathbb{Z}^d\), under strong reinforcement. Moreover, we show how the previous result implies that linearly edge-reinforced random walk on \ \(\mathbb{Z}^d\) is…
Node embeddings have become an ubiquitous technique for representing graph data in a low dimensional space. Graph autoencoders, as one of the widely adapted deep models, have been proposed to learn graph embeddings in an unsupervised way by…
A random walk in random scenery $(Y_n)_{n\in\mathbb{N}}$ is given by $Y_n=\xi_{S_n}$ for a random walk $(S_n)_{n\in\mathbb{N}}$ and iid random variables $(\xi_n)_{n\in\mathbb{Z}}$. In this paper, we will show the weak convergence of the…
We study random walk among random conductance (RWRC) on complete graphs with N vertices. The conductances are i.i.d. and the sum of conductances emanating from a single vertex asymptotically has an infinitely divisible distribution…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
We provide asymptotics for the range R(n) of a random walk on the d-dimensional lattice indexed by a random tree with n vertices. Using Kingman's subadditive ergodic theorem, we prove under general assumptions that R(n)/n converges to a…
We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…
We investigate reflected random walks in the quarter plane, with particular emphasis on the time spent along the reflection boundary axes. Assuming the drift of the random walk lies within the cone, the local time converges -- without the…
We discuss the quenched tail estimates for the random walk in random scenery. The random walk is the symmetric nearest neighbor walk and the random scenery is assumed to be independent and identically distributed, non-negative, and has a…
In this paper, we present an overview of different types of random walk strategies with local and non-local transitions on undirected connected networks. We present a general approach to analyzing these strategies by defining the dynamics…
We consider the random walk in an independent and identically distributed (i.i.d.) random environment on a Cayley graph of a finite free product of copies of $\mathbb{Z}$ and $\mathbb{Z}_2$. Such a Cayley graph is readily seen to be a…
The node2vec random walk is a non-Markovian random walk on the vertex set of a graph, widely used for network embedding and exploration. This random walk model is defined in terms of three parameters which control the probability of,…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
Random walk on the irreducible representations of the symmetric and general linear groups is studied. A separation distance cutoff is proved and the exact separation distance asymptotics are determined. A key tool is a method for writing…
The models surveyed include generalized P\'{o}lya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches provided of some proofs. Applications are…
We consider one infinite path of a Random Walk in Random Environment (RWRE, for short) in an unknown environment. This environment consists of either i.i.d.\ site or bond randomness. At each position the random walker stops and tells us the…
We discuss recurrence and ergodicity properties of random walks and associated skew products for large classes of locally compact groups and homogeneous spaces. In particular we show that a closed subgroup of a product of finitely many…
Let $G$ be a finite tree with root $r$ and associate to the internal vertices of $G$ a collection of transition probabilities for a simple nondegenerate Markov chain. Embedd $G$ into a graph $G^\prime$ constructed by gluing finite linear…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…