Abstract
Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive (and independent) algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (e.g., MST, sparse matrix multiplication, etc.). We also show the minimality of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm.
Original language | English |
---|---|
Title of host publication | Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings |
Publisher | Springer Verlag |
Pages | 399-410 |
Number of pages | 12 |
Edition | PART 2 |
ISBN (Print) | 9783662439500 |
DOIs | |
State | Published - 2014 |
Externally published | Yes |
Event | 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 - Copenhagen, Denmark Duration: 8 Jul 2014 → 11 Jul 2014 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Number | PART 2 |
Volume | 8573 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 41st International Colloquium on Automata, Languages, and Programming, ICALP 2014 |
---|---|
Country/Territory | Denmark |
City | Copenhagen |
Period | 8/07/14 → 11/07/14 |
Bibliographical note
Funding Information:The authors were supported in part by the Israel Science Foundation (grant 1549/13 ).
Funding
The authors were supported in part by the Israel Science Foundation (grant 1549/13 ).
Funders | Funder number |
---|---|
Israel Science Foundation | 1549/13 |