title: Simple graph models of information spread in finite populations.
abstract: We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call 'single-link' graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the non-zero eigenvalues of the antisymmetric part of the Laplacian and another measure is found for cycles as the value of the transition probability for which hitting times going in either direction of the cycle are equal. A generalization of circular flow graphs is used to illustrate the possibility of tuning edge weights to match pre-specified values for graph parameters; in particular, we show that generalizations of circular flows can be tuned to have fixation probabilities equal to the Moran probability for a complete graph by tuning vertex temperature profiles. Finally, single-link graphs are introduced as an example of a graph involving a bottleneck in the connection between two components and these are compared to the partial bipartite graphs.
authors.affiliation: Center for Science, Athabasca University , 1 University Drive , Athabasca, Alberta, Canada T9S 3A3.
authors.forename: Burton
authors.initials: B
authors.lastname: Voorhees
authors.affiliation: Department of Mathematics , University of Victoria , Victoria, British Columbia, Canada.
authors.forename: Bergerud
authors.initials: B
authors.lastname: Ryder
keywords: fixation probabilities; graph models of populations; graph parameters