Related papers: Density Classification Quality of the Traffic-majo…
A probabilistic cellular automaton for cargo transport is presented that generalizes the totally asymmetric exclusion process with a defect from continuous time to parallel dynamics. It appears as an underlying principle in cellular…
Microscopic traffic models have recently gained considerable importance as a mean of optimising traffic control strategies. Computationally efficient and sufficiently accurate microscopic traffic models have been developed based on the…
We explore some aspects of phase transitions in cellular automata. We start recalling the standard formulation of statistical mechanics of discrete systems (Ising model), illustrating the Monte Carlo approach as Markov chains and stochastic…
The model of cellular automata is fascinating because very simple local rules can generate complex global behaviors. The relationship between local and global function is subject of many studies. We tackle this question by using results on…
Cellular traffic prediction is of great importance for operators to manage network resources and make decisions. Traffic is highly dynamic and influenced by many exogenous factors, which would lead to the degradation of traffic prediction…
The traffic-like collective movement of ants on a trail can be described by a stochastic cellular automaton model. We have earlier investigated its unusual flow-density relation by using various mean field approximations and computer…
A two-dimensional cellular automaton is introduced to model the flow and jamming of vehicular traffic in cities. Each site of the automaton represents a crossing where a finite number of cars can wait approaching the crossing from each of…
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…
Simple cellular automata models are able to reproduce the basic properties of highway traffic. The comparison with empirical data for microscopic quantities requires a more detailed description of the elementary dynamics. Based on existing…
We suggest a disordered traffic flow model that captures many features of traffic flow. It is an extension of the Nagel-Schreckenberg (NaSch) stochastic cellular automata for single line vehicular traffic model. It incorporates random…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
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…
Although traffic simulations with cellular-automata models give meaningful results compared with empirical data, highway traffic requires a more detailed description of the elementary dynamics. Based on recent empirical results we present a…
The main contribution reported in the paper is a novel paradigm through which mobile cellular traffic forecasting is made substantially more accurate. Specifically, by incorporating freely available road metrics we characterise the data…
Emergence of various types of services has brought about explosive growth of traffic as well as diversified traffic characteristics in the cellular networks. To have a comprehensive understanding of the influences caused by various traffic…
In recent works, we have proposed a stochastic cellular automaton model of traffic flow connecting two exactly solvable stochastic processes, i.e., the Asymmetric Simple Exclusion Process and the Zero Range Process, with an additional…
Stochastic finite automata arise naturally in many language and speech processing tasks. They include stochastic acceptors, which represent certain probability distributions over random strings. We consider the problem of efficient…
Cellular automata (CA) provide a minimal formalism for investigating how simple local interactions generate rich spatiotemporal behavior in domains as diverse as traffic flow, ecology, tissue morphogenesis and crystal growth. However,…
It has been shown that uniform as well as non-uniform cellular automata (CA) can be evolved to perform certain computational tasks. Random Boolean networks are a generalization of two-state cellular automata, where the interconnection…