Related papers: Random spreading phenomena in annealed small world…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…
An analytic effective medium theory is constructed to study the mean access times for random walks on hybrid disordered structures formed by embedding complex networks into regular lattices, considering transition rates $F$ that are…
Various types of walks on complex networks have been used in recent years to model search and navigation in several kinds of systems, with particular emphasis on random walks. This gives valuable information on network properties, but…
We solve exactly the non-equilibrium dynamics of two discrete random walkers moving in channels with transition rates $p \neq q$ that swap positions at a rate $s$. We compute exactly the joint probability distribution $P_{n,m}(t)$ for the…
We introduce a general approach for the study of the collective dynamics of non-interacting random walkers on connected networks. We analyze the movement of $R$ independent (Markovian) walkers, each defined by its own transition matrix. By…
We study the linear large $n$ behavior of the average number of distinct sites $S(n)$ visited by a random walker after $n$ steps on a large random graph. An expression for the graph topology dependent prefactor $B$ in $S(n) = Bn$ is…
We develop a framework to determine the complete statistical behavior of a fundamental quantity in the theory of random walks, namely, the probability that $n_1$, $n_2$, $n_3$, . . . distinct sites are visited at times $t_1$, $t_2$, $t_3$,…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…
Random walks find applications in many areas of science and are the heart of essential network analytic tools. When defined on temporal networks, even basic random walk models may exhibit a rich spectrum of behaviours, due to the…
We consider a model of a polymer in $\mathbb{Z}^{d+1}$, constrained to join 0 and a hyperplane at distance $N$. The polymer is subject to a quenched nonnegative random environment. Alternatively, the model describes crossing random walks in…
We investigate the splitting probability of a monitored continuous-time quantum walk with two targets and show that, in stark contrast to a classical random walk, it exhibits a nonanalytic, phase-transition-like behavior controlled by the…
We study discrete-time random walks on arbitrary networks with first-passage resetting processes. To the end, a set of nodes are chosen as observable nodes, and the walker is reset instantaneously to a given resetting node whenever it hits…
We consider a random walk in dimension $d\geq 1$ in a dynamic random environment evolving as an interchange process with rate $\gamma>0$. We only assume that the annealed drift is non-zero. We prove that the empirical velocity of the walker…
We consider a discrete-time Markovian random walk with resets on a connected undirected network. The resets, in which the walker is relocated to randomly chosen nodes, are governed by an independent discrete-time renewal process. Some nodes…
It is well known that many real world networks have the power-law degree distribution (scale-free property). However there are no rigorous results for continuous-time quantum walks on such realistic graphs. In this paper, we analyze…
We consider self-avoiding walk on a tree with random conductances. It is proven that in the weak disorder regime, the quenched critical point is equal to the annealed one, and that in the strong disorder regime, these critical points are…
We study a simple model in which the growth of a network is determined by the location of one or more random walkers. Depending on walker speed, the model generates a spectrum of structures situated between well-known limiting cases. We…
An analytical study of the behavior of the voter model on the small-world topology is performed. In order to solve the equations for the dynamics, we consider an annealed version of the Watts-Strogatz (WS) network, where long-range…