Lecture Notes in Computer Science, 2006, Volume 3892/2006, 144-157, DOI: 10.1007/11753681_11

Expectation and Variance of Self-assembled Graph Structures

Nataša Jonoska, Gregory L. McColm and Ana Staninska

View Related Documents

Abstract

Understanding how nanostructures are self-assembled into more complex forms is a crucial component of nanotechnology that shall lead towards understanding other processes and structures in nature. In this paper we use a model of self-assembly using flexible junction molecules and describe how it can in some static conditions be used to predict the outcome of a graph self-assembly. Using probabilistic methods, we show the expectation and the variance of the number of self-assembled cycles, K 3, and discuss generalization of these results for C n . We tie this analysis to previously observed experimental results.

Fulltext Preview

Image of the first page of the fulltext document