Node diversification in complex networks by decentralized colouring

DOI10.1093/COMNET/CNY031MaRDI QIDQ4958771zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 15 September 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1811.11197

zbMATH Keywords

decentralized colouringiterative optimizationnetwork connectivity

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

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.

Recommendations

• Simple decentralized graph coloring
• Patterns from nature: distributed greedy colouring with simple messages and minimal graph knowledge
• scientific article; zbMATH DE number 2083800
• Coloring Random Intersection Graphs and Complex Networks
• Channel Dependent Interference and Decentralized Colouring

Cited in

(1)

• Balanced Colorings and Bifurcations in Rivalry and Opinion Networks

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)