Node Diversification in Complex Networks by Decentralized Coloring
Social and Information Networks
2018-12-04 v1 Cryptography and Security
Data Structures and Algorithms
Multiagent Systems
Physics and Society
Abstract
We develop a decentralized coloring approach to diversify the nodes in a complex network. The key is the introduction of a local conflict index that measures the color conflicts arising at each node which can be efficiently computed using only local information. We demonstrate via both synthetic and real-world networks that the proposed approach significantly outperforms random coloring as measured by the size of the largest color-induced connected component. Interestingly, for scale-free networks further improvement of diversity can be achieved by tuning a degree-biasing weighting parameter in the local conflict index.
Cite
@article{arxiv.1811.11197,
title = {Node Diversification in Complex Networks by Decentralized Coloring},
author = {Richard Garcia-Lebron and David J. Myers and Shouhuai Xu and Jie Sun},
journal= {arXiv preprint arXiv:1811.11197},
year = {2018}
}