Related papers: Directed Random Walks on Colored, Periodic Lattice…
In this note, we try to analyze and clarify the intriguing interplay between some counting problems related to specific thermalized weighted graphs and random walks consistent with such graphs.
We consider a class of self-interacting random walks in deterministic or random environments, known as excited random walks or cookie walks, on the d-dimensional integer lattice. The main purpose of this paper is two-fold: to give a survey…
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.
Directed covers of finite graphs are also known as periodic trees or trees with finitely many cone types. We expand the existing theory of directed covers of finite graphs to those of infinite graphs. While the lower growth rate still…
Random walks on general graphs play an important role in the understanding of the general theory of stochastic processes. Beyond their fundamental interest in probability theory, they arise also as simple models of physical systems. A brief…
Simple random walks on various types of partially horizontally oriented regular lattices are considered. The horizontal orientations of the lattices can be of various types (deterministic or random) and depending on the nature of the…
A necessary and sufficient condition for a random walk in a finite directed graph subject to a road coloring to be measurable with respect to the driving random road colors is proved to be that the road coloring is synchronizing. For this,…
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…
A constructive proof is given to the fact that any ergodic Markov chain can be realized as a random walk subject to a synchronizing road coloring. Redundancy (ratio of extra entropy) in such a realization is also studied.
Random walks of particles on a lattice are a classical paradigm for the microscopic mechanism underlying diffusive processes. In deterministic walks, the role of space and time can be reversed, and the microscopic dynamics can produce quite…
We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…
Random walks on graphs are widely used in all sciences to describe a great variety of phenomena where dynamical random processes are affected by topology. In recent years, relevant mathematical results have been obtained in this field, and…
Quantum walks on graphs can model physical processes and serve as efficient tools in quantum information theory. Once we admit random variations in the connectivity of the underlying graph, we arrive at the problem of percolation, where the…
We introduce the concept of a deterministic walk. Confining our attention to the finite state case, we establish hypotheses that ensure that the deterministic walk is transitive, and show that this property is in some sense robust. We also…
We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…
We propose an experimental mathematics approach leading to the computer-driven discovery of various structural properties of general counting functions coming from enumeration of walks.
A random walk problem with particles on discrete double infinite linear grids is discussed. The model is based on the work of Montroll and others. A probability connected with the problem is given in the form of integrals containing…
We define a random walk on the set of primitive points of $\mathbb{Z}^d$. We prove that for walks generated by measures satisfying mild conditions these walks are recurrent in a strong sense. That is, we show that the associated Markov…
We consider random walks on edge coloured random graphs, where the colour of an edge reflects the cost of using it. In the simplest instance, the edges are coloured red or blue. Blue edges are free to use, whereas red edges incur a unit…
A number of papers have examined various aspects of "random random" walks on finite groups; the purpose of this article is to provide a survey of this work and to show, bring together, and discuss some of the arguments and results in this…