Author:
Turowski Krzysztof,Magner Abram,Szpankowski Wojciech
Abstract
AbstractWe continue building up the information theory of non-sequential data structures such as trees, sets, and graphs. In this paper, we consider dynamic graphs generated by a full duplication model in which a new vertex selects an existing vertex and copies all of its neighbors. We ask how many bits are needed to describe the labeled and unlabeled versions of such graphs. We first estimate entropies of both versions and then present asymptotically optimal compression algorithms up to two bits. Interestingly, for the full duplication model the labeled version needs $$\Theta (n)$$
Θ
(
n
)
bits while its unlabeled version (structure) can be described by $$\Theta (\log n)$$
Θ
(
log
n
)
bits due to significant amount of symmetry (i.e. large average size of the automorphism group of sample graphs).
Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference26 articles.
1. Abbe, E.: Graph compression: the effect of clusters. In: Proceedings of the Fifty-fourth Annual Allerton Conference (2016)
2. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys 74, 47–97 (2002)
3. Besta, M., Hoefler, T.: Survey and taxonomy of lossless graph compression and space-efficient graph representations. Preprint (2018). https://arxiv.org/pdf/1806.01799
4. Boccaletti, S., Hwang, D.U., Latora, V.: Growing hierarchical scale-free networks by means of nonhierarchical processes. Int. J. Bifurc. Chaos 17, 2447–2452 (2007)
5. Choi, Y., Szpankowski, W.: Compression of graphical structures: fundamental limits, algorithms, and experiments. IEEE Trans. Inf. Theor. 58(2), 620–638 (2012). https://doi.org/10.1109/TIT.2011.2173710
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献