Related papers: Application of a renormalization group algorithm t…
Numerical approaches are an important tool to study strongly correlated quantum systems. However, their fragility with respect to rounding errors is not well studied and numerically verified enclosures of the results are not available. In…
The tensor-entanglement renormalization group approach is applied to Hamiltonians that realize a class of topologically ordered states -- string-net condensed states. We analyze phase transitions between phases with and without string-net…
Reversible Probabilistic Cellular Automata are a special class of automata whose stationary behavior is described by Gibbs-like measures. For those models the dynamics can be trapped for a very long time in states which are very different…
We present a new hybrid multiconfigurational method based on the concept of range-separation that combines the density matrix renormalization group approach with density functional theory. This new method is designed for the simultaneous…
In recent years, various interacting particle samplers have been developed to sample from complex target distributions, such as those found in Bayesian inverse problems. These samplers are motivated by the mean-field limit perspective and…
Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid…
Cellular automata are fully-discrete, spatially-extended dynamical systems that evolve by simultaneously applying a local update function. Despite their simplicity, the induced global dynamic produces a stunning array of richly-structured,…
We present a 2-dimensional cellular automaton model for the simulation of pedestrian dynamics. The model is extremely efficient and allows simulations of large crowds faster than real time since it includes only nearest-neighbour…
In this paper, we propose a new approach for building cellular automata to solve real-world segmentation problems. We design and train a cellular automaton that can successfully segment high-resolution images. We consider a colony that…
We point out some limits of the perturbative renormalization group used in statistical mechanics both at and out of equilibrium. We argue that the non perturbative renormalization group formalism is a promising candidate to overcome some of…
We present an algorithm for the calculation of eigenstates with definite linear momentum in quantum lattices. Our method is related to the Density Matrix Renormalization Group, and makes use of the distribution of multipartite entanglement…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
A recently new intelligent optimization algorithm called discrete state transition algorithm is considered in this study, for solving unconstrained integer optimization problems. Firstly, some key elements for discrete state transition…
The proposed stochastic model for pedestrian dynamics is based on existing approaches using cellular automata, combined with substantial extensions, to compensate the deficiencies resulting of the discrete grid structure. This agent motion…
The influence of nonequilibrium initial values of the order parameter on its evolution at a critical point is described using a renormalization group approach of the field theory. The dynamic critical exponent $\theta'$ of the short time…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…
In complex systems with many degrees of freedom such as spin glass and biomolecular systems, conventional simulations in canonical ensemble suffer from the quasi-ergodicity problem. A simulation in generalized ensemble performs a random…
A block spin renormalization group approach is introduced which can be applied to dynamical triangulations in any dimension.