Towards a study of low-complexity graphs

Sanjeev Arora; David Steurer; Avi Wigderson

doi:10.1007/978-3-642-02927-1_12

Towards a study of low-complexity graphs

Sanjeev Arora^*, David Steurer, Avi Wigderson

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

We propose the study of graphs that are defined by low-complexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of individual choice in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms. We focus largely on the case where the "low complexity" computation is AC ⁰. We show that this is already a rich class of graphs that includes examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.

Original language	English
Title of host publication	Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings
Pages	119-131
Number of pages	13
Edition	PART 1
DOIs	https://doi.org/10.1007/978-3-642-02927-1_12
State	Published - 2009
Externally published	Yes
Event	36th International Colloquium on Automata, Languages and Programming, ICALP 2009 - Rhodes, Greece Duration: 5 Jul 2009 → 12 Jul 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 1
Volume	5555 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	36th International Colloquium on Automata, Languages and Programming, ICALP 2009
Country/Territory	Greece
City	Rhodes
Period	5/07/09 → 12/07/09

Access to Document

10.1007/978-3-642-02927-1_12

Cite this

Arora, S., Steurer, D., & Wigderson, A. (2009). Towards a study of low-complexity graphs. In Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings (PART 1 ed., pp. 119-131). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5555 LNCS, No. PART 1). https://doi.org/10.1007/978-3-642-02927-1_12

@inproceedings{e752cd267f984f039deced8b51e72392,

title = "Towards a study of low-complexity graphs",

abstract = "We propose the study of graphs that are defined by low-complexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of individual choice in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms. We focus largely on the case where the {"}low complexity{"} computation is AC 0. We show that this is already a rich class of graphs that includes examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.",

author = "Sanjeev Arora and David Steurer and Avi Wigderson",

year = "2009",

doi = "10.1007/978-3-642-02927-1_12",

language = "אנגלית",

isbn = "3642029264",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 1",

pages = "119--131",

booktitle = "Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings",

edition = "PART 1",

note = "36th International Colloquium on Automata, Languages and Programming, ICALP 2009 ; Conference date: 05-07-2009 Through 12-07-2009",

}

Arora, S, Steurer, D & Wigderson, A 2009, Towards a study of low-complexity graphs. in Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 1, vol. 5555 LNCS, pp. 119-131, 36th International Colloquium on Automata, Languages and Programming, ICALP 2009, Rhodes, Greece, 5/07/09. https://doi.org/10.1007/978-3-642-02927-1_12

Towards a study of low-complexity graphs. / Arora, Sanjeev; Steurer, David; Wigderson, Avi.
Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1. ed. 2009. p. 119-131 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5555 LNCS, No. PART 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards a study of low-complexity graphs

AU - Arora, Sanjeev

AU - Steurer, David

AU - Wigderson, Avi

PY - 2009

Y1 - 2009

N2 - We propose the study of graphs that are defined by low-complexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of individual choice in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms. We focus largely on the case where the "low complexity" computation is AC 0. We show that this is already a rich class of graphs that includes examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.

AB - We propose the study of graphs that are defined by low-complexity distributed and deterministic agents. We suggest that this viewpoint may help introduce the element of individual choice in models of large scale social networks. This viewpoint may also provide interesting new classes of graphs for which to design algorithms. We focus largely on the case where the "low complexity" computation is AC 0. We show that this is already a rich class of graphs that includes examples of lossless expanders and power-law graphs. We give evidence that even such low complexity graphs present a formidable challenge to algorithms designers. On the positive side, we show that many algorithms from property testing and data sketching can be adapted to give meaningful results for low-complexity graphs.

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

U2 - 10.1007/978-3-642-02927-1_12

DO - 10.1007/978-3-642-02927-1_12

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:70449086300

SN - 3642029264

SN - 9783642029264

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

SP - 119

EP - 131

BT - Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings

T2 - 36th International Colloquium on Automata, Languages and Programming, ICALP 2009

Y2 - 5 July 2009 through 12 July 2009

ER -

Arora S, Steurer D, Wigderson A. Towards a study of low-complexity graphs. In Automata, Languages and Programming - 36th International Colloquium, ICALP 2009, Proceedings. PART 1 ed. 2009. p. 119-131. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 1). doi: 10.1007/978-3-642-02927-1_12

Towards a study of low-complexity graphs

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this