title: Concurrency and network disassortativity.
abstract: The relationship between a network's degree-degree correlation and a loose version of graph coloring is studied on networks with broad degree distributions. We find that, given similar conditions on the number of nodes, number of links, and clustering levels, fewer colors are needed to color disassortative than assortative networks. Since fewer colors create fewer independent sets, our finding implies that disassortative networks may have higher concurrency potential than assortative networks. This in turn suggests another reason for the disassortative mixing pattern observed in biological networks such as those of protein-protein interaction and gene regulation. In addition to the functional specificity and stability suggested by Maslov and Sneppen, a disassortative network topology may also enhance the ability of cells to perform crucial tasks concurrently. Hence, increased concurrency may also be a driving force in the evolution of biological networks.
authors.affiliation: slc.khor@gmail.com
authors.forename: Susan
authors.initials: S
authors.lastname: Khor
mesh_terms: D000465:Algorithms; D000818:Animals; D055253:Color Vision; D003198:Computer Simulation; D006801:Humans; D008954:Models, Biological; D016571:Neural Networks, Computer; D013045:Species Specificity