English
Related papers

Related papers: Directed percolation conjecture for cellular autom…

200 papers

Scale-invariant universal crossing probabilities are studied for critical anisotropic systems in two dimensions. For weakly anisotropic standard percolation in a rectangular-shaped system, Cardy's exact formula is generalized using a…

Statistical Mechanics · Physics 2007-05-23 L. Turban

Directed percolation is one of the most prominent universality classes of nonequilibrium phase transitions and can be found in a large variety of models. Despite its theoretical success, no experiment is known which clearly reproduces the…

Statistical Mechanics · Physics 2015-06-25 Haye Hinrichsen

In many interacting particle systems, relaxation to equilibrium is thought to occur via the growth of 'droplets', and it is a question of fundamental importance to determine the critical length at which such droplets appear. In this paper…

Probability · Mathematics 2023-08-22 Paul Balister , Béla Bollobás , Robert Morris , Paul Smith

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…

Cellular Automata and Lattice Gases · Physics 2025-10-07 Martin Schaller , Karl Svozil

While for standard percolation directionality is known to increase the combinatorial complexity of percolation, here we show that when connectivity is ensured by paths of length $R\geq 2$, network directionality, impeding backtracking, can…

Disordered Systems and Neural Networks · Physics 2026-05-26 Wenbo Liu , Yiwen Zeng , Xueming Liu , Ginestra Bianconi

Cellular Automata are discrete--time dynamical systems on a spatially extended discrete space which provide paradigmatic examples of nonlinear phenomena. Their stochastic generalizations, i.e., Probabilistic Cellular Automata, are discrete…

Statistical Mechanics · Physics 2016-07-06 Emilio N. M. Cirillo , Francesca R. Nardi , Cristian Spitoni

We study a non-ergodic one-dimensional probabilistic cellular automata, where each component can assume the states $\+$ and $\-.$ We obtained the limit distribution for a set of measures on $\{\+,\-\}^\Z.$ Also, we show that for certain…

Mathematical Physics · Physics 2014-12-15 A. D. Ramos

This paper considers a class of probabilistic cellular automata undergoing a phase transition with an absorbing state. Denoting by ${\mathcal{U}}(x)$ the neighbourhood of site $x$, the transition probability is $T(\eta_x = 1 |…

Mathematical Physics · Physics 2015-05-19 Lorenzo Taggi

The values obtained experimentally for the conductivity critical exponent in numerous percolation systems, in which the interparticle conduction is by tunnelling, were found to be in the range of $t_0$ and about $t_0+10$, where $t_0$ is the…

Disordered Systems and Neural Networks · Physics 2009-11-11 C. Grimaldi , I. Balberg

A $(1+1)$ dimensional model of directed percolation is introduced where sites on a tilted square lattice are connected to their neighbours by $N$ channels, operated at both ends by valves which are either open or closed. The spreading fluid…

Statistical Mechanics · Physics 2010-10-12 Urna Basu , Mahashweta Basu , P. K. Mohanty

Number-conserving (or {\em conservative}) cellular automata have been used in several contexts, in particular traffic models, where it is natural to think about them as systems of interacting particles. In this article we consider several…

Cellular Automata and Lattice Gases · Physics 2007-05-23 Andres Moreira , Nino Boccara , Eric Goles

We present a unifying, consistent, finite-size-scaling picture for percolation theory bringing it into the framework of a general, renormalization-group-based, scaling scheme for systems above their upper critical dimensions $d_c$.…

Statistical Mechanics · Physics 2017-05-16 Ralph Kenna , Bertrand Berche

We consider the following oriented percolation model of $\mathbb {N} \times \mathbb{Z}^d$: we equip $\mathbb {N}\times \mathbb{Z}^d$ with the edge set $\{[(n,x),(n+1,y)] | n\in \mathbb {N}, x,y\in \mathbb{Z}^d\}$, and we say that each edge…

Probability · Mathematics 2012-02-08 Hubert Lacoin

Crossover behaviors from the pair contact process with diffusion (PCPD) and the driven PCPD (DPCPD) to the directed percolation (DP) are studied in one dimension by introducing a single particle annihilation/branching dynamics. The…

Statistical Mechanics · Physics 2007-05-23 Su-Chan Park , Hyunggyu Park

The evolution of many kinetic processes in 1+1 (space-time) dimensions results in 2d directed percolative landscapes. The active phases of these models possess numerous hidden geometric orders characterized by various types of large-scale…

Statistical Mechanics · Physics 2016-01-13 P. N. Timonin , Gennady Y. Chitov

Here we compare critical properties of systems in the directed-percolation (DP) universality class with those of absorbing-state phase transitions occurring in the presence of a non-diffusive conserved field, i.e. transitions in the…

Statistical Mechanics · Physics 2009-11-13 Juan A. Bonachela , Miguel A. Munoz

The percolation, Ising, and O($n$) models constitute fundamental systems in statistical and condensed matter physics. For short-range-interacting cases, the nature of their phase transitions is well established by renormalization-group…

Statistical Mechanics · Physics 2026-01-21 Tianning Xiao , Zhijie Fan , Youjin Deng

A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…

Cellular Automata and Lattice Gases · Physics 2012-03-20 Vladimir Garcia-Morales

A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.

Cellular Automata and Lattice Gases · Physics 2012-06-12 Daniel B. Miller , Edward Fredkin

The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…

Discrete Mathematics · Computer Science 2010-09-17 Eric Goles Chacc , Pierre-Etienne Meunier , Ivan Rapaport , Guillaume Theyssier