Skip to main content

Stuck : Detailed Description

Ok, so this is the detailed version of the previous post.

To recap; the structure generation code is still missing a vital piece - the canonical checking. I have been implementing Jean-Loup Faulon's algorithm for generation, but there is no precise algorithm given for canonical checking. Here the relevant paragraph from the enumeration paper:

"Checking for canonicity is a common procedure of orderly enumeration algorithms, the procedure guarantees that the graphs generated are nonisomorphic. ...To verify that a graph is canonical, one labels the vertices of the graph in all possible ways. The graph is canonical if the initial labeling leads to a list of edges that is lexicographically smaller than the lists obtained with all other labelings. In the present paper, we have implemented two algorithms to verify canonicity, Tarjan tree canonization algorithm if the tested graph is acyclic and McKay’s Nauty technique otherwise"
Okay, so I don't understand this for a couple of reasons : firstly, 'labelling all possible ways' sounds like an n-factorial (n!) operation; secondly, nauty does not lexicographically compare edge strings (as far as I know). Sadly, I know that I have misunderstood something, since my code doesn't work, and theirs does. :(

The technique used by nauty is also used by bliss and saucy and is known as iterative refinement of partitions. A 'partition' is a division of a set into subsets called 'cells', and refinement of a partition roughly means making a finer partition that has cells at least as small, if not smaller that the original. The end of the refinement process are 'discrete' partitions that are the same as permutations, since each cell has only one member. This is sketched in the image below:

A simple implementation of a partition refiner is in my repository. It is a slightly modified version of the algorithm from a book I've mentioned before (CAGES). It tries to deal with vertex and edge colours, although I don't think that it does so all that well. However, for simple graphs, it does indeed produce the automorphism group, as well as check for a canonical graph.

For example, the simple 5-cycle graph in the image might be canonical (or 'canonically labelled') if the refinement process produces the identity permutation as the first discrete partition. This will depend on the particular cell selection algorithm, and the choice made of how to arrange newly split cells.

The modifications I made to the CAGES refiner were done to align the canonical checking with the graph enumeration process. This is important, as edges are added to a graph in a characteristic order, and this has to produce graphs that will be accepted as canonical. This is illustrated in the following image:


The cycle graphs are laid out in a standard way on the left, and in a linear view on the right. The linear view emphasises the order in which the edges might be added. In the canonical scheme I have chosen, vertices are connected to the next possible partner. To put it another way, the resulting graphs will have a minimal edge 'length' when laid out as a linear graph.

What the partition refinement process is doing is the same as labelling all possible ways. The leaves of the refinement tree are permutations. Assuming the refinement process gives automorphic permutations, this is almost the same as labelling within the orbits of the atoms. It seems like partitioning the atoms by signature, then refining this partition should work, but it doesn't.

Any better suggestions or clarifications are very welcome :)

Comments

Post a Comment

Popular posts from this blog

Adamantane, Diamantane, Twistane

After cubane, the thought occurred to look at other regular hydrocarbons. If only there was some sort of classification of chemicals that I could use look up similar structures. Oh wate, there is . Anyway, adamantane is not as regular as cubane, but it is highly symmetrical, looking like three cyclohexanes fused together. The vertices fall into two different types when colored by signature: The carbons with three carbon neighbours (degree-3, in the simple graph) have signature (a) and the degree-2 carbons have signature (b). Atoms of one type are only connected to atoms of another - the graph is bipartite . Adamantane connects together to form diamondoids (or, rather, this class have adamantane as a repeating subunit). One such is diamantane , which is no longer bipartite when colored by signature: It has three classes of vertex in the simple graph (a and b), as the set with degree-3 has been split in two. The tree for signature (c) is not shown. The graph is still bipartite accordin
2 comments
Read more

Király's Method for Generating All Graphs from a Degree Sequence

After posting about the Hakimi-Havel  theorem, I received a nice email suggesting various relevant papers. One of these was by Zoltán Király  called " Recognizing Graphic Degree Sequences and Generating All Realizations ". I have now implemented a sketch of the main idea of the paper, which seems to work reasonably well, so I thought I would describe it. See the paper for details, of course. One focus of Király's method is to generate graphs efficiently , by which I mean that it has polynomial delay. In turn, an algorithm with 'polynomial delay' takes a polynomial amount of time between outputs (and to produce the first output). So - roughly - it doesn't take 1s to produce the first graph, 10s for the second, 2s for the third, 300s for the fourth, and so on. Central to the method is the tree that is traversed during the search for graphs that satisfy the input degree sequence. It's a little tricky to draw, but looks something like this: At the top
5 comments
Read more

General Graph Layout : Putting the Parts Together

An essential tool for graph generation is surely the ability to draw graphs. There are, of course, many methods for doing so along with many implementations of them. This post describes one more (or perhaps an existing method - I haven't checked). Firstly, lets divide a graph up into two parts; a) the blocks, also known as ' biconnected components ', and b) trees connecting those blocks. This is illustrated in the following set of examples on 6 vertices: Trees are circled in green, and blocks in red; the vertices in the overlap between two circles are articulation points. Since all trees are planar, a graph need only have planar blocks to be planar overall. The layout then just needs to do a tree layout  on the tree bits and some other layout on the embedding of the blocks. One slight wrinkle is shown by the last example in the image above. There are three parts - two blocks and a tree - just like the one to its left, but sharing a single articulation point. I had
2 comments
Read more