Kolmogorov Random Graphs and the Incompressibility Method
组合数学
2007-05-23 v1
摘要
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.
引用
@article{arxiv.math/0110203,
title = {Kolmogorov Random Graphs and the Incompressibility Method},
author = {Harry Buhrman and Ming Li and John Tromp and Paul Vitanyi},
journal= {arXiv preprint arXiv:math/0110203},
year = {2007}
}
备注
LaTeX 9 pages