Probabilistic Performance Guarantees for Distributed Self-Assembly

Handle URI:
http://hdl.handle.net/10754/596013
Title:
Probabilistic Performance Guarantees for Distributed Self-Assembly
Authors:
Fox, Michael J.; Shamma, Jeff S. ( 0000-0001-5638-9551 )
Abstract:
In distributed self-assembly, a multitude of agents seek to form copies of a particular structure, modeled here as a labeled graph. In the model, agents encounter each other in spontaneous pairwise interactions and decide whether or not to form or sever edges based on their two labels and a fixed set of local interaction rules described by a graph grammar. The objective is to converge on a graph with a maximum number of copies of a given target graph. Our main result is the introduction of a simple algorithm that achieves an asymptotically maximum yield in a probabilistic sense. Notably, agents do not need to update their labels except when forming or severing edges. This contrasts with certain existing approaches that exploit information propagating rules, effectively addressing the decision problem at the level of subgraphs as opposed to individual vertices. We are able to obey more stringent locality requirements while also providing smaller rule sets. The results can be improved upon if certain requirements on the labels are relaxed. We discuss limits of performance in self-assembly in terms of rule set characteristics and achievable maximum yield.
KAUST Department:
Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
Citation:
Probabilistic Performance Guarantees for Distributed Self-Assembly 2015, 60 (12):3180 IEEE Transactions on Automatic Control
Publisher:
Institute of Electrical and Electronics Engineers (IEEE)
Journal:
IEEE Transactions on Automatic Control
Issue Date:
1-Apr-2015
DOI:
10.1109/TAC.2015.2418673
Type:
Article
ISSN:
0018-9286; 1558-2523
Additional Links:
http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7076621
Appears in Collections:
Articles; Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division

Full metadata record

DC FieldValue Language
dc.contributor.authorFox, Michael J.en
dc.contributor.authorShamma, Jeff S.en
dc.date.accessioned2016-02-10T13:22:15Zen
dc.date.available2016-02-10T13:22:15Zen
dc.date.issued2015-04-01en
dc.identifier.citationProbabilistic Performance Guarantees for Distributed Self-Assembly 2015, 60 (12):3180 IEEE Transactions on Automatic Controlen
dc.identifier.issn0018-9286en
dc.identifier.issn1558-2523en
dc.identifier.doi10.1109/TAC.2015.2418673en
dc.identifier.urihttp://hdl.handle.net/10754/596013en
dc.description.abstractIn distributed self-assembly, a multitude of agents seek to form copies of a particular structure, modeled here as a labeled graph. In the model, agents encounter each other in spontaneous pairwise interactions and decide whether or not to form or sever edges based on their two labels and a fixed set of local interaction rules described by a graph grammar. The objective is to converge on a graph with a maximum number of copies of a given target graph. Our main result is the introduction of a simple algorithm that achieves an asymptotically maximum yield in a probabilistic sense. Notably, agents do not need to update their labels except when forming or severing edges. This contrasts with certain existing approaches that exploit information propagating rules, effectively addressing the decision problem at the level of subgraphs as opposed to individual vertices. We are able to obey more stringent locality requirements while also providing smaller rule sets. The results can be improved upon if certain requirements on the labels are relaxed. We discuss limits of performance in self-assembly in terms of rule set characteristics and achievable maximum yield.en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7076621en
dc.rights(c) 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.en
dc.subjectReversibilityen
dc.subjectself-assemblyen
dc.titleProbabilistic Performance Guarantees for Distributed Self-Assemblyen
dc.typeArticleen
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Divisionen
dc.identifier.journalIEEE Transactions on Automatic Controlen
dc.eprint.versionPost-printen
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USAen
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)en
kaust.authorShamma, Jeff S.en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.