Journal
ARTIFICIAL LIFE
Volume 16, Issue 3, Pages 225-232Publisher
MIT PRESS
DOI: 10.1162/artl_a_00001
Keywords
Degree-degree correlation; graph coloring; concurrency; biological networks
Ask authors/readers for more resources
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
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available