Related papers: A Loop Reversibility and Subdiffusion of the Rotor…
The evolution of many stochastic systems is accurately described by random walks on graphs. We here explore the close connection between local steady-state fluctuations of random walks and the global structure of the underlying graph.…
Random walks on dynamic graphs have received increasingly more attention from different academic communities over the last decade. Despite the relatively large literature, little is known about random walks that construct the graph where…
Recurrence plots exhibit line structures which represent typical behaviour of the investigated system. The local slope of these line structures is connected with a specific transformation of the time scales of different segments of the…
We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines and the second one is assembled by a periodic embedding of the cycles in $\mathbb{Z}$. We…
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 consider a model for random walks on random environments (RWRE) with random subset of Z^d as the vertices, and uniform transition probabilities on 2d points (two "coordinate nearest points" in each of the d coordinate directions). We…
The paper is concerned with a new approach for the recurrence property of the oscillating process on $\mathbb{Z}$ in Kemperman's sense. In the case when the random walk is ascending on $\mathbb{Z}^-$ and descending on $\mathbb{Z}^+$, we…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
We study a continuous time random walk, $X$, on ${\mathbb{Z}}^d$ in an environment of random conductances taking values in $(0,\infty)$. We assume that the law of the conductances is ergodic with respect to space shifts. We prove a quenched…
We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…
A Random Walk in Changing Environment (RWCE) is a weighted random walk on a locally finite, connected graph $G$ with random, time-dependent edge-weights. This includes self-interacting random walks, where the edge-weights depend on the…
We consider two natural models of random walks on a module $V$ over a finite commutative ring $R$ driven simultaneously by addition of random elements in $V$, and multiplication by random elements in $R$. In the coin-toss walk, either one…
We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…
Recurrence is a fundamental characteristic of dynamical systems with complicated behavior. Understanding the inner structure of recurrence is challenging, especially if the system has many degrees of freedom and is subject to noise. We…
Most transport theorems---that is, a formula for the rate of change of an integral in which both the integrand and domain of integration depend on time---involve domains that evolve according to a flow map. Such domains are said to be…
We consider the diffusion-advection problem in two simple cellular flow models (often invoked as examples for subdiffusive tracer's motion) and concentrate on the intermediate time range, in which the tracer's motion indeed may show…
We formulate the generalized master equation for a class of continuous time random walks in the presence of a prescribed deterministic evolution between successive transitions. This formulation is exemplified by means of an…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
We study random walks on the integers driven by a sample of time-dependent nearest-neighbor conductances that are bounded but are permitted to vanish over time intervals of positive Lebesgue-length. Assuming only ergodicity of the…
We study the distribution of the number of (non-backtracking) periodic walks on large regular graphs. We propose a formula for the ratio between the variance of the number of $t$-periodic walks and its mean, when the cardinality of the…