Environment and Planning B Planning and Design · 2001 · 105 citations · 33 references
ComputingGeographyDynamical SystemsSpatial AnalysisSpatial ModelingAutomata TheoryCellular AutomataComputational ModelsGraph TheorySpatial SimulationUrban Spatial StructureCellular Automata ClassificationCellular Automaton ModelingDiscrete ModelsDynamic Spatial AnalysisGraph-based Spatial ModelingModel Structure AnalysisModel Structure DesignProcess Dynamics Modeling
The authors introduce graph‑cellular automata (graph‑CA) as a new dynamic spatial model that integrates graph and cellular automaton formalisms to enable simultaneous use of established structural and process‑dynamics descriptions, proposing it as a foundation for future research into their interrelations. Graph‑CA is built upon the proximal model of space and geo‑algebra, reinterpreting these concepts within a graph framework, and is positioned relative to other discrete models with a proposed classification scheme highlighting its geographic relevance. Graph‑CA, with specific structural properties linking cell subsets, generalises traditional cellular automata, allowing meaningful model‑structure descriptions and facilitating the development of novel models within the same family while preserving connections to simpler, well‑understood examples.
A new type of dynamic spatial model is described: graph-cellular automatoa (graph-CA). First, the proximal model of space and geo-algebra are briefly introduced. Then, the graph-CA model is described, with an emphasis on understanding it as a reworking of the proximal model of space and also of geo-algebra. It is shown that graph-CA with particular structural properties defined in terms of the relationships between subsets of cells are a useful generalisation of traditional cellular automaton (CA) which enable meaningful descriptions of model structure to be developed. This enables further development of novel types of model in the same ‘family’ while retaining links to simpler, better understood examples. It is further argued that the derivation of the graph-CA from both the graph and CA formalisms permits the simultaneous use of well-developed ways of describing model structure and process dynamics, and that this could form the basis of a research programme into the elusive relations between the two. The relationship of graph-CA to other discrete models is briefly discussed, and a classification scheme which indicates the particular geographical interest of such models is suggested.
33
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Justice, Nature and the Geography of Difference
Kent Mathewson, David Harvey · Geographical Review · 1997 · 4.7K citations
Statistical mechanics of cellular automata
Stephen Wolfram · Reviews of Modern Physics · 1983 · 3.1K citations
Universality and complexity in cellular automata
Stephen Wolfram · Physica D Nonlinear Phenomena · 1984 · 1.9K citations
Computing, Mathematics, Algorithms +11