Related papers: Delocalization-localization dynamical phase transi…
We study the appearance of first-order dynamical phase transitions (DPTs) as `intermittent' co-existing phases in the fluctuations of random walks on graphs. We show that the diverging time scale leading to critical behaviour is the waiting…
Random walk subject to random drive has been extensively employed as a model for physical and biological processes. While equilibrium statistical physics has yielded significant insights into the distributions of dynamical fixed points of…
We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…
We establish and generalise several bounds for various random walk quantities including the mixing time and the maximum hitting time. Unlike previous analyses, our derivations are based on rather intuitive notions of local expansion…
The study of dynamical large deviations allows for a characterization of stationary states of lattice gas models out of equilibrium conditioned on averages of dynamical observables. The application of this framework to the two-dimensional…
Quantum walks are promising for information processing tasks because on regular graphs they spread quadratically faster than random walks. Static disorder, however, can turn the tables: unlike random walks, quantum walks can suffer Anderson…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We study the dynamical localization of discrete time evolution of topological split-step quantum random walk (QRW) on a single-site defect starting from a uniform distribution. Using analytical and numerical calculations, we determine the…
Signaled by non-analyticities in the time evolution of physical observables, dynamic quantum phase transitions (DQPTs) emerge in quench dynamics of topological systems and possess an interesting geometric origin captured by dynamic…
We consider quantum walks defined on arbitrary infinite graphs, parameterized by a family of scattering matrices attached to the vertices. Multiplying each scattering matrix by an i.i.d. random phase, we obtain a random scattering quantum…
We study the time-averaged flow in a model of particles that randomly hop on a finite directed graph. In the limit as the number of particles and the time window go to infinity but the graph remains finite, the large-deviation rate…
We consider d-dimensional random surface models which for d=1 are the standard (tied-down) random walks (considered as a random ``string''). In higher dimensions, the one-dimensional (discrete) time parameter of the random walk is replaced…
The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous…
We show the existence of a phase transition between a localisation and a non-localisation regime for a branching random walk with a catalyst at the origin. More precisely, we consider a continuous-time branching random walk that jumps at…
Dynamical phase transitions (DPTs) arise from qualitative changes in the long-time behavior of stochastic trajectories, often observed in systems with kinetic constraints or driven out of equilibrium. Here we demonstrate that first-order…
We consider a d-dimensional random quantum walk with site-dependent random coin operators. The corresponding transition coefficients are characterized by deterministic amplitudes times independent identically distributed site-dependent…
We study the dynamical phase transitions (DPTs) appearing for a single Brownian particle without drift. We first explore how first-order DPTs in large deviations can be found even for a single Brownian particle without any force upon…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
Consider the following computational problem: given a regular digraph $G=(V,E)$, two vertices $u,v \in V$, and a walk length $t\in \mathbb{N}$, estimate the probability that a random walk of length $t$ from $u$ ends at $v$ to within $\pm…
We study the state transfer through quantum walks placed on a bounded one-dimensional path. We first consider continuous-time quantum walks from a Gaussian state. We find such a state when superposing centered on the starting and antipodal…