activity
20242026
most citedCounting and Hardness-of-Finding Fixed Points in Cellular Automata on Random Graphs

5 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2025Show all

2 papers · 1 filter

cond-mat.dis-nn2025

Minority Takeover in Majority Dynamics: Searching for Rare Initializations via the History Passing Algorithm

Marek Jankola, Freya Behrens, Cédric Koller +1

We investigate how much bias in the initial configuration is required to drive global agreement in synchronous, deterministic majority dynamics on large random -regular graphs.…

nlin.CG2025

Counting Short Trajectories in Elementary Cellular Automata using the Transfer Matrix Method

Cédric Koller, Barbora Hudcová

Elementary Cellular Automata (ECAs) exhibit diverse behaviours often categorized by Wolfram's qualitative classification. To provide a quantitative basis for understanding these be…