Effective storage capacity of labeled graphs

Dana Angluin, James Aspnes, Rida Bazzi, Jiang Chen, David Eisenstat, Goran Konjevod

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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. Specifically, we are interested in 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 is related to the information-theoretic capacity which we introduce in the paper. It equals the information-theoretic capacity of the graph up to constant factors for trees, random graphs with polynomial edge probabilities, and bounded-degree graphs.

Original languageEnglish (US)
Pages (from-to)44-56
Number of pages13
JournalInformation and Computation
Volume234
DOIs
StatePublished - Feb 2014

Fingerprint

Storage Capacity
Channel capacity
Labeling
Turing machines
Trees (mathematics)
Graph in graph theory
Tapes
Labels
Polynomials
Turing Machine
Random Graphs
Undirected Graph
Connected graph
Isomorphic
Polynomial

ASJC Scopus subject areas

  • Information Systems
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Computer Science Applications

Cite this

Angluin, D., Aspnes, J., Bazzi, R., Chen, J., Eisenstat, D., & Konjevod, G. (2014). Effective storage capacity of labeled graphs. Information and Computation, 234, 44-56. https://doi.org/10.1016/j.ic.2013.11.004

Effective storage capacity of labeled graphs. / Angluin, Dana; Aspnes, James; Bazzi, Rida; Chen, Jiang; Eisenstat, David; Konjevod, Goran.

In: Information and Computation, Vol. 234, 02.2014, p. 44-56.

Research output: Contribution to journalArticle

Angluin, D, Aspnes, J, Bazzi, R, Chen, J, Eisenstat, D & Konjevod, G 2014, 'Effective storage capacity of labeled graphs', Information and Computation, vol. 234, pp. 44-56. https://doi.org/10.1016/j.ic.2013.11.004
Angluin, Dana ; Aspnes, James ; Bazzi, Rida ; Chen, Jiang ; Eisenstat, David ; Konjevod, Goran. / Effective storage capacity of labeled graphs. In: Information and Computation. 2014 ; Vol. 234. pp. 44-56.
@article{b890af839ee84d878665fb952b542029,
title = "Effective storage capacity of labeled graphs",
abstract = "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. Specifically, we are interested in 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 is related to the information-theoretic capacity which we introduce in the paper. It equals the information-theoretic capacity of the graph up to constant factors for trees, random graphs with polynomial edge probabilities, and bounded-degree graphs.",
author = "Dana Angluin and James Aspnes and Rida Bazzi and Jiang Chen and David Eisenstat and Goran Konjevod",
year = "2014",
month = "2",
doi = "10.1016/j.ic.2013.11.004",
language = "English (US)",
volume = "234",
pages = "44--56",
journal = "Information and Computation",
issn = "0890-5401",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - Effective storage capacity of labeled graphs

AU - Angluin, Dana

AU - Aspnes, James

AU - Bazzi, Rida

AU - Chen, Jiang

AU - Eisenstat, David

AU - Konjevod, Goran

PY - 2014/2

Y1 - 2014/2

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. Specifically, we are interested in 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 is related to the information-theoretic capacity which we introduce in the paper. It equals the information-theoretic capacity of the graph 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. Specifically, we are interested in 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 is related to the information-theoretic capacity which we introduce in the paper. It equals the information-theoretic capacity of the graph 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=84894268389&partnerID=8YFLogxK

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

U2 - 10.1016/j.ic.2013.11.004

DO - 10.1016/j.ic.2013.11.004

M3 - Article

VL - 234

SP - 44

EP - 56

JO - Information and Computation

JF - Information and Computation

SN - 0890-5401

ER -