Skip to content

Growth-Inspired Graph Generation and Inverse Design of Mechanical Lattices via Dot Matrices Database Augmentation and GCNN

Sep 2026 · arXiv.org · Vol abs/2609.29024 · 0 citations · 35 references
Computer Science Physics

TL;DR

This work introduces a morphogenetic graph-generation framework for mechanical lattices in which a discrete dot matrix provides potential nodes and the final architecture is created by sequential cross-layer and intra-layer growth.

Abstract

Natural load-bearing and transport networks are not assembled in a single step; they emerge through a temporally ordered process of growth, branching, reinforcement, and loop formation. Inspired by this developmental logic, this work introduces a morphogenetic graph-generation framework for mechanical lattices in which a discrete dot matrix provides potential nodes and the final architecture is created by sequential cross-layer and intra-layer growth. The same rule is visualized in two dimensions as a leaf-vein-like developmental sequence and implemented in three dimensions on a 3x3x3 nodal matrix containing 27 candidate nodes. A dataset of distinct three-dimensional lattices was evaluated by beam-based finite element analysis and represented directly as graphs. A graph convolutional neural network (GCNN) with three graph-convolution layers and dual global pooling learns the topology-property mapping and predicts effective compressive stiffness. Coupling the GCNN surrogate with rapid structural sampling enables inverse design: for a target stiffness of 1000 MPa, the selected design was predicted at 1042.43 MPa and validated by finite element analysis at 1027.49 MPa. Beyond straight members, the framework has also been extended to parameterized horseshoe-shaped curved beams made of nonlinear materials, enabling topology-geometry design toward prescribed deformation shapes. Our work provides a paradigm for augmenting the database of mechanical metamaterials, and the resulting perspective links biological morphogenesis, graph learning, and nonlinear shape programming in a unified generative design framework for architected materials.

View source

Similar papers

#artificial intelligence Preprint Oct 2026

Batch Before You Lift: Scalable Topological Deep Learning on Large Graphs

Cluster-TNN is introduced, a domain-agnostic framework that avoids this bottleneck by lifting locally instead, and enables the first training of multiple different higher-order Topological Neural Networks on large datasets such as Reddit and OGBN Products.

David Leko, Luka Beni'c, Guillermo Bernárdez et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Discrete Diffusion for Large Graph Generation via Structural Candidate Restriction

Synthesizing realistic graphs at scale is vital when the graphs of interest are large and real-world samples are limited or access-sensitive. Diffusion-based generators have recently driven much of the progress, offering high modeling capacity, but most such methods have quadratic computational complexity and are hence...

Yassin Mohamadi, Z. Geradts, M. Worring · 0 citations
Preprint Oct 2026

PolarFlow: Spectral Geometric Flow Matching for Directed Graph Generation via Polar Decomposition

PolarFlow, a continuous geometric flow-matching framework based on polar decomposition and truncated spectral coordinates, achieves generative quality comparable to competitive discrete methods while substantially reducing training and sampling time.

Ya-Nan Zhao, Feng Ji, A. Carballo-Castro et al. · 0 citations
Conference Open access Oct 2026

Graph Autoencoders for Synthetic Tree Skeletons: A Sparse Topology Reconstruction Baseline

Tree skeletons are naturally represented as graphs, in which nodes describe biological or geometric elements and edges represent parent–child branch connections. This work presents a baseline study of graph autoencoders for latent representation learning and connectivity reconstruction of synthetic tree skeletons gener...

M. Diogo, Luís Conde Bento, Paulo Peixoto et al. · 0 citations
#artificial intelligence Preprint Oct 2026

Latent Flow Matching for Molecular Graph Generation

Modern graph generative models typically operate directly in the discrete graph space, explicitly generating node and edge variables, which can become costly as graphs grow. In this paper, we perform generation explicitly on latent representations of entire graphs obtained from a pretrained Variational Autoencoder with...

Mathis Goupillon, Roman Bresson, Konstantinos Divriotis et al. · 0 citations
#artificial intelligence Preprint Sep 2026

ProtoGuide: Prototype-Driven Guidance for Class-Conditional Graph Generation

ProtoGuide is introduced, a post-hoc, backbone-agnostic framework that recovers an analogous mechanism for discrete diffusion models and raises macro classification accuracy and outperforms DiGress's built-in conditional training under the authors' configuration.

Salvatore Romano, Marco Grassia, Pietro Liò et al. · 0 citations

Related blog posts

Microsoft Research Blog Nov 16, 2026

TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient

AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.