12 steps wm1743wm1743 signature 1213→2223 rule {{{1, 2, 3}, {4, 1}} -> {{1, 4, 5}, {6, 5, 3}, {5, 2}, {6, 1}}} {{{1, 2, 3}, {4, 1}} -> {{1, 4, 5}, {6, 5, 3}, {5, 2}, {6, 1}}}
make editable copy download notebook Basic EvolutionBasic evolution:[◼]WolframModel[{{{1,2,3},{4,1}}{{1,4,5},{6,5,3},{5,2},{6,1}}},{{1,1,1},{1,1}},6,"StatesPlotsList"],,,,,,Event-by-event evolution:[◼]WolframModel[{{{1,2,3},{4,1}}{{1,4,5},{6,5,3},{5,2},{6,1}}},{{1,1,1},{1,1}},<|"MaxEvents"6|>,"EventsStatesPlotsList"],,,,,,Vertex and edge counts:{vertexCountList,edgeCountList}=[◼]WolframModel[{{{1,2,3},{4,1}}{{1,4,5},{6,5,3},{5,2},{6,1}}},{{1,1,1},{1,1}},27,{"VertexCountList","EdgeCountList"}];ListLogPlot{vertexCountList,edgeCountList},verticesedgesSymbolic expression for vertex count:FindSequenceFunction[vertexCountList,t]DifferenceRootFunction{y.,n.},3-y.[n.]-y.[2+n.]+y.[3+n.]0,y.[1]1,y.[2]3,y.[3]5,y.[4]7,y.[5]9,y.[6]13[t]Symbolic expression for edge count:FindSequenceFunction[edgeCountList,t]DifferenceRootFunction{y.,n.},4-y.[n.]-y.[2+n.]+y.[3+n.]0,y.[1]2,y.[2]4,y.[3]6,y.[4]8,y.[5]10,y.[6]14[t]Result after 12 generations:WolframModel[]["FinalStatePlot"]Causal GraphCausal graph:WolframModel[]"CausalGraph",Rule[]Layered rendering:WolframModel[]["LayeredCausalGraph"]Causal graph distance matrix:MatrixPlotTransposeGraphDistanceMatrixWolframModel[]["CausalGraph"],Final State PropertiesHypergraph adjacency matrix:MatrixPlotAdjacencyMatrix@CatenateMapUndirectedEdge@@@Subsets[#,{2}]&,WolframModel[]["FinalState"],Vertex degree distribution:HistogramValuesCountsCatenateUnion/@WolframModel[]["FinalState"],Neighborhood volumes (ignoring directedness of connections):volumes=[◼]RaggedMeanAroundValues[◼]HypergraphNeighborhoodVolumesWolframModel[]["FinalState"],All,Automatic;ListLogLogPlotvolumes,Effective dimension versus radius:ListLinePlot[◼]LogDifferences[volumes],Successive neighborhood balls around a random vertex: [◼]HypergraphNeighborhoodsWolframModel[]["FinalState"],4,,,Distance matrix:distanceMatrix=GraphDistanceMatrixUndirectedGraph[◼]HypergraphToGraphWolframModel[]["FinalState"];MatrixPlotExp[-(distanceMatrix/.0None)],Distribution of distances in the graph:HistogramFlatten[distanceMatrix],Spreading of EffectsCausal graph adjacency matrix:MatrixPlotAdjacencyMatrixWolframModel[]["CausalGraph"],Neighborhood volumes in causal graph:ListLogLogPlotValues[◼]GraphNeighborhoodVolumesWolframModel[]["CausalGraph"],{1},Other Evolution OrdersRandom evolutions:[◼]WolframModel[{{{1,2,3},{4,1}}{{1,4,5},{6,5,3},{5,2},{6,1}}},{{1,1,1},{1,1}},<|"MaxEvents"70|>,"FinalStatePlot","EventOrderingFunction""Random"]Different deterministic evolution orders:[◼]WolframModel[{{{1,2,3},{4,1}}{{1,4,5},{6,5,3},{5,2},{6,1}}},{{1,1,1},{1,1}},<|"MaxEvents"70|>,"EventOrderingFunction"{#,"LeastRecentEdge","RuleOrdering","RuleIndex"}]["FinalStatePlot",PlotLabel#]&/@{"OldestEdge","LeastOldEdge","LeastRecentEdge","NewestEdge","RuleOrdering","ReverseRuleOrdering"},,,,,Graph Features of Statesgraph=[◼]HypergraphToGraphWolframModel[]["FinalState"];HistogramClosenessCentrality[graph],Cycle properties:EdgeCycleMatrix[UndirectedGraph[graph]]//MatrixPlotHistogram[Length/@FindFundamentalCycles[UndirectedGraph[graph]]]FindSpanningTree[UndirectedGraph[graph]]