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
- Award ID(s):
- NSF-PAR ID:
- Publisher / Repository:
- The Royal Society
- Date Published:
- Journal Name:
- Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
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
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.
We present an approach to understand geometric-incompatibility–induced rigidity in underconstrained materials, including subisostatic 2D spring networks and 2D and 3D vertex models for dense biological tissues. We show that in all these models a geometric criterion, represented by a minimal length
, determines the onset of prestresses and rigidity. This allows us to predict not only the correct scalings for the elastic material properties, but also the precise magnitudes for bulk modulus and shear modulus discontinuities at the rigidity transition as well as the magnitude of the Poynting effect. We also predict from first principles that the ratio of the excess shear modulus to the shear stress should be inversely proportional to the critical strain with a prefactor of 3. We propose that this factor of 3 is a general hallmark of geometrically induced rigidity in underconstrained materials and could be used to distinguish this effect from nonlinear mechanics of single components in experiments. Finally, our results may lay important foundations for ways to estimate from measurements of local geometric structure and thus help develop methods to characterize large-scale mechanical properties from imaging data.
Adjoint systems are widely used to inform control, optimization, and design in systems described by ordinary differential equations or differential-algebraic equations. In this paper, we explore the geometric properties and develop methods for such adjoint systems. In particular, we utilize symplectic and presymplectic geometry to investigate the properties of adjoint systems associated with ordinary differential equations and differential-algebraic equations, respectively. We show that the adjoint variational quadratic conservation laws, which are key to adjoint sensitivity analysis, arise from (pre)symplecticity of such adjoint systems. We discuss various additional geometric properties of adjoint systems, such as symmetries and variational characterizations. For adjoint systems associated with a differential-algebraic equation, we relate the index of the differential-algebraic equation to the presymplectic constraint algorithm of Gotay et al. (J Math Phys 19(11):2388–2399, 1978). As an application of this geometric framework, we discuss how the adjoint variational quadratic conservation laws can be used to compute sensitivities of terminal or running cost functions. Furthermore, we develop structure-preserving numerical methods for such systems using Galerkin Hamiltonian variational integrators (Leok and Zhang in IMA J. Numer. Anal. 31(4):1497–1532, 2011) which admit discrete analogues of these quadratic conservation laws. We additionally show that such methods are natural, in the sense that reduction, forming the adjoint system, and discretization all commute, for suitable choices of these processes. We utilize this naturality to derive a variational error analysis result for the presymplectic variational integrator that we use to discretize the adjoint DAE system. Finally, we discuss the application of adjoint systems in the context of optimal control problems, where we prove a similar naturality result.
Deciphering the non-trivial interactions and mechanisms driving the evolution of time-varying complex networks (TVCNs) plays a crucial role in designing optimal control strategies for such networks or enhancing their causal predictive capabilities. In this paper, we advance the science of TVCNs by providing a mathematical framework through which we can gauge how local changes within a complex weighted network affect its global properties. More precisely, we focus on unraveling unknown geometric properties of a network and determine its implications on detecting phase transitions within the dynamics of a TVCN. In this vein, we aim at elaborating a novel and unified approach that can be used to depict the relationship between local interactions in a complex network and its global kinetics. We propose a geometric-inspired framework to characterize the network’s state and detect a phase transition between different states, to infer the TVCN’s dynamics. A phase of a TVCN is determined by its Forman–Ricci curvature property. Numerical experiments show the usefulness of the proposed curvature formalism to detect the transition between phases within artificially generated networks. Furthermore, we demonstrate the effectiveness of the proposed framework in identifying the phase transition phenomena governing the training and learning processes of artificial neural networks. Moreover, we exploit this approach to investigate the phase transition phenomena in cellular re-programming by interpreting the dynamics of Hi-C matrices as TVCNs and observing singularity trends in the curvature network entropy. Finally, we demonstrate that this curvature formalism can detect a political change. Specifically, our framework can be applied to the US Senate data to detect a political change in the United States of America after the 1994 election, as discussed by political scientists.