Related papers: A random walk on the Rado graph

It is a fact simple to establish that the mixing time of the simple random walk on a d-regular graph $G_n$ with n vertices is asymptotically bounded from below by $d/ ((d-2)\log (d-1))\log n$. Such a bound is obtained by comparing the walk…

Random walks on graphs are a fundamental concept in graph theory and play a crucial role in solving a wide range of theoretical and applied problems in discrete math, probability, theoretical computer science, network science, and machine…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…

We study random walks in i.i.d. random environments on $\mathbb{Z}^d$ when there are two basic types of vertices, which we call "blue" and "red". Each color represents a different probability distribution on transition probability vectors.…

We consider smooth random dynamical systems defined by a distribution with a finite moment of the norm of the differential, and prove that under suitable non-degeneracy conditions any stationary measure must be H\"older continuous. The…

This note contains old instead of new results about random walks on groups, which may serve as a small supplement to the author's monograph ``Random Walks on Infinite Graphs and Groups'' (Cambridge Univ. Press 2000/2009). First, we exhibit…

We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…

In this paper we define direct product of graphs and give a recipe for obtained probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

We consider a modified random walk which uses unvisited edges whenever possible, and makes a simple random walk otherwise. We call such a walk an edge-process. We assume there is a rule A, which tells the walk which unvisited edge to use…

Let $X_1,X_2$ be independent random walks on $\mathbf{Z}_n^d$, $d\geq3$, each starting from the uniform distribution. Initially, each site of $\mathbf{Z}_n^d$ is unmarked, and, whenever $X_i$ visits such a site, it is set irreversibly to…

The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established linking complexity of the complement of a regular graph to…

In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…

Consider a branching random walk $(G_u)_{u\in \mathbb T}$ on the general linear group $\textrm{GL}(V)$ of a finite dimensional space $V$, where $\mathbb T$ is the associated genealogical tree with nodes $u$. For any starting point $v \in V…

Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…

Let $\Gamma$ act on a countable set V with only finitely many orbits. Given a $\Gamma$-invariant random environment for a Markov chain on V and a random scenery, we exhibit, under certain conditions, an equivalent stationary measure for the…

We consider random walks in dynamic random environments and propose a criterion which, if satisfied, allows to decompose the random walk trajectory into i.i.d. increments, and ultimately to prove limit theorems. The criterion involves the…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

We prove a sharp rate of convergence to stationarity for a natural random walk on a compact Riemannian manifold $(M,g)$. The proof includes a detailed study of the spectral theory of the associated operator.

We investigate the hitting times of random walks on graphs, where a hitting time is defined as the number of steps required for a random walker to move from one node to another. While much of the existing literature focuses on calculating…