Aperiodic Graph

In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer ''k'' > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph ''G'' is called the ''period'' of ''G''.

Graphs that cannot be aperiodic

In any directed bipartite graph, all cycles have a length that is divisible by two. Therefore, no directed bipartite graph can be aperiodic. In any directed acyclic graph, it is a vacuous truth that every ''k'' divides all cycles (because there are no directed cycles to divide) so no directed acyclic graph can be aperiodic. And in any directed cycle graph, there is only one cycle, so every cycle's length is divisible by ''n'', the length of that cycle.

Testing for aperiodicity

Suppose that ''G'' is strongly connected and that ''k'' divides the lengths of all cycles in ''G''.
Consider the results of performing a depth-first search of ''G'', starting at any vertex, and assigning each vertex ''v'' to a set ''V''_''i'' where ''i'' is the length (taken mod ''k'') of the path in the depth-first search tree from the root to ''v''. It can be shown that this partition into sets ''V''_''i'' has the property that each edge in the graph goes from a set ''V''_''i'' to another set ''V''_{(''i'' + 1) mod ''k''}. Conversely, if a partition with this property exists for a strongly connected graph ''G'', ''k'' must divide the lengths of all cycles in ''G''.

Thus, we may find the period of a strongly connected graph ''G'' by the following steps:
* Perform a depth-first search of ''G''
* For each ''e'' in ''G'' that connects a vertex on level ''i'' of the depth-first search tree to a vertex on level ''j'', let ''k''_''e'' = ''j'' - ''i'' - 1.
* Compute the greatest common divisor of the set of numbers ''k''_''e''.
The graph is aperiodic if and only if the period computed in this fashion is 1.

If ''G'' is not strongly connected, we may perform a similar computation in each strongly connected component of ''G'', ignoring the edges that pass from one strongly connected component to another.

Jarvis and Shier describe a very similar algorithm using breadth first search in place of depth-first search; the advantage of depth-first search is that the strong connectivity analysis can be incorporated into the same search.

Applications

In a strongly connected graph, if one defines a Markov chain on the vertices, in which the probability of transitioning from ''v'' to ''w'' is nonzero if and only if there is an edge from ''v'' to ''w'', then this chain is aperiodic if and only if the graph is aperiodic. A Markov chain in which all states are recurrent has a strongly connected state transition graph, and the Markov chain is aperiodic if and only if this graph is aperiodic. Thus, aperiodicity of graphs is a useful concept in analyzing the aperiodicity of Markov chains.

Aperiodicity is also an important necessary condition for solving the road coloring problem. According to the solution of this problem , a strongly connected directed graph in which all vertices have the same outdegree has a synchronizable edge coloring if and only if it is aperiodic.

References

*.
*{{citation
, title = The road coloring problem
, last = Trahtman , first = Avraham N. , authorlink = Avraham Trahtman
, year = 2009
, doi = 10.1007/s11856-009-0062-5 , doi-access=free
, issue = 1
, journal = Israel Journal of Mathematics
, pages = 51–60
, volume = 172
, arxiv = 0709.0099.

Graph families
Graph algorithms