Network evolution driven by dynamics applied to graph coloring
Wu Jian-She (吴建设)a, Li Li-Guang (李力光)a, Wang Xiao-Hua (王晓华)b, Yu Xin (于昕)a, Jiao Li-Cheng (焦李成)a
a Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education of China, 224# Xidian University,2# Taibai South Road, Xi'an 710071, China; b Aeronautical Computing Technique Research Institute, Xi'an 710068, China
Abstract An evolutionary network driven by dynamics is studied and applied to the graph coloring problem. From an initial structure, both the topology and the coupling weights evolve according to the dynamics. On the other hand, the dynamics of the network are determined by the topology and the coupling weights, so an interesting structure-dynamics coevolutionary scheme appears. By providing two evolutionary strategies, a network described by the complement of a graph will evolve into several clusters of nodes according to their dynamics. The nodes in each cluster can be assigned the same color and nodes in different clusters assigned different colors. In this way, a coevolution phenomenon is applied to the graph coloring problem. The proposed scheme is tested on several benchmark graphs for graph coloring.
(Probability theory, stochastic processes, and statistics)
Fund: Project supported by the National Natural Science Foundation of China (Grants Nos. 61072139, 61072106, 61203303, 61003198, 61272279, and 61003199).
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.