Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs
Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs
A labeling of a graph is a function from the vertices of the graph to some finite set. In 1996, Albertson and Collins defined distinguishing labelings of undirected graphs. Their definition easily extends to directed graphs. Let $G$ be a directed graph associated to the $k$-block presentation of a Bernoulli …