相关论文: Ergodic Effects in Token Circulation

We investigate a generalised version of the recently proposed ordinal partition time series to network transformation algorithm. Firstly we introduce a fixed time lag for the elements of each partition that is selected using techniques from…

We consider a process on $\mathbb{T}^2$, which consists of fast motion along the stream lines of an incompressible periodic vector field perturbed by white noise. It gives rise to a process on the graph naturally associated to the structure…

Statistical mechanics is founded on the assumption that all accessible configurations of a system are equally likely. This requires dynamics that explore all states over time, known as ergodic dynamics. In isolated quantum systems, however,…

We address the problem of testing whether a given dynamic graph is temporally connected, {\it i.e} a temporal path (also called a {\em journey}) exists between all pairs of vertices. We consider a discrete version of the problem, where the…

The dynamics of one dimensional iterative maps in the regime of fully developed chaos is studied in detail. Motivated by the observation of dynamical structures around the unstable fixed point we introduce the geometrical concept of a…

The article deals with the description of the statistical behavior of Gaussian packets on a metric graph. Semiclassical asymptotics of solutions of the Cauchy problem for the Schr\"{o}dinger equation with initial data concentrated in the…

In this two-part paper, we consider multicomponent systems in which each component can iteratively exchange information with other components in its neighborhood in order to compute, in a distributed fashion, the average of the components'…

Random quantum circuits yield minimally structured models for chaotic quantum dynamics, able to capture for example universal properties of entanglement growth. We provide exact results and coarse-grained models for the spreading of…

This paper considers generalised network, intended as networks where (a) the edges connecting the nodes are nonlinear, and (b) stochastic processes are continuously indexed over both vertices and edges. Such topological structures are…

Conventional modelling of networks evolving in time focuses on capturing variations in the network structure. However, the network might be static from the origin or experience only deterministic, regulated changes in its structure,…

We prove H\"{o}lder regularity for the trajectories of an interacting particle system. The particle velocities are given by the nonlocal and singular interactions with the other particles. Particle collisions occur in finite time. Prior to…

A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often (with ties broken randomly). The properties of self-repelling random walks have been analyzed…

The tacnode process is a universal behavior arising in nonintersecting particle systems and tiling problems. For Dyson Brownian bridges, the tacnode process describes the grazing collision of two packets of walkers. We consider such a Dyson…

Thermalization and scrambling are the subject of much recent study from the perspective of many-body quantum systems with locally bounded Hilbert spaces (`spin chains'), quantum field theory and holography. We tackle this problem in 1D…

We study the motion of independent particles in a dynamical random environment on the integer lattice. The environment has a product distribution. For the multidimensional case, we characterize the class of spatially ergodic invariant…

We consider random walks on dynamical networks where edges appear and disappear during finite time intervals. The process is grounded on three independent stochastic processes determining the walker's waiting-time, the up-time and down-time…

We analyze a token-based Brownian circuit in which Brownian particles, coined `tokens,' move randomly by exploiting thermal fluctuations, searching for a path in multi-token state space corresponding to the solution of a given problem. The…

We address the problem of testing whether a dynamic graph is temporally connected, i.e. a temporal path ({\em journey}) exists between all pairs of vertices. We consider a discrete version of the problem, where the topology is given as an…

We study a system of $N$ interacting particles on $\bf{Z}$. The stochastic dynamics consists of two components: a free motion of each particle (independent random walks) and a pair-wise interaction between particles. The interaction belongs…

We study a simple stochastic differential equation that models the dispersion of close heavy particles moving in a turbulent flow. In one and two dimensions, the model is closely related to the one-dimensional stationary Schroedinger…