Pablo Concha-Vega

collaborators

5 papers

cs.CC2026

Non-Uniform and Weighted Crossing Gates in Two-Dimensional Sandpiles

Pablo Concha-Vega, Antonin LoubiÃ¨re, KÃ©vin Perrot

Determining whether predicting two-dimensional sandpiles lies in $NC$ or is $P$ -complete has been open for decades. Moore and Nilsson proved $P$ -complete…

cs.CC2026

Local Homophily on Bicolored Graphs is $P$ -complete

Pablo Concha-Vega

We propose a local transformation on bicolored graphs, which we call local homophily, inspired by adaptive networks and based on majority dynamics and homophily. In this transforma…

cs.CC2025

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods

Pablo Concha-Vega, Eric Goles, Pedro Montealegre +1

In this article we investigate the computational complexity of predicting two dimensional freezing majority cellular automata with states ${- 1, + 1}$ , where the local interactions…

cs.CC2025

Is Graph Local Complementation Inherently Sequential?

Pablo Concha-Vega

Local complementation of a graph $G$ on vertex $v$ is an operation that results in a new graph $G * v$ , where the neighborhood of $v$ is complemented. Two graph are locally equivalen…

cs.CC2025

Timed Prediction Problem for Sandpile Models

We investigate the computational complexity of the timed prediction problem in two-dimensional sandpile models. This question refines the classical prediction problem, which asks w…

Non-Uniform and Weighted Crossing Gates in Two-Dimensional Sandpiles

Local Homophily on Bicolored Graphs is P-complete

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods

Is Graph Local Complementation Inherently Sequential?

Timed Prediction Problem for Sandpile Models

Local Homophily on Bicolored Graphs is $P$ -complete