Related papers: Dynamic Space Filling
We use a hybrid Monte Carlo algorithm to simulate the shaking of spheres at different vibrational amplitudes, and find that spontaneous crystallisation occurs in specific dynamical regimes. Several crystallising transitions are typically…
Sequential dynamical systems (SDS) are used to model a wide range of processes occurring on graphs or networks. The dynamics of such discrete dynamical systems is completely encoded by their phase space, a directed graph whose vertices and…
Let $G$ be a graph and ${\mathcal{\tau}}: V(G)\rightarrow \Bbb{N}\cup \{0\}$ be an assignment of thresholds to the vertices of $G$. A subset of vertices $D$ is said to be a dynamic monopoly corresponding to $(G, \tau)$ if the vertices of…
Diffusion can be conceptualized, at microscopic scales, as the random hopping of particles between neighboring lattice sites. In the case of diffusion in inhomogeneous media, distinct spatial domains in the system may yield distinct…
Phase transitions are a fundamental concept in science describing diverse phenomena ranging from, e.g., the freezing of water to Bose-Einstein condensation. While the concept is well-established in equilibrium, similarly fundamental…
This paper is a continuation of the study [Chaos.22.033134] of the relation between the stochastic dynamical systems (DS) and the Witten-type topological field theories (TFT). Here, it is discussed that stochastic expectation values of a DS…
Scanning tunneling microscopy (STM) and spectroscopy (STS) in combination with density functional theory (DFT) calculations are employed to study the surface and subsurface properties of the metastable phase of the phase change material…
A stochastic approach to the filling dynamics of an open topology porous structure permeated with a perfectly wetting fluid is presented. From the discrete structure of the disordered voids network with only nearest neighbors links, we…
We present the theoretical analysis of the steady state currents and density distributions of particles moving with Langevin dynamics, under the effects of an external potential displaced at constant rate. The Dynamic Density Functional…
We study a system of particles moving on a line in the same direction. Passing is allowed and when a fast particle overtakes a slow particle, it acquires a new velocity drawn from a distribution P_0(v), while the slow particle remains…
We study a one-dimensional totally asymmetric simple exclusion process with one special site from which particles fly to any empty site (not just to the neighboring site). The system attains a non-trivial stationary state with density…
We consider a general framework for multi-type interacting particle systems on graphs, where particles move one at a time by random walk steps, different types may have different speeds, and may interact, possibly randomly, when they meet.…
Non-integrability in the sense of dynamical systems, also known as dynamical chaos, is a strongly nonlinear qualitative phenomenon. Its most promising theoretical descriptions are likely to emerge from non-perturbative approaches, with…
Many dynamic networks coming from real-world contexts are link streams, i.e. a finite collection of triplets $(u,v,t)$ where $u$ and $v$ are two nodes having a link between them at time $t$. A very large number of studies on these objects…
Stochastic mass transport models are usually described by specifying hopping rates of particles between sites of a given lattice, and the goal is to predict the existence and properties of the steady state. Here we ask the reverse question:…
We explore the dynamics of a tracer in an active particle harmonic chain, investigating the influence of interactions. Our analysis involves calculating mean-squared displacements (MSD) and space-time correlations through Green's function…
The dynamical properties of finite dynamical systems (FDSs) have been investigated in the context of coding theoretic problems, such as network coding and index coding, and in the context of hat games, such as the guessing game and…
We present a comprehensive description of vector chromatography that includes deterministic and stochastic transport in 1D-periodic free-energy landscapes, with both energetic and entropic contributions, and highlights the parameters…
We study the evolution of graphs densifying by adding edges: Two vertices are chosen randomly, and an edge is (i) established if each vertex belongs to a tree; (ii) established with probability $p$ if only one vertex belongs to a tree;…
Graph planning gives rise to fundamental algorithmic questions such as shortest path, traveling salesman problem, etc. A classical problem in discrete planning is to consider a weighted graph and construct a path that maximizes the sum of…