Related papers: Heat-bath random walks with Markov bases
We introduce a cover time problem for random walks on dynamic graphs in which the graph expands in time and the walker moves at random times. Time to cover all nodes and number of returns to original states are analyzed in resulting model.
We study the heat content on quantum graphs and investigate whether an analogon of the Rayleigh-Faber-Krahn inequality holds. This means that heat content at time $T$ among graphs of equal volume would be maximized by intervals (the graph…
In this paper, we study random walks evolving on Z in a dynamic random environment that we assume to have time correlations that decrease polynomially fast. We show a law of large numbers by generalizing methods already used for the…
This paper concerns a random walk that moves on the integer lattice and has zero mean and a finite variance. We obtain first an asymptotic estimate of the transition probability of the walk absorbed at the origin, and then, using the…
Random walks describe diffusion processes, where movement at every time step is restricted to only the neighbouring locations. We construct a quantum random walk algorithm, based on discretisation of the Dirac evolution operator inspired by…
We propose a theory of ripples in suspended graphene sheets based on two-dimensional elasticity equations that are made discrete on the honeycomb lattice and then periodized. At each point carbon atoms are coupled to Ising spins whose…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
We investigate the behavior of data structures when the input and operations are generated by an event graph. This model is inspired by Markov chains. We are given a fixed graph G, whose nodes are annotated with operations of the type…
We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…
A one-dimensional confined Nonlinear Random Walk is a tuple of $N$ diffeomorphisms of the unit interval driven by a probabilistic Markov chain. For generic such walks, we obtain a geometric characterization of their ergodic stationary…
We consider a random walk on $\Z$ that branches at the origin only. In the supercritical regime we establish a law of large number for the maximal position $M_n$. Then we determine all possible limiting law for the sequence $M_n -\alpha n$…
We consider the dynamics of lattice random walks with resetting. The walker moving randomly on a lattice of arbitrary dimensions resets at every time step to a given site with a constant probability $r$. We construct a discrete renewal…
We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…
We prove a cutoff for the random walk on random $n$-lifts of finite weighted graphs, even when the random walk on the base graph $\mathcal{G}$ of the lift is not reversible. The mixing time is w.h.p. $t_{mix}=h^{-1}\log n$, where $h$ is a…
We study a reversible continuous-time Markov dynamics on lozenge tilings of the plane, introduced by Luby et al. Single updates consist in concatenations of $n$ elementary lozenge rotations at adjacent vertices. The dynamics can also be…
We study random walks on dynamically evolving graphs, where the environment is given by a time-dependent subset of the edges of an underlying graph. Concretely, following the recently introduced framework of Lelli and Stauffer, we consider…
We study the asymptotic position distribution of general quantum walks on a lattice, including walks with a random coin, which is chosen from step to step by a general Markov chain. In the unitary (i.e., non-random) case, we allow any…
The rotor walk on a graph is a deterministic analogue of random walk. Each vertex is equipped with a rotor, which routes the walker to the neighbouring vertices in a fixed cyclic order on successive visits. We consider rotor walk on an…
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…
We extend the use of random evolving sets to time-varying conductance models and utilize it to provide tight heat kernel upper bounds. It yields the transience of any uniformly lazy random walk, on Z^d, d>=3, equipped with uniformly bounded…