Related papers: Dynamic Space Filling
Recently, diagrammatic extensions of dynamical mean field theory (DMFT) have been proposed for including short- and long-range correlations beyond DMFT on an equal footing. We employ one of these, the dynamical vertex approximation…
Particle Flow Filters estimate the ``a posteriori" probability density function (PDF) by moving an ensemble of particles according to the likelihood. Particles are propagated under the system dynamics until a measurement becomes available…
We consider the overdamped dynamics of a paradigmatic long-range system of particles residing on the sites of a one-dimensional lattice, in the presence of thermal noise. The internal degree of freedom of each particle is a periodic…
We present experimental results on the single file motion of a group of robots interacting with each other through position sensors. We successfully replicate the fundamental diagram typical of these systems, with a transition from free…
Turbulent magnetic fields are to some extent a universal feature in astrophysical phenomena. Charged particles that encounter these turbulence get on average accelerated according to the so-called second-order Fermi process. However, in…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. In subsequent time steps, all…
We study synchronization in the XX qubit chain subject to local or multi-local amplitude-damping noise. Analyzing the decoherence-free subspace (DFS) structure of the model, we show that it is completely determined by a simple…
In this paper we investigate cosmological dynamics on the normal branch of a DGP-inspired scenario within a phase space approach where induced gravity is modified in the spirit of $f(R)$-theories. We apply the dynamical system analysis to…
Graph burning is a discrete-time process on graphs, where vertices are sequentially burned, and burned vertices cause their neighbours to burn over time. We consider extremal properties of this process in the new setting where the…
In the sandpile model, vertices of a graph are allocated grains of sand. At each unit of time, a grain is added to a randomly chosen vertex. If that causes its number of grains to exceed its degree, that vertex is called unstable, and…
A \emph{complete geometric graph} consists of a set $P$ of $n$ points in the plane, in general position, and all segments (edges) connecting them. It is a well known question of Bose, Hurtado, Rivera-Campo, and Wood, whether there exists a…
We investigate the dynamics of two interacting diffusing particles in an infinite effectively one dimensional system; the particles interact through a step-like potential of width b and height phi_0 and are allowed to pass one another. By…
A graph $d$-process starts with an empty graph on $n$ vertices, and adds one edge at each time step, chosen uniformly at random from those pairs which are not yet edges and whose both vertices have current degree less than $d$. If, in the…
A dynamically transversely trapping surface (DTTS) is a new concept of an extension of a photon sphere that appropriately represents a strong gravity region and has close analogy with a trapped surface. We study formation of a marginally…
Generative diffusion models have achieved remarkable success in producing high-quality images. However, these models typically operate in continuous intensity spaces, diffusing independently across pixels and color channels. As a result,…
The long time dynamics of large particles trapped in two inhomogeneous turbulent shear flows is studied experimentally. Both flows present a common feature, a shear region that separates two colliding circulations, but with different…
We study a lattice gas of persistent walkers, in which each site is occupied by at most one particle and the direction each particle attempts to move to depends on its last step. We analyse the mean squared displacement (MSD) of the…
A geometric graph associated with a set of points $P= \{x_1, x_2, \cdots, x_n \} \subset \mathbb{R}^d$ and a fixed kernel function $\mathsf{K}:\mathbb{R}^d\times \mathbb{R}^d\to\mathbb{R}_{\geq 0}$ is a complete graph on $P$ such that the…
We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…
We analyze the structure and dynamics in the low-density phase of the deterministic two-dimensional cellular automaton model of traffic flow introduced in [O. Biham, A.A. Middleton and D. Levine, Phys. Rev. A 46, R6124 (1992)]. The model…