Universe 1743 from The Wolfram Physics Project

12 steps

wm1743`wm1743`

signature

1₂1₃→2₂2₃

rule

{{{1, 2, 3}, {4, 1}} -> {{1, 4, 5}, {6, 5, 3}, {5, 2}, {6, 1}}}

make editable copy
download notebook

Basic Evolution

Basic 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},

SequenceIcon



	vertices
	edges

Symbolic expression for vertex count:

FindSequenceFunction[vertexCountList,t]

DifferenceRootFunction{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]

DifferenceRootFunction{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

generations:

WolframModel[

]

["FinalStatePlot"]

Causal Graph

Causal graph:

WolframModel[

]

"CausalGraph",

Rule[

]



Layered rendering:

WolframModel[

]

["LayeredCausalGraph"]

Causal graph distance matrix:

MatrixPlotTransposeGraphDistanceMatrix

WolframModel[

]

["CausalGraph"],

ListIcon



Final State Properties

Hypergraph adjacency matrix:

MatrixPlotAdjacencyMatrix@CatenateMapUndirectedEdge@@@Subsets[#,{2}]&,

WolframModel[

]

["FinalState"],

ListIcon



Vertex degree distribution:

HistogramValuesCountsCatenateUnion/@

WolframModel[

]

["FinalState"],

ListIcon



Neighborhood volumes (ignoring directedness of connections):

volumes=

[◼]	RaggedMeanAround

Values

[◼]	HypergraphNeighborhoodVolumes



WolframModel[

]

["FinalState"],All,Automatic;

ListLogLogPlotvolumes,

ListIcon



Effective dimension versus radius:

ListLinePlot

[◼]	LogDifferences

[volumes],

ListIcon



Successive neighborhood balls around a random vertex:

[◼]	HypergraphNeighborhoods



WolframModel[

]

["FinalState"],4





Distance matrix:

distanceMatrix=GraphDistanceMatrixUndirectedGraph

[◼]	HypergraphToGraph



WolframModel[

]

["FinalState"];

MatrixPlotExp[-(distanceMatrix/.0None)],

ListIcon



Distribution of distances in the graph:

HistogramFlatten[distanceMatrix],

ListIcon



Spreading of Effects

Causal graph adjacency matrix:

MatrixPlotAdjacencyMatrix

WolframModel[

]

["CausalGraph"],

ListIcon



Neighborhood volumes in causal graph:

ListLogLogPlotValues

[◼]	GraphNeighborhoodVolumes



WolframModel[

]

["CausalGraph"],{1},

ListIcon



Other Evolution Orders

Random 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"}

