Timed Prediction Problem for Sandpile Models

2025-06-26

AI Summary

This paper investigates the computational complexity of the “temporal prediction” problem in two-dimensional sandpile models: given an initial configuration, determine whether adding a grain at position $p$ causes position $q$ to become unstable *for the first time* precisely at time $t$. Unlike classical stability prediction, this problem imposes exact temporal constraints, and we establish the first systematic framework for temporal analysis across von Neumann, Moore, and general planar neighborhoods. Using monotone circuit simulation and neighborhood-structure analysis, we construct and characterize the realizability of “temporal cross gates.” Our results reveal fundamental distinctions among neighborhoods in temporal cross capability and synchronizability: the Moore neighborhood admits a complete temporal toolkit, rendering the problem P-complete; the von Neumann neighborhood supports temporal crossing but suffers from inherent synchronization bottlenecks; and no planar neighborhood—beyond Moore—can realize temporal crossing.

Technology Category

• Planning, Routing, and Scheduling: Temporal Planning
• Knowledge Representation and Reasoning: Geometric, Spatial, and Temporal Reasoning
• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories

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 heterogeneous, signed, attributed, multi-relational, temporal, higher-order, and annotated Web-related graphs
• Web Mining and Content Analysis: Models for Web evolution

Abstract

We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks whether a cell q will eventually become unstable after adding a grain at cell p from a given configuration. The prediction problem has been shown to be P-complete in several settings, including for subsets of the Moore neighborhood, but its complexity for the von Neumann neighborhood remains open. In a previous work, we provided a complete characterization of crossover gates (a key to the implementation of non-planar monotone circuits) for these small neighborhoods, leading to P-completeness proofs with only 4 and 5 neighbors among the eight adjancent cells. In this paper, we introduce the timed setting, where the goal is to determine whether cell q becomes unstable exactly at time t. We distinguish several cases: some neighborhoods support complete timed toolkits (including timed crossover gates) and exhibit P-completeness; others admit timed crossovers but suffer from synchronization issues; planar neighborhoods provably do not admit any timed crossover; and finally, for some remaining neighborhoods, we conjecture that no timed crossover is possible.

Problem

• Investigates timed prediction complexity in 2D sandpile models
• Determines if cell q becomes unstable at exact time t
• Analyzes neighborhoods for timed crossovers and P-completeness

Innovation

• Investigates timed prediction in sandpile models
• Characterizes crossover gates for small neighborhoods
• Distinguishes cases for timed crossover feasibility