相关论文: Ergodic Effects in Token Circulation

The action of any local operator on a quantum system propagates through the system carrying the information of the operator. This is usually studied via the out-of-time-order correlator (OTOC). We numerically study the information…

In the study of dynamical processes on networks, there has been intense focus on network structure -- i.e., the arrangement of edges and their associated weights -- but the effects of the temporal patterns of edges remains poorly…

Building on the line of work [DIRT15a], [DIRT15b], [NS17a], [DT17], [HLS18], [HS18] we continue the study of particle systems with singular interaction through hitting times. In contrast to the previous research, we (i) consider very…

Particles suspended in a viscous fluid circle in optical vortices generated by holographic optical-tweezer techniques [Curtis J E and Grier D G 2003 Phys. Rev. Lett. 90 133901]. We model this system and show that hydrodynamic interactions…

Consider a sequence of possibly random graphs $G_N=(V_N, E_N)$, $N\ge 1$, whose vertices's have i.i.d. weights $\{W^N_x : x\in V_N\}$ with a distribution belonging to the basin of attraction of an $\alpha$-stable law, $0<\alpha<1$. Let…

Increased attention has been paid over the last four years to dynamic network embedding. Existing dynamic embedding methods, however, consider the problem as limited to the evolution of a topology over a sequence of global, discrete states.…

We undertake a detailed analysis of ergodicity for homogeneous discrete-time quantum walks on the integer lattice. The most significant result of our paper holds in dimension one, and gives a complete equivalence between the absolutely…

We study ergodic properties of one-dimensional Brownian motion with resetting. Using generic classes of statistics of times between resets, we find respectively for thin/fat tailed distributions, the normalized/non-normalised invariant…

We study the metastable behaviour of a stochastic system of particles with hard-core interactions in a high-density regime. Particles sit on the vertices of a bipartite graph. New particles appear subject to a neighbourhood exclusion…

The node-averaged complexity of a distributed algorithm running on a graph $G=(V,E)$ is the average over the times at which the nodes $V$ of $G$ finish their computation and commit to their outputs. We study the node-averaged complexity for…

We propose a one-way coupled model that tracks individual primary particles in a conceptually simple cellular flow setup to predict flocculation in turbulence. This computationally efficient model accounts for Stokes drag, lubrication,…

The purpose of this paper is to study the time average behavior of Markov chains with transition probabilities being kernels of completely continuous operators, and therefore to provide a sufficient condition for a class of Markov chains…

We present experimental observations of the velocity and spatial distribution of inertial particles dispersed in the turbulent downward flow through a vertical channel at $Re_{\tau} = 235$ and $335$. The working fluid is air laden with…

We study measurement-induced nonlinear dynamics generated by an iterated quantum protocol combining an entangling gate, a single-qubit rotation, and post-selection. For pure single-qubit inputs, a particular choice of the single-qubit…

We investigate the motion of heavy particles with a diameter of several multiples of the Kolmogorov length scale in the presence of forced turbulence and gravity, resorting to interface-resolved DNS based on an IBM. The values of the…

In this expository note, we study several families of periodic graphs which satisfy a sufficient condition for the ergodicity of the associated continuous-time quantum walk. For these graphs, we compute the limiting distribution of the walk…

The stochastic dynamics of an active particle undergoing a constant speed and additionally driven by an overall fluctuating torque is investigated. The random torque forces are expressed by a stochastic differential equation for the angular…

In this work, we investigate a simple nonequilibrium system with many interconnected, open subsystems, each exchanging a globally conserved resource with an external reserve. The system is represented by a random graph, where nodes…

Analytical description of propagation phenomena on random networks has flourished in recent years, yet more complex systems have mainly been studied through numerical means. In this paper, a mean-field description is used to coherently…

Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…