TY - GEN

T1 - Storage capacity of labeled graphs

AU - Angluin, Dana

AU - Aspnes, James

AU - Bazzi, Rida

AU - Chen, Jiang

AU - Eisenstat, David

AU - Konjevod, Goran

N1 - Funding Information:
★ Supported in part by NSF grant CCF-0916389. ★★ Supported in part by NSF grants CNS-0435201 and CCF-0916389.
Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.

PY - 2010

Y1 - 2010

N2 - We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic labelings are not distinguishable. An exact information-theoretic bound is easily obtained by counting the number of isomorphism classes of labelings of G, which we call the information-theoretic capacity of the graph. More interesting is the effective capacity of members of some class of graphs, the number of states distinguishable by a Turing machine that uses the labeled graph itself in place of the usual linear tape. We show that the effective capacity equals the information-theoretic capacity up to constant factors for trees, random graphs with polynomial edge probabilities, and bounded-degree graphs.

AB - We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic labelings are not distinguishable. An exact information-theoretic bound is easily obtained by counting the number of isomorphism classes of labelings of G, which we call the information-theoretic capacity of the graph. More interesting is the effective capacity of members of some class of graphs, the number of states distinguishable by a Turing machine that uses the labeled graph itself in place of the usual linear tape. We show that the effective capacity equals the information-theoretic capacity up to constant factors for trees, random graphs with polynomial edge probabilities, and bounded-degree graphs.

UR - http://www.scopus.com/inward/record.url?scp=78249259689&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78249259689&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-16023-3_44

DO - 10.1007/978-3-642-16023-3_44

M3 - Conference contribution

AN - SCOPUS:78249259689

SN - 3642160220

SN - 9783642160226

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 573

EP - 587

BT - Stabilization, Safety, and Security of Distributed Systems - 12th International Symposium, SSS 2010, Proceedings

T2 - 12th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS 2010

Y2 - 20 September 2010 through 22 September 2010

ER -