Abstract: A random graph with attribute affinity is a graph model in which each vertex is associated to a string in an underlying finite alphabet. The probability of adjacency between two vertices is defined as a function of the two strings. We will discuss some examples of these graphs, and how the spectra are tied to Markov chains in the underlying alphabet.