skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Modular representation and control of floppy networks
Geometric graph models of systems as diverse as proteins, robots, and mechanical structures from DNA assemblies to architected materials point towards a unified way to represent and control them in space and time. While much work has been done in the context of characterizing the behavior of these networks close to critical points associated with bond and rigidity percolation, isostaticity, etc., much less is known about floppy, under-constrained networks that are far more common in nature and technology. Here we combine geometric rigidity and algebraic sparsity to provide a framework for identifying the zero-energy floppy modes via a representation that illuminates the underlying hierarchy and modularity of the network, and thence the control of its nestedness and locality. Our framework allows us to demonstrate a range of applications of this approach that include robotic reaching tasks with motion primitives, and predicting the linear and nonlinear response of elastic networks based solely on infinitesimal rigidity and sparsity, which we test using physical experiments. Our approach is thus likely to be of use broadly in dissecting the geometrical properties of floppy networks using algebraic sparsity to optimize their function and performance.  more » « less
Award ID(s):
1830901
PAR ID:
10356327
Author(s) / Creator(s):
Date Published:
Journal Name:
Proceedings of the Royal Society of London
ISSN:
2053-9150
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Geometric graph models of systems as diverse as proteins, DNA assemblies, architected materials and robot swarms are useful abstract representations of these objects that also unify ways to study their properties and control them in space and time. While much work has been done in the context of characterizing the behaviour of these networks close to critical points associated with bond and rigidity percolation, isostaticity, etc., much less is known about floppy, underconstrained networks that are far more common in nature and technology. Here, we combine geometric rigidity and algebraic sparsity to provide a framework for identifying the zero energy floppy modes via a representation that illuminates the underlying hierarchy and modularity of the network and thence the control of its nestedness and locality. Our framework allows us to demonstrate a range of applications of this approach that include robotic reaching tasks with motion primitives, and predicting the linear and nonlinear response of elastic networks based solely on infinitesimal rigidity and sparsity, which we test using physical experiments. Our approach is thus likely to be of use broadly in dissecting the geometrical properties of floppy networks using algebraic sparsity to optimize their function and performance. 
    more » « less
  2. Controlling the connectivity and rigidity of kirigami, i.e. the process of cutting paper to deploy it into an articulated system, is critical in the manifestations of kirigami in art, science and technology, as it provides the resulting metamaterial with a range of mechanical and geometric properties. Here, we combine deterministic and stochastic approaches for the control of rigidity in kirigami using the power of k choices, an approach borrowed from the statistical mechanics of explosive percolation transitions. We show that several methods for rigidifying a kirigami system by incrementally changing either the connectivity or the rigidity of individual components allow us to control the nature of the explosive transition by a choice of selection rules. Our results suggest simple lessons for the design of mechanical metamaterials. 
    more » « less
  3. We investigate the spatial correlations of microscopic stresses in soft particulate gels using 2D and 3D numerical simulations. We use a recently developed theoretical framework predicting the analytical form of stress–stress correlations in amorphous assemblies of athermal grains that acquire rigidity under an external load. These correlations exhibit a pinch-point singularity in Fourier space. This leads to long-range correlations and strong anisotropy in real space, which are at the origin of force-chains in granular solids. Our analysis of the model particulate gels at low particle volume fractions demonstrates that stress–stress correlations in these soft materials have characteristics very similar to those in granular solids and can be used to identify force chains. We show that the stress–stress correlations can distinguish floppy from rigid gel networks and that the intensity patterns reflect changes in shear moduli and network topology, due to the emergence of rigid structures during solidification. 
    more » « less
  4. null (Ed.)
    CBMS notes from a series of 10 Lectures by David Cox, with supplemental lectures by C. D'Andrea, A. Dickenstein, J. Hauenstein, H. Schenck, J. Sidman. Systems of polynomial equations can be used to model an astonishing variety of phenomena. This book explores the geometry and algebra of such systems and includes numerous applications. The book begins with elimination theory from Newton to the twenty-first century and then discusses the interaction between algebraic geometry and numerical computations, a subject now called numerical algebraic geometry. The final three chapters discuss applications to geometric modeling, rigidity theory, and chemical reaction networks in detail. Each chapter ends with a section written by a leading expert. 
    more » « less
  5. Algebraic Multigrid (AMG) is an extremely popular linear system solver and/or preconditioner approach for matrices obtained from the discretization of elliptic operators. However, its performance and scalability for large systems obtained from unstructured discretizations seem less consistent than for geometric multigrid (GMG). To a large extent, this is due to loss of sparsity at the coarser grids and the resulting increased cost and poor scalability of the matrix-vector multiplication. While there have been attempts to address this concern by designing sparsification algorithms, these affect the overall convergence. In this work, we focus on designing a specialized matrix-vector multiplication (matvec) that achieves high performance and scalability for a large variation in the levels of sparsity. We evaluate distributed and shared memory implementations of our matvec operator and demonstrate the improvements to its scalability and performance in AMG hierarchy and finally, we compare it with PETSc. 
    more » « less