Subgraph loop

A driven partition is a subgraph P that is not an element of a subgraph loop and is connected to at least one other subgraph strictly by modulating signals directed inward toward P from that subgraph. 

Here A is a single entry subgraph with entry node and a self-loop back to n. We now add a single entry subgraph A graph isomorphic to A and connect A to n, , the entry of A. There are two possibilities. If node m in A was connected to, then the corresponding node m in A can be connected either back to the entry node of A or A or to the entry node n of A. ... 

At first glance this form seems to suggest that )" (q) is UV-finite as soon as Dy q) has been renormalised, which amounts to replacing Dy q) by Dy n q). However, Flur piq) also contains UV-divergent subgraphs. The following 2-loop contribution may illustrate this point. 

Fig. 2.12 Subgraphs, partitions, and loops, (a) No subgraphs (b) driving and driven subgraphs (c) driving and driven partitions...

It expresses the number of edges and/or loops that must be deleted from G] to get a subgraph which is isomorphic to the maximal common subgraph G2HG2 The distance (2.10) is rewritten in a manifestly symmetric form [cf. (2.11b)]... 

The maximal common subgraph of these two S-graphs does not contain an edge or loop, it contains only one vertex. The reaction graph is... 

---