Random walks and graph homomorphisms
Amir Daneshgar, Hossein Hajiabolhassan · DIMACS series in discrete mathematics and theoretical computer science · 2004
In this report (whose basic approach is based on [12]) we introduce a general idea which gives rise to some necessary conditions for the existence of graph homomorphisms (directed and undirected), which is mainly based on available comparison techniques for Markov chains. We focus on the nite strongly{ connected case to propose the main ideas, however, there are also a variety of conceivable extensions to weaker conditions or the in nite case.