The transformation of graphs can be described using rules. They can also be expressed by an energy function that defines the steady state probabilities for different graph conformations. Years ago a result was obtained relating graph energy functions and systems of graph transformation rules. Implementating the algorithm that takes an energy function and generates the corresponding rules showed us that other options were also available, that is, that different algorithms could produce different systems of graph transformation rules for the same energy function. We wonder, then, what is the relationship between theses algorithms and why it would be preferable to use one or the other.
Please note that the meeting will be recorded and live-streamed to YouTube: