Related papers: Damped random walks and the characteristic polynom…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

Random walks find extensive application across various complex network domains, including embedding generation and link prediction. Despite the widespread utilization of random walks, the precise impact of distinct biases on embedding…

In 2013 A.A. Borovkov and A.A. Mogulskii proved a weaker-than-standard "metric" large deviations principle (LDP) for trajectories of random walks in $R^d$ whose increments have the Laplace transform finite in a neighbourhood of zero. We…

In this paper we study the asymptotic behavior of the Random-Walk Metropolis algorithm on probability densities with two different `scales', where most of the probability mass is distributed along certain key directions with the…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

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…

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.

The deviation principles of record numbers in random walk models have not been completely investigated, especially for the non-nearest neighbor cases. In this paper, we derive the asymptotic probabilities of large and moderate deviations…

We prove that the speed of a $\lambda$-biased random walk on a supercritical Galton-Watson tree is differentiable for $\lambda$ such that the walk is ballistic and obeys a central limit theorem, and give an expression of the derivative…

The special limit of the totally asymmetric zero range process of the low-dimensional non-equilibrium statistical mechanics described by the non-Hermitian Hamiltonian is considered. The calculation of the conditional probabilities of the…

In this paper, we propose a general framework for the trapping problem on a weighted network with a perfect trap fixed at an arbitrary node. By utilizing the spectral graph theory, we provide an exact formula for mean first-passage time…

Recently, we initiated the study of random walk labelings of graphs. These are graph labelings that are obtainable by performing a random walk on the graph, such that each vertex is labeled upon its first visit. In this work, we calculate…

Random walks on graphs can be slow. To speed them up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon>0$ that we can choose it. We show that in this case, at least for graphs…

In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…

Graph embedding maps a graph into a convenient vector-space representation for graph analysis and machine learning applications. Many graph embedding methods hinge on a sampling of context nodes based on random walks. However, random walks…

We report on the asymptotic behaviour of a new model of random walk, we term the bindweed model, evolving in a random environment on an infinite multiplexed tree. The term \textit{multiplexed} means that the model can be viewed as a nearest…

Let $\Gamma$ be a countable discrete group, $H$ a lcsc totally disconnected group and $\rho : \Gamma \rightarrow H$ a homomorphism with dense image. We develop a general and explicit technique which provides, for every compact open subgroup…

We revisit the computation of the discrete version of Schramm's formula for the loop-erased random walk derived by Kenyon. The explicit formula in terms of the Green function relies on the use of a complex connection on a graph, for which a…

We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…

We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…