Related papers: Number Conservation via Particle Flow in One-dimen…
The particle-in-cell numerical method of plasma physics balances a trade-off between computational cost and intrinsic noise. Inference on data produced by these simulations generally consists of binning the data to recover the particle…
A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
Flow Matching (FM) is a simulation-free method for learning a continuous and invertible flow to interpolate between two distributions, and in particular to generate data from noise. Inspired by the variational nature of the diffusion…
Particle-In-Cell codes are widely used for plasma physics simulations. It is often the case that particles within a computational cell need to be split to improve the statistics or, in the case of non-uniform meshes, to avoid the…
A traffic model on an open one-dimensional lattice is considered. At any discrete time moment, with prescribed probability, a particle arrives to the leftmost cell of the lattice, and, with prescribed probability, the arriving particle…
The control of chaotic systems implies inducing an unpredictable system to follow a desired trajectory using the smallest "force". In low-dimensional continuous systems, one method is that of reconstructing the tangent space, so that the…
A new methodology is developed to integrate numerically the equations of motion for classical many-body systems in molecular dynamics simulations. Its distinguishable feature is the possibility to preserve, independently on the size of the…
The dynamics of a quantum particle bound by an accelerating delta-functional potential is investigated. Three cases are considered, using the reference frame moving along with the {\delta}-function, in which the acceleration is converted…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
The majority of available numerical algorithms for interfacial two-phase flows either treat both fluid phases as incompressible (constant density) or treat both phases as compressible (variable density). This presents a limitation for the…
Continent-scale datasets challenge hydrological algorithms for processing digital elevation models. Flow accumulation is an important input for many such algorithms; here, I parallelize its calculation. The new algorithm works on one or…
As flow estimators, multi-particle correlators, particularly the higher-order ones, are generally regarded as effective tools for suppressing non-flow contributions. In this work, however, using two well-known toy models that simulate…
We study a gas network flow regulation control problem showing the closed-loop consequences of using interconnected component models, which have been designed to preserve a variant of mass flow conservation without the inclusion of…
Graphical chip-firing is a discrete dynamical system where chips are placed on the vertices of a graph and exchanged via simple firing moves. Recent work has sought to generalize chip-firing on graphs to higher dimensions, wherein graphs…
The trace subshift of a cellular automaton is the subshift of all possible columns that may appear in a space-time diagram, ie the infinite sequence of states of a particular cell of a configuration; in the language of symbolic dynamics one…
The present research is devoted to the problem of stability of the fluid flow moving in a channel with flexible walls and interacting with the walls, which are subject to traveling waves. Experimental data shows that the energy of the…
Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…
The Cellular Potts Model (CPM) is a lattice based modeling technique which is widely used for simulating cellular patterns such as foams or biological tissues. Despite its realism and generality, the standard Monte Carlo algorithm used in…
The more we learn about the cytoplasm of cells, the more we realise that the cytoplasm is not uniform but instead is highly inhomogeneous. In any inhomogeneous solution, there are concentration gradients, and particles move either up or…