Show simple item record

dc.contributor.authorFox, Michael J.
dc.contributor.authorShamma, Jeff S.
dc.date.accessioned2016-02-10T13:22:15Z
dc.date.available2016-02-10T13:22:15Z
dc.date.issued2015-04-01
dc.identifier.citationProbabilistic Performance Guarantees for Distributed Self-Assembly 2015, 60 (12):3180 IEEE Transactions on Automatic Control
dc.identifier.issn0018-9286
dc.identifier.issn1558-2523
dc.identifier.doi10.1109/TAC.2015.2418673
dc.identifier.urihttp://hdl.handle.net/10754/596013
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.
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.relation.urlhttp://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7076621
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.
dc.subjectReversibility
dc.subjectself-assembly
dc.titleProbabilistic Performance Guarantees for Distributed Self-Assembly
dc.typeArticle
dc.contributor.departmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
dc.contributor.departmentElectrical Engineering Program
dc.identifier.journalIEEE Transactions on Automatic Control
dc.eprint.versionPost-print
dc.contributor.institutionSchool of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, GA 30332 USA
dc.contributor.affiliationKing Abdullah University of Science and Technology (KAUST)
kaust.personShamma, Jeff S.
refterms.dateFOA2018-06-13T14:02:16Z
dc.date.published-online2015-04-01
dc.date.published-print2015-12


Files in this item

Thumbnail
Name:
2099ppg.pdf
Size:
2.424Mb
Format:
PDF
Description:
Accepted Manuscript

This item appears in the following Collection(s)

Show simple item record