Complexity of the Freezing Majority Rule with L-shaped Neighborhoods

2025-09-19

AI Summary

This paper investigates the state prediction problem for two-dimensional frozen majority cellular automata (FMCAs) under L-shaped neighborhoods: given an initial configuration and time step $t$, determine whether a designated cell is in the $+1$ (permanently frozen) state after $t$ steps. Using computational complexity analysis and parallel algorithm design—leveraging the topological properties of L-shaped neighborhoods—we provide formal proofs of complexity-theoretic characterizations. We show that when the neighborhood size is exactly 2, the prediction problem is in NC, admitting an efficient parallel algorithm; however, it becomes P-complete for all other neighborhood sizes. This is the first result to identify neighborhood size as a critical parameter governing parallel tractability, rigorously establishing a sharp phase transition from NC to P-complete. Our work precisely delineates how local neighborhood structure constrains global computational power, revealing fundamental limits on parallel simulation of threshold-based collective dynamics.

Technology Category

• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Multiagent Systems: Other Foundations of Multi Agent Systems
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Social Networks and Social Media: Influence propagation, information diffusion, and the prediction on networks
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements

Abstract

In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states ${-1,+1}$, where the local interactions are based on an L-shaped neighborhood structure. In these automata, once a cell reaches state $+1$, it remains fixed in that state forever, while cells in state $-1$ update to the most represented state among their neighborhoods. We consider L-shaped neighborhoods, which mean that the vicinity of a given cell $c$ consists in a subset of cells in the north and east of $c$. We focus on the prediction problem, a decision problem that involves determining the state of a given cell after a given number of time-steps. We prove that when restricted to the simplest L-shaped neighborhood, consisting of the central cell and its nearest north and east neighbors, the prediction problem belongs to $mathsf{NC}$, meaning it can be solved efficiently in parallel. We generalize this result for any L-shaped neighborhood of size two. On the other hand, for other L-shaped neighborhoods, the problem becomes $mathsf{P}$-complete, indicating that the problem might be inherently sequential.

Problem

• Analyzing computational complexity of 2D freezing majority cellular automata
• Studying prediction problem for L-shaped neighborhood structures
• Determining parallel efficiency versus sequential completeness for automata

Innovation

• L-shaped neighborhood cellular automata
• Freezing majority rule prediction
• NC and P-complete complexity classification