Related Experiment Video
Updated: Jul 17, 2026

Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
Coloring random graphs and maximizing local diversity
S Bounkong1, J van Mourik, D Saad
1Neural Computing Research Group, Aston University, Birmingham B4 7ET, United Kingdom.
Abstract:
We study a variation of the graph coloring problem on random graphs of finite average connectivity. Given the number of colors, we aim to maximize the number of different colors at neighboring vertices (i.e., one edge distance) of any vertex. Two efficient algorithms, belief propagation and Walksat, are adapted to carry out this task. We present experimental results based on two types of random graphs for different system sizes and identify the critical value of the connectivity for the algorithms to find a perfect solution. The problem and the suggested algorithms have practical relevance since various applications, such as distributed storage, can be mapped onto this problem.
Related Concept Videos
Randomized Experiments
Simple randomization
Simple...
Random Sampling Method
Graphs of Two-Variable Functions
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Graphical Representation of Inequalities
Graphs of Functions
