Related papers: Lattice Gas Automata for Reactive Systems
Lattice gas algorithms (LGA) are a class of algorithms including, in chronological order, binary lattice gas cellular automata (LGCA), integer lattice gas algorithms (ILGA) and lattice Boltzmann method (LBM). They are largely used for…
The recent development of the lattice gas automata method and its extension to the lattice Boltzmann method have provided new computational schemes for solving a variety of partial differential equations and modeling chemically reacting…
We introduce the first extension of a Lattice Gas Automaton (LGA) model to accurately replicate observed emergent phenomena in granular materials with a special focus on previously unexplored jamming transitions by incorporating…
A periodic Kolmogorov type flow is implemented in a lattice gas automaton. For given aspect ratios of the automaton universe and within a range of Reynolds number values, the averaged flow evolves towards a stationary two-dimensional $ABC$…
We present an extension of a simple automaton model to incorporate non-local interactions extending over a spatial range in lattice gases. {}From the viewpoint of Statistical Mechanics, the lattice gas with interaction range may serve as a…
The past two decades showed a rapid growing of physically-based modeling of fluids for computer graphics applications. In this area, a common top down approach is to model the fluid dynamics by Navier-Stokes equations and apply a numerical…
Lattice Gas Automata (LGA) is a classical method for simulating physical phenomena, including Computational Fluid Dynamics (CFD). Quantum LGA (QLGA) is the family of methods that implement LGA schemes on quantum computers. In recent years,…
We review the class of cellular automata known as lattice gases, and their applications to problems in physics and materials science. The presentation is self-contained, and assumes very little prior knowledge of the subject. Hydrodynamic…
Classical lattice gas automata effectively simulate physical processes such as diffusion and fluid flow (in certain parameter regimes) despite their simplicity at the microscale. Motivated by current interest in quantum computation we…
Both cellular automata (CA) and lattice-gas automata (LG) provide finite algorithmic presentations for certain classes of infinite dynamical systems studied by symbolic dynamics; it is customary to use the term `cellular automaton' or…
A kinetic description of lattice-gas automaton models for reaction-diffusion systems is presented. It provides corrections to the mean-field rate equations in the diffusion-limited regime. When applied to the two-species Maginu model, the…
Integer lattice gas automata can be utilized as building blocks in statistical mechanics. The presented deterministic and reversible automaton generates semiclassical statistical distributions. A possible approach to Bose-Einstein…
Building upon the Integer Lattice Gas Automata framework of Blommel \textit{et al.} \cite{PhysRevE.97.023310}, we introduce a simplified, fluctuation-free variant. This approach relies on floating-point numbers and closely mirrors the…
Various lattice gas automata have been proposed in the past decades to simulate physics and address a host of problems on collective dynamics arising in diverse fields. In this work, we employ the lattice gas model defined on the sphere to…
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
We present an analysis of diffusion in terms of the spontaneous density fluctuations in a non-thermal two-species fluid modeled by a lattice gas automaton. The power spectrum of the density correlation function is computed with statistical…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
Layered Cellular Automata (LCA) extends the concept of traditional cellular automata (CA) to model complex systems and phenomena. In LCA, each cell's next state is determined by the interaction of two layers of computation, allowing for…
Cellular automata (CA) are a class of computational models that exhibit rich dynamics emerging from the local interaction of cells arranged in a regular lattice. In this work we focus on a generalised version of typical CA, called graph…
The rate-limiting step of some enzymatic reactions is a physical step, i.e. diffusion. The efficiency of such reactions can be improved through an increase in the arrival rate of the substrate molecules, e.g. by a directed passage of…