Hidden geometries in networks arising from cooperative self-assembly
Milovan Suvakov, Miroslav Andjelkovic, Bosiljka Tadic

TL;DR
This paper introduces a computational model for cooperative self-assembly of structured particle groups into networks, revealing how geometry and chemical affinity influence large-scale structure formation and complexity.
Contribution
The study presents a novel model combining geometric rules and chemical affinity to simulate multilevel self-assembly with simplices, analyzed through graph theory and topology.
Findings
Higher Q-connectedness can arise from geometric factors alone.
Chemical potential and polydispersity modulate network structure.
Networks of mono-dispersed simplices resemble quantum and chemical clusters.
Abstract
Multilevel self-assembly involving small structured groups of nano-particles provides new routes to development of functional materials with a sophisticated architecture. Apart from the inter-particle forces, the geometrical shapes and compatibility of the building blocks are decisive factors in each phase of growth. Therefore, a comprehensive understanding of these processes is essential for the design of large assemblies of desired properties. Here, we introduce a computational model for cooperative self-assembly with simultaneous attachment of structured groups of particles, which can be described by simplexes (connected pairs, triangles, tetrahedrons and higher order cliques) to a growing network, starting from a small seed. The model incorporates geometric rules that provide suitable nesting spaces for the new group and the chemical affinity of the system to accepting an…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
