Related papers: Walks on Unitary Cayley Graphs and Applications
We prove that for the Activated Random Walks model on transitive unimodular graphs, if there is fixation, then every particle eventually fixates, almost surely. We deduce that the critical density is at most 1. Our methods apply for much…
We consider open quantum walks on a graph, and consider the random variables defined as the passage time and number of visits to a given point of the graph. We study in particular the probability that the passage time is finite, the…
If X is any connected Cayley graph on any finite abelian group, we determine precisely which flows on X can be written as a sum of hamiltonian cycles. (This answers a question of Brian Alspach.) In particular, if the degree of X is at least…
We count the number of closed walks on a vertex in a regular tree using the Catalan's triangle and also the Borel's triangle, showing another combinatorial structure counted by these two array of numbers.
We propose categories of $1$-dimensional and multi-dimensional quantum walks. In the categories, an object is a quantum walk, and a morphism is an intertwining operator between two quantum walks. The new framework enables us to discuss…
We compute the cone types of the Cayley graph of the modular group $\mathrm{PSL}(2,\mathbf{Z})$ associated with the standard system of generators ${\small\left\{\left(\begin{smallmatrix} 0 & -1 \\ 1 & 0…
The subject of this paper is a kind of dynamical systems called quantum walks. We study one-dimensional homogeneous analytic quantum walks U. We explain how to identify the space of all the uniform intertwining operators between these…
Coined quantum walks may be interpreted as the motion in position space of a quantum particle with a spin degree of freedom; the dynamics are determined by iterating a unitary transformation which is the product of a spin transformation and…
Walks on the representation graph $\mathcal R_{\mathsf{V}}(\mathsf{G})$ determined by a group $\mathsf{G}$ and a $\mathsf{G}$-module $\mathsf{V}$ are related to the centralizer algebras of the action of $\mathsf{G}$ on the tensor powers…
Quantum random walks have been much studied recently, largely due to their highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum random walk on the line: the use of multiple…
A graph is called a $k$-planar unit distance graph if it can be drawn in the plane such that every edge is a unit line segment and is involved in at most $k$ crossings. We investigate $u_k(n)$, the maximum number of edges of such graphs on…
It is well-known that classical random walks on regular graphs converge to the uniform distribution. Quantum walks, in their various forms, are quantizations of their corresponding classical random walk processes. Gerhardt and Watrous…
A map is a connected topological graph $\Gamma$ cellularly embedded in a surface. In this paper, applying Tutte's algebraic representation of map, new ideas for enumerating non-equivalent orientable or non-orientable maps of graph are…
Tree walks are a class of closed walks on a complete graph constrained to span trees. In this work, we focus on a special subclass called $k$-tours, which were recently introduced by Gunnells and are enumerated by the hypergraph Catalan…
The step-reinforced random walk (SRRW), where each step may replicate a randomly chosen past step, exhibits complex dependencies on the history. This paper introduces a generalized SRRW on groups, incorporating arbitrary transformations of…
We provide new examples of Cayley graphs on which the quantum walks reach uniform mixing. Our first result is a complete characterization of all $2(d+2)$-regular Cayley graphs over $\mathbb{Z}_3^d$ that admit uniform mixing at time…
We explicitly connect (discrete-time) quantum walks on Z with a four-state Markov additive process via a Feynman-type formula (2.5). Using this representation, we derive a relation between the spectral decomposition of the Markov additive…
Representations based on random walks can exploit discrete data distributions for clustering and classification. We extend such representations from discrete to continuous distributions. Transition probabilities are now calculated using a…
We give a short proof of the fact that the number of labelled trees on $n$ vertices is $n^{n-2}$. Although many short proofs are known, we have not seen this one before.
We make and generalize the observation that summing of probability amplitudes of a discrete-time quantum walk over partitions of the walking graph consistent with the step operator results in a unitary evolution on the reduced graph which…