# Game of Life on Graphs

arXiv: https://arxiv.org/abs/2111.01780 · HTML: https://mlsanity.com/paper/2111.01780/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 2 Nov 2021.

## Built on by (most cited first, 1 of 1)

- [Data-Centric Approach to Constrained Machine Learning: A Case Study on Conway's Game of Life](https://mlsanity.com/paper/2408.12778/) (2024)

## Abstract (arXiv)

We consider a specific graph dynamical system inspired by the famous Conway's Game of Life in this work. We study the properties of the dynamical system on different graphs and introduce a new efficient heuristic for graph isomorphism testing. We use the evolution of our system to extract features from a graph in a deterministic way and observe that the extracted features are unique and the distance induced by that features satisfy triangle inequality for all connected graphs with up to ten vertices.