In the beginning was a graph, more like diamond than graphite. Every node in this graph was tetravalent: connected by four edges to four other nodes. By a count of edges, the shortest path from any node back to itself was a loop six edges long. Every node belonged to twenty-four such loops, as well as forty-eight loops eight edges long, and four hundred eighty that were ten edges long. The edges had no length or shape, the nodes no position; the graph consisted only of the fact that some nodes were connected to others. This pattern of connections, repeated endlessly, was all there was.
Intro to Schild's Ladder by Greg Egan. He was obviously thinking along similar lines.