Multiple Rules (2) 

Multiple rules can be specified as a list of rules:

In[8]:=

Out[8]=

See which rules were used for each replacement:

In[9]:=

Out[9]=

Pattern Rules (2) 

Use explicit patterns to specify rules:

In[10]:=

Out[10]=

New vertices can be created with a Module:

In[11]:=

Out[11]=

Automatic Initial State (2) 

An initial state consisting of an appropriate number of (hyper) self-loops can be automatically produced for anonymous (non-pattern) rules:

In[12]:=

Out[12]=

That even works for multiple rules, in which case the loops are chosen in such a way that any of the rules can match:

In[13]:=

Out[13]=

Termination Criteria (4) 

Run for two complete generations:

In[14]:=

Out[14]=

Allow a total of four events:

In[15]:=

Out[15]=

Stop either after four events or when the state is about to exceed five vertices, whichever is sooner:

In[16]:=

Out[16]=

Stop once the maximum vertex degree is about to exceed 20:

In[17]:=

Out[17]=

Properties (20) 

"StatesList" yields the list of states at each generation:

In[18]:=

Out[18]=

Make the list of plots of all states:

In[19]:=

Out[19]=

"FinalState" yields the state obtained after all replacements of the evolution have been made:

In[20]:=

Out[20]=

Make the plot of the final state:

In[21]:=

Out[21]=

"StatesList" shows a compressed version of the evolution. To see how a state changes with each applied replacement, use "AllEventsStatesList":

In[22]:=

Out[22]=

"AllEventsList" returns all replacement events throughout the evolution:

In[23]:=

Out[23]=

"AllEventsRuleIndices" returns which rule was used for each event:

In[24]:=

Out[24]=

"EventsStatesList" just produces a list of {event,state} pairs, where state is the complete state right after this event is applied:

In[25]:=

Out[25]=

"EventsStatesPlotsList" plots not only the states, but also the events that produced them:

In[26]:=

Out[26]=

"AllEventsEdgesList" returns the list of edges throughout evolution:

In[27]:=

Out[27]=

Get creator and destroyer events for each edge throughout the evolution:

In[28]:=

Out[28]=

"VertexCountList" and "EdgeCountList" return counts of vertices and edges, respectively, in each state of "StatesList":

In[29]:=

Out[29]=

"GenerationsCount" returns both complete and partial generation counts:

In[30]:=

Out[30]=

"GenerationEventsCountList" gives the number of events per each generation:

In[31]:=

Out[31]=

"GenerationEventsList" returns the same list of events, but splits them into sublists for each generation:

In[32]:=

Out[32]=

"EdgeGenerationsList" yields the list of generation numbers for each edge in "AllEventsEdgesList":

In[33]:=

Out[33]=

"EventsGenerationsList" gives the same for events:

In[34]:=

Out[34]=

"AllEventsCount" returns the overall number of events throughout the evolution:

In[35]:=

Out[35]=

Get a causal graph for an evolution:

In[36]:=

Out[36]=

The causal graph can be layered, putting events from each generation on a different level:

In[37]:=

Out[37]=

VertexNamingFunction (2) 

Use symbolic names for new vertices:

In[38]:=

Out[38]=

Sequentially rename all vertices, including the initial condition:

In[39]:=

Out[39]=

IncludePartialGenerations (1) 

Drop partial generations from the evolution:

In[40]:=

Out[40]=

IncludeBoundaryEvents (3) 

Include the initial event in a causal graph:

In[41]:=

Out[41]=

Include the final event in the list of events:

In[42]:=

Out[42]=

Include both the initial and the final events in "EventsStatesList":

In[43]:=

Out[43]=

Method (2) 

Use symbolic implementation to compute the evolution (which is faster if vertex degrees are large):

In[44]:=

Out[44]=

Compare:

In[45]:=

Out[45]=

TimeConstraint (1) 

Return the evolution object after running the evolution for one second:

In[46]:=

Out[46]=

EventOrderingFunction (2) 

Show final states from five random event orderings:

In[47]:=

Out[47]=

Compare results for the default ordering with the "RuleOrdering":

In[48]:=

Out[48]=