Node diversification in complex networks by decentralized colouring
From MaRDI portal
Publication:4958771
DOI10.1093/COMNET/CNY031zbMATH Open1473.90025arXiv1811.11197OpenAlexW3102670184WikidataQ128941699 ScholiaQ128941699MaRDI QIDQ4958771
Author name not available (Why is that?)
Publication date: 15 September 2021
Published in: (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1811.11197
No records found.
No records found.
This page was built for publication: Node diversification in complex networks by decentralized colouring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4958771)
