Related papers: Fast Scramblers, Democratic Walks and Information …
Motivated by the question of whether all fast scramblers are holographically dual to quantum gravity, we study the dynamics of a non-integrable spin chain model composed of two ingredients - a nearest neighbor Ising coupling, and an…
Random walks represent an important tool for probing the structural and dynamical properties of networks and modeling transport and diffusion processes on networks. However, when individuals' movement becomes dictated by more complicated…
Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of…
In a fast scrambling many-body quantum system, information is spread and entanglement is built up on a timescale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body…
We consider the single-file dynamics of $N$ identical random walkers moving with diffusivity $D$ in one dimension (walkers bounce off each other when attempting to overtake). Additionally, we require that the separation between neighboring…
We investigate the dynamics of information scrambling in bosonic systems undergoing Gaussian unitary evolution associated with quadratic Hamiltonians. For initial Gaussian states, we observe the disappearance of the memory effect in the…
This paper concerns the propagation of particles through a quenched random medium. In the one- and two-dimensional models considered, the local dynamics is given by expanding circle maps and hyperbolic toral automorphisms, respectively. The…
Information diffusion on social networks has been described as a collective outcome of threshold behaviors in the framework of threshold models. However, since the existing models do not take into account individuals' optimization problem,…
We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…
Random graphs are a central element of the study of complex dynamical networks such as the internet, the brain, or socioeconomic phenomena. New methods to generate random graphs can spawn new applications and give insights into more…
Random walks on regular bounded degree expander graphs have numerous applications. A key property of these walks is that they converge rapidly to the uniform distribution on the vertices. The recent study of expansion of high dimensional…
How quantum information is scrambled in the global degrees of freedom of non-equilibrium many-body systems is a key question to understand local thermalization. Here we propose that the scaling of the mutual information between two…
We study a random walk problem on the hierarchical network which is a scale-free network grown deterministically. The random walk problem is mapped onto a dynamical Ising spin chain system in one dimension with a nonlocal spin update rule,…
We establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…
Many seemingly disparate Markov chains are unified when viewed as random walks on the set of chambers of a hyperplane arrangement. These include the Tsetlin library of theoretical computer science and various shuffling schemes. If only…
Interaction in quantum systems can spread initially localized quantum information into the many degrees of freedom of the entire system. Understanding this process, known as quantum scrambling, is the key to resolving various conundrums in…
Scrambling in interacting quantum systems out of equilibrium is particularly effective in the chaotic regime. Under time evolution, initially localized information is said to be scrambled as it spreads throughout the entire system. This…
In this paper we study the dynamics of nonlinear random walks. While typical random walks on networks consist of standard Markov chains whose static transition probabilities dictate the flow of random walkers through the network, nonlinear…
The paper investigates efficient distributed computation in dynamic networks in which the network topology changes (arbitrarily) from round to round. Our first contribution is a rigorous framework for design and analysis of distributed…
Stationary observers in static spacetimes see falling objects spread exponentially fast, or fast-scramble, near event horizons. We generalize this picture to arbitrary cosmological horizons. We give examples of exponential fast-scrambling…