Related papers: The square and add Markov chain
We propose a model of random walks on weighted graphs where the weights are interval valued, and connect it to reversible imprecise Markov chains. While the theory of imprecise Markov chains is now well established, this is a first attempt…
The position density of a "particle" performing a continuous-time quantum walk on the integer lattice, viewed on length scales inversely proportional to the time t, converges (as t tends to infinity) to a probability distribution that…
Let $Q$ be a probability measure on a finite group $G$, and let $H$ be a subgroup of $G$. We show that a necessary and sufficient condition for the random walk driven by $Q$ on $G$ to induce a Markov chain on the double coset space…
We study limit laws for simple random walks on supercritical long range percolation clusters on $\Z^d, d \geq 1$. For the long range percolation model, the probability that two vertices $x, y$ are connected behaves asymptotically as…
We establish a novel type of connection between random walks and analytic number theory. Working with a random walk on the circle group $\mathbb{R}/\mathbb{Z}$ in which each step is a random integer multiple of a given quadratic irrational…
First, we prove a \emph{local almost sure central limit theorem} for lattice random walks in the plane. The corresponding version for random walks in the line was considered by the author in \cite{5}. This gives us a quantitative version of…
The extremes of a univariate Markov chain with regulary varying stationary marginal distribution and asymptotically linear behavior are known to exhibit a multiplicative random walk structure called the tail chain. In this paper, we extend…
We survey recent results on some one- and two-dimensional patterns generated by random permutations of natural numbers. In the first part, we discuss properties of random walks, evolving on a one-dimensional regular lattice in discrete time…
We consider the random walk on the hypercube which moves by picking an ordered pair $(i,j)$ of distinct coordinates uniformly at random and adding the bit at location $i$ to the bit at location $j$, modulo $2$. We show that this Markov…
A connection between the asymptotic behavior of the open quantum walk and the spectrum of a generalized quantum coins is studied. For the case of simultaneously diagonalizable transition operators an exact expression for probability…
The notion of Laplacian of a graph can be generalized to simplicial complexes and hypergraphs, and contains information on the topology of these structures. Even for a graph, the consideration of associated simplicial complexes is…
We show through intensive simulations that the paradigmatic features of anomalous diffusion are indeed the features of a (continuous-time) random walk driven by two different Markovian hopping-trap mechanisms. If $p \in (0,1/2)$ and $1-p$…
Random walks with a general, nonlinear barrier have found recent applications ranging from reionization topology to refinements in the excursion set theory of halos. Here, we derive the first-crossing distribution of random walks with a…
In this paper, we present a novel iterative Monte Carlo method for approximating the stationary probability of a single state of a positive recurrent Markov chain. We utilize the characterization that the stationary probability of a state…
We introduce a set of techniques that allow for efficiently generating many independent random walks in the Massive Parallel Computation (MPC) model with space per machine strongly sublinear in the number of vertices. In this…
We give an example of a transient reversible Markov chain that almost surely has only a finite number of cutpoints. We explain how this is relevant to a conjecture of Diaconis and Freedman and a question of Kaimanovich. We also answer…
Galois theory is developed using elementary polynomial and group algebra. The method follows closely the original prescription of Galois, and has the benefit of making the theory accessible to a wide audience. The theory is illustrated by a…
We present an efficient general method for realizing a quantum walk operator corresponding to an arbitrary sparse classical random walk. Our approach is based on Grover and Rudolph's method for preparing coherent versions of efficiently…
The successive discrete structures generated by a sequential algorithm from random input constitute a Markov chain that may exhibit long term dependence on its first few input values. Using examples from random graph theory and search…
The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…