Related papers: Universal exploration dynamics of random walks
Discrete-time quantum walks, quantum generalizations of classical random walks, provide a framework for quantum information processing, quantum algorithms and quantum simulation of condensed matter systems. The key property of quantum…
We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…
Consider a collaborative dynamic of $k$ independent random walks on a finite connected graph $G$. We are interested in the size of the set of vertices visited by at least one walker and study how the number of walkers relates to the…
We establish recurrence criteria for sums of independent random variables which take values in Euclidean lattices of varying dimension. In particular, we describe transient inhomogenous random walks in the plane which interlace two…
We study the convex hull of the set of points visited by a two-dimensional random walker of T discrete time steps. Two natural observables that characterize the convex hull in two dimensions are its perimeter L and area A. While the mean…
The versatility of renewal theory is owed to its abstract formulation. Renewals can be interpreted as steps of a random walk, switching events in two-state models, domain crossings of a random motion, etc. We here discuss a renewal process…
Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…
The interaction of all mobile species with their environment hinges on their movement patterns: the places they visit and how frequently they go there. In human society, where the prevalent form of cohabitation is in cities, the highly…
Temporal graphs are graphs where the edge set can change in each time step, and the vertex set stays the same. Exploration of temporal graphs whose snapshot in each time step is a connected graph, called connected temporal graphs, has been…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
We propose local-biased random walks on general networks where a Markovian walker can choose between different types of biases in each node to define transitions to its neighbors depending on their degrees. For this ergodic dynamics, we…
We construct a renewal structure for random walks on surface groups. The renewal times are defined as times when the random walks enters a particular type of a cone and never leaves it again. As a consequence, the trajectory of the random…
Consider a random medium consisting of points randomly distributed so that there is no correlation among the distances. This is the random link model, which is the high dimensionality limit (mean field approximation) for the euclidean…
In recent years, several experiments highlighted a new type of diffusion anomaly, which was called Brownian yet non-Gaussian diffusion. In systems displaying this behavior, the mean squared displacement of the diffusing particles grows…
We analyze the dynamics of a population of independent random walkers on a graph and develop a simple model of epidemic spreading. We assume that each walker visits independently the nodes of a finite ergodic graph in a discrete-time…
Particle hopping is a common feature in heterogeneous media. We explore such motion by using the widely applicable formalism of the continuous time random walk and focus on the statistics of rare events. Numerous experiments have shown that…
Branching random walks are key to the description of several physical and biological systems, such as neutron multiplication, genetics and population dynamics. For a broad class of such processes, in this Letter we derive the discrete…
We introduce random walks in a sparse random environment on $\mathbb Z$ and investigate basic asymptotic properties of this model, such as recurrence-transience, asymptotic speed, and limit theorems in both the transient and recurrent…
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…
Functional limit theorem for continuous-time random walks (CTRW) are found in general case of dependent waiting times and jump sizes that are also position dependent. The limiting anomalous diffusion is described in terms of fractional…