Kolmogorov random graphs only have trivial stable colorings
Information Processing Letters
Compressibility as a Measure of Local Coherence in Web Graphs
IICS '02 Proceedings of the Second International Workshop on Innovative Internet Computing Systems
New Applications of the Incompressibility Method
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Discovering important nodes through graph entropy the case of Enron email database
Proceedings of the 3rd international workshop on Link discovery
An information perspective on evolutionary computation
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
An information perspective on evolutionary computation
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
An information perspective on evolutionary computation
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
An improved interval routing scheme for almost all networks based on dominating cliques
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are (i) the mean and variance of the number of (possibly overlapping) ordered labeled subgraphs of a labeled graph as a function of its randomness deficiency (how far it falls short of the maximum possible Kolmogorov complexity) and (ii) a new elementary proof for the number of unlabeled graphs.