Related papers: Delocalization-localization dynamical phase transi…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
In this paper, we consider discrete time quantum walks on graphs with coin focusing on the decentralized model, where the coin operation is allowed to change with the vertex of the graph. When the coin operations can be modified at every…
Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…
We consider the dynamical properties of dissipative continuous-time quantum walks on directed graphs. Using a large-deviation approach we construct a thermodynamic formalism allowing us to define a dynamical order parameter, and to identify…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
The symmetries associated with discrete-time quantum walks (DTQWs) and the flexibilities in controlling their dynamical parameters allow to create a large number of topological phases. An interface in position space, which separates two…
Rare event statistics for random walks on complex networks are investigated using the large deviations formalism. Within this formalism, rare events are realized as typical events in a suitably deformed path-ensemble, and their statistics…
Given two distinct subsets $A,B$ in the state space of some dynamical system, Transition Path Theory (TPT) was successfully used to describe the statistical behavior of transitions from $A$ to $B$ in the ergodic limit of the stationary…
We discuss here in detail a new analytical random walk approach to calculating the phase-diagram for spatially extended systems with multiplicative noise. We use the Anderson localization problem as an example. The transition from…
Dynamical phase transitions (DPTs) characterize critical changes in system behavior occurring at finite times, providing a lens to study nonequilibrium phenomena beyond conventional equilibrium physics. While extensively studied in quantum…
We investigate time-independent disorder on several two-dimensional discrete-time quantum walks. We find numerically that, contrary to claims in the literature, random onsite phase disorder, spin-dependent or otherwise, cannot localise the…
We investigate the delocalization transition appearing in an exclusion process with two internal states resp. on two parallel lanes. At the transition, delocalized domain walls form in the density profiles of both internal states, in…
Quantum processes of inherent dynamical nature, such as quantum walks (QWs), defy a description in terms of an equilibrium statistical physics ensemble. Up to now, it has remained a key challenge to identify general principles behind 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 suggest that if a localized phase at nonzero temperature $T>0$ exists for strongly disordered and weakly interacting electrons, as recently argued, it will also occur when both disorder and interactions are strong and $T$ is very high.…
Recently, random walks on dynamic graphs have been studied because of their adaptivity to the time-varying structure of real-world networks. In general, there is a tremendous gap between static and dynamic graph settings for the lazy simple…
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…
Large unweighted directed graphs are commonly used to capture relations between entities. A fundamental problem in the analysis of such networks is to properly define the similarity or dissimilarity between any two vertices. Despite the…
In this paper we study the behavior of a continuous time random walk (CTRW) on a stationary and ergodic time varying dynamic graph. We establish conditions under which the CTRW is a stationary and ergodic process. In general, the stationary…
The interest in quantum walks has been steadily increasing during the last two decades. It is still worth to present new forms of quantum walks that might find practical applications and new physical behaviors. In this work, we define…