Related papers: Fast Scramblers, Democratic Walks and Information …
Quantum walks are standard tools for searching graphs for marked vertices, and they often yield quadratic speedups over a classical random walk's hitting time. In some exceptional cases, however, the system only evolves by sign flips,…
The time evolutions of discrete-time quantum walks on graphs are determined by the local adjacency relations of the graphs. In this paper, first, we construct a discrete-time quantum walk model that reflects the embedding on the surface so…
This thesis investigates critical phenomena and equilibrium states in various stochastic models through three interconnected studies. In the first chapter, we analyze the Activated Random Walk model on a one-dimensional ring in the…
We study the dynamics of a deterministic walk confined in a narrow two-dimensional space randomly filled with point-like targets. At each step, the walker visits the nearest target not previously visited. Complex dynamics is observed at…
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…
Virtually all the emergent properties of a complex system are rooted in the non-homogeneous nature of the behaviours of its elements and of the interactions among them. However, the fact that heterogeneity and correlations can appear…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
* ACTIVATED RANDOM WALK MODEL * This is a conservative particle system on the lattice, with a Markovian continuous-time evolution. Active particles perform random walks without interaction, and they may as well change their state to…
Consider the dynamic environment governed by a Poissonian field of independent particles evolving as simple random walks on $\mathbb{Z}^d$. The random walk on random walks model refers to a particular stochastic process on $\mathbb{Z}^d$…
Diffusion in an evolving environment is studied by continuos-time Monte Carlo simulations. Diffusion is modelled by continuos-time random walkers on a lattice, in a dynamic environment provided by bubbles between two one-dimensional…
Contagions such as the spread of popular news stories, or infectious diseases, propagate in cascades over dynamic networks with unobservable topologies. However, "social signals" such as product purchase time, or blog entry timestamps are…
The propagation of an initially localized perturbation via an interacting many-particle Hamiltonian dynamics is investigated. We argue that the propagation of the perturbation can be captured by the use of a continuous-time random walk…
We introduce a novel operator to describe a random walk process on a simplicial complex. Walkers are allowed to wonder across simplices of various dimensions, bridging nodes to edges, and edges to triangles, via a nested organization that…
The emergence of collective motion, also known as flocking or swarming, in groups of moving individuals who orient themselves using only information from their neighbors is a very general phenomenon that is manifested at multiple spatial…
Discrete-time random walks and their extensions are common tools for analyzing animal movement data. In these analyses, resolution of temporal discretization is a critical feature. Ideally, a model both mirrors the relevant temporal scale…
We propose a model of a one-dimensional random walk in dynamic random environment that interpolates between two classical settings: (I) the random environment is sampled at time zero only; (II) the random environment is resampled at every…
Understanding various phenomena in non-equilibrium dynamics of closed quantum many-body systems, such as quantum thermalization, information scrambling, and nonergodic dynamics, is a crucial for modern physics. Using a ladder-type…
Dynamic graphs have emerged as an appropriate model to capture the changing nature of many modern networks, such as peer-to-peer overlays and mobile ad hoc networks. Most of the recent research on dynamic networks has only addressed the…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…
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…