Related papers: Positive speed self-avoiding walks on graphs with …
A discrete-time quantum walk on a graph is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. Hitting times for discrete quantum walks on graphs give an average time before the walk…
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},…
By a theorem of Volkov (2001) we know that on most graphs with positive probability the linearly vertex-reinforced random walk (VRRW) stays within a finite "trapping" subgraph at all large times. The question of whether this tail behavior…
The goal is to show that an edge-reinforced random walk on a graph of bounded degree, with reinforcement weight function $W$ taken from a general class of reciprocally summable reinforcement weight functions, traverses a random attracting…
We consider the following situation: G is a finite directed graph, where to each vertex of G is assigned an element of a finite group Gamma. We consider all walks of length N on G, starting from v_i and ending at v_j To each such walk $w$…
We study self-avoiding walks on restricted square lattices, more precisely on the lattice strips $\mathbb{Z} \times \{-1,0,1\}$ and $\mathbb{Z}\times \{-1,0,1,2\}$. We obtain the value of the connective constant for the $\mathbb{Z} \times…
We show that certain types of quantum walks can be modeled as waves that propagate in a medium with phase and group velocities that are explicitly calculable. Since the group and phase velocities indicate how fast wave packets can propagate…
The walk distances in graphs are defined as the result of appropriate transformations of the $\sum_{k=0}^\infty(tA)^k$ proximity measures, where $A$ is the weighted adjacency matrix of a graph and $t$ is a sufficiently small positive…
Refining previous results, we establish a sharp asymptotic estimate on the expected graph distance between the origin and the terminal point of the trace of the first $n$ steps of the walk. A similar conclusion is drawn for the resistance…
We study two random processes on an $n$-vertex graph inspired by the internal diffusion limited aggregation (IDLA) model. In both processes $n$ particles start from an arbitrary but fixed origin. Each particle performs a simple random walk…
Cell crawling is critical to biological development, homeostasis and disease. In many cases, cell trajectories are quasi-random-walk. In vitro assays on flat surfaces often described such quasi-random-walk cell trajectories as…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…
We focus on the study of dynamics of two kinds of random walk: generic random walk (GRW) and maximal entropy random walk (MERW) on two model networks: Cayley trees and ladder graphs. The stationary probability distribution for MERW is given…
We study certain phase transitions of branching random walks (BRW) on Cayley graphs of free products. The aim of this paper is to compare the size and structural properties of the trace, i.e., the subgraph that consists of all edges and…
Node connectivity plays a central role in temporal network analysis. We provide a comprehensive study of various concepts of walks in temporal graphs, that is, graphs with fixed vertex sets but edge sets changing over time. Taking into…
Let $G$ be a Cayley graph of a nonamenable group with spectral radius $\rho < 1$. It is known that branching random walk on $G$ with offspring distribution $\mu$ is transient, i.e., visits the origin at most finitely often almost surely, if…
Self-avoiding walks (SAWs) and loop-erased random walks (LERWs) are two ensembles of random paths with numerous applications in mathematics, statistical physics and quantum field theory. While SAWs are described by the $n \to 0$ limit of…
Let $G$ be a finite abelian group. Bridges and Mena characterized the Cayley graphs of $G$ that have only integer eigenvalues. Here we consider the $(0,1,-1)$ adjacency matrix of an oriented Cayley graph or of a signed Cayley graph $X$ on…
Self-attracting walks (SATW) with attractive interaction u > 0 display a swelling-collapse transition at a critical u_{\mathrm{c}} for dimensions d >= 2, analogous to the \Theta transition of polymers. We are interested in the structure of…
Given a directed graph $G$ and a pair of nodes $s$ and $t$, an \emph{$s$-$t$ bridge} of $G$ is an edge whose removal breaks all $s$-$t$ paths of $G$ (and thus appears in all $s$-$t$ paths). Computing all $s$-$t$ bridges of $G$ is a basic…