Cheng-Tai
Lee
and
Matthias
Merkel
*
CNRS, Centre de Physique Théorique (CPT, UMR 7332), Turing Center for Living Systems, Aix Marseille Univ, Université de Toulon, Marseille, France. E-mail: matthias.merkel@univ-amu.fr
First published on 17th June 2022
Disordered spring networks are a useful paradigm to examine macroscopic mechanical properties of amorphous materials. Here, we study the elastic behavior of under-constrained spring networks, i.e. networks with more degrees of freedom than springs. While such networks are usually floppy, they can be rigidified by applying external strain. Recently, an analytical formalism has been developed to predict the scaling behavior of the elastic network properties close to this rigidity transition. Here we numerically show that these predictions apply to many different classes of spring networks, including phantom triangular, Delaunay, Voronoi, and honeycomb networks. The analytical predictions further imply that the shear modulus G scales linearly with isotropic stress T close to the rigidity transition. However, this seems to be at odds with recent numerical studies suggesting an exponent between G and T that is smaller than one for some network classes. Using increased numerical precision and shear stabilization, we demonstrate here that close to the transition a linear scaling, G ∼ T, holds independent of the network class. Finally, we show that our results are not or only weakly affected by finite-size effects, depending on the network class.
A classical way to predict the onset of rigidity in many systems is to use Maxwell's constraint counting, which states that rigidity emerges whenever the constraints in a system outnumber its degrees of freedom.12–14 In systems with pair interactions, this is equivalent to comparing the average connectivity z, i.e. the average number of pair interactions each particle is involved in, to the number of degrees of freedom per particle, which is given by the dimension of space, D. Such systems are predicted to be rigid if z exceeds the isostatic point, z > zc := 2D. In this case the system is called over-constrained. Otherwise, for z < zc, the system is called under-constrained or sub-isostatic, and is predicted to be floppy.
While Maxwell's constraint counting predicts under-constrained systems to be floppy, these systems can still be rigidified, either through the application of external strain or the presence of residual stresses.3,6,7,11,15–21 As a simple model to study such strain-induced rigidity, we discuss here strain-induced rigidity in athermal, under-constrained disordered spring networks.16,18,19,22–24 Strain-induced rigidification is illustrated in Fig. 1a for a network to which isotropic and shear strain has been applied.
![]() | ||
Fig. 1 Under-constrained spring networks can be rigidified by the external application of strain. (a) Network configurations and spring tensions for an example network under either isotropic or shear strain. (b) Change of minimal network energy E, bulk modulus B, and shear modulus G when isotropically deforming a network across the rigidity transition, which occurs at the critical strain value ε*. Below ε*, all springs can attain their rest lengths, the system is floppy, and E = B = G = 0. Beyond ε*, springs start to deviate from their rest lengths. According to ref. 18, the bulk modulus B shows a discrete jump at ε*, while G increases linearly and E increases quadratically with the distance from the transition point ε*. (c) Two types of spring potentials are used in our simulations, harmonic (left) and rope-like (right). ![]() ![]() |
The mechanism creating strain-induced rigidity has been discussed in the literature before.15,16,25,26 When approaching the transition from the floppy side, a state of self-stress (SSS) forms right at the transition. A SSS is a set of tensions that could be put on the springs without any net forces on the nodes. The SSS that appears at the rigidity transition couples to isotropic strain, and using known approaches it can be shown that this induces a jump in the bulk modulus right at the transition (Fig. 1b).14,18 Meanwhile, the shear modulus shows a continuous transition, whenever the SSS that appears at the transition has no net overlap with shear strain. Previously, the floppy side of the strain-stiffening transition was discussed in the limit where the springs are infinitely rigid.25,26 Here, we are interested in the network mechanics of the rigid side of the transition when spring constants are finite.
Recent work involving one of us proposed a theoretical approach that allows to analytically predict the behavior of the elastic properties of under-constrained materials close to the strain-induced rigidity transition.18 This approach is based on a minimal-length function that formalizes the relationship between spring lengths and the applied global strain. This minimal-length function both reflects the critical point where the network starts to rigidify and allows to predict the behavior of the elastic network properties in the rigid regime. In ref. 18, this approach was numerically verified both on models for disordered cellular materials and for packing-derived spring networks. However, it has never been explicitly tested for other classes of under-constrained spring networks.
The approach in ref. 18 allows to predict the behavior of the elastic moduli close to the transition, where the bulk modulus B shows a discontinuity, while the shear modulus G increases linearly with isotropic strain ε (Fig. 1b). One can show that as a consequence of both, one would expect the shear modulus G to linearly increase also with isotropic stress T close to the transition. This is also consistent with earlier work on stress-induced rigidity.3,15,27 However, more recent numerical work19 on under-constrained disordered spring networks suggested that the value for the scaling exponent between G and T can differ from one, depending on the class of network studied. The reason for this deviation from the analytical predictions is so far unclear. Other recent work proposed that the numerical results in ref. 18 could potentially be affected by finite-size effects caused by a diverging length scale when shearing the system.11 Could similar finite-size effects be the reason for this contradiction between predicted and numerically obtained exponents between G and T?
Here, we numerically test the predictions from ref. 18 on several different classes of athermal spring networks. These include phantom triangular, Delaunay, Voronoi, and honeycomb networks, where we study two types of spring potentials, harmonic and rope-like (Fig. 1c). In the following, we first summarize the analytical approach from ref. 18 in Section 1. We then test the analytical predictions on the four different network classes in Section 2, and show that they follow the predicted behavior (Section 2.2). In Section 2.3, we furthermore show that the scaling behavior of the coefficients appearing in the minimal-length function with connectivity z depends on the network class. We then numerically explore the scaling behavior of the shear modulus G over isotropic stress T with increased numerical precision and find a scaling exponent of one, independent of network class (Section 2.4). Finally, we show that depending on the network class, there is no or a weak system-size dependence affecting these results (Section 2.5).
In general, the formalism of ref. 18 applies to any disordered Hookean spring network of N springs, where each spring i has a different spring constant ki and rest length 0i. The energy of such a network is:
![]() | (1) |
Here, to explain just the key ideas of the approach, we focus for simplicity on the special case of a network with homogeneous spring constants ki = 1 and rest lengths 0i =
0:
![]() | (2) |
The elastic properties of disordered networks are in general difficult to predict analytically. Formally, these elastic properties can be computed from derivatives of a minimal energy function emin(ε,γ) with respect to external isotropic strain ε or shear strain γ. This function corresponds to the minimized system energy e({rn},ε,γ) with respect to the node positions rn at constant strain variables ε,γ. However, applying strain to a disordered network generally induces non-affine displacements of the node positions, which are typically hard to predict without numerical energy minimization. To nevertheless make non-trivial predictions about the scaling of the elastic properties, ref. 18 introduced a different approach. Instead of explicitly following the node motion, progress can already be made by focusing on the relation between spring lengths and external strain.
Note that while we focus in this section on harmonic springs, the formalism can also be applied to networks with rope-like pair interactions (Fig. 1c). This is because a rope-like pair interaction can be perfectly mimicked by a chain of two or more harmonic springs18 (see also Appendix D).
![]() | (3) |
The expression in eqn (3) allows us to more conveniently discuss the minimal network energy emin and its behavior once we strain the system. Because e is the sum of two squares, an energy minimum is attained whenever both and σ
are as small as possible. There are two possibilities. First, if there is a set of node positions such that both squares can simultaneously attain zero, then the minimal energy is zero emin = 0. Because elastic stresses and moduli correspond to derivatives of emin, the system is floppy in this parameter regime. Second, there might be no set of node positions such that both terms
and σ
can simultaneously vanish. In this regime, the system is typically rigid.
To access the value of emin in the rigid regime, we need to understand how the system compromises between minimizing and σ
in eqn (3). To this end, we first need a way to express which combinations of
and σ
are geometrically possible. As shown in ref. 18, this can be done using a minimal-length function
which returns the minimally possible
for a given σ
. In other words, a combination of
and σ
is geometrically possible only if:
![]() | (4) |
In general, the precise functional form of depends on the network structure. However, we showed in ref. 18 that at the transition point to first order in σ
this function can be expanded as
![]() | (5) |
We briefly outline how eqn (5) is a consequence of the SSS that is created at the transition point (details in ref. 18). At the transition point the N-dimensional vector of all spring lengths i is given by
with e = (1,…,1). We consider a state of the network that is slightly shifted into the rigid regime, where
. One can then show that the definition of an SSS implies that
is perpendicular to it:18
![]() | (6) |
![]() | (7) |
To derive an expression for the minimal energy emin in the solid regime, we combine two parts: the energy in eqn (3) and the condition of geometrically possible combinations in eqn (4) and (5). First, eqn (4) implies that for fixed σ
, the energy in eqn (3) is minimized when
. Combining this with eqn (5), insertion into eqn (3), and minimization with respect to σ
, yields:
![]() | (8) |
For 0 ≥ 1/3, there are always configurations where all springs can attain their rest lengths
i =
0 (Fig. 2a top). This implies that
and σ
= 0, i.e. both terms in eqn (3) can simultaneously vanish.
Conversely, for 0 < 1/3, the springs will be under tension (Fig. 2a bottom). Our 4-spring example network is simple enough so that we can explicitly minimize the energy with respect to the inner node positions rn = (xn,yn) with n = 1, 2. This will allow us to first directly test whether the minimal energy has the form predicted by eqn (8) in the previous section. The energy of our example network is
![]() | (9) |
Here, to simplify the following discussion, we have set y1 = y2 = 0. The energy e has a global minimum at x1 = −(1 + 20)/10, x2 = (1 + 2
0)/10, where its value is
![]() | (10) |
We now demonstrate how the minimal energy emin can instead be obtained using the ideas of the previous section. We first discuss which pairs of and σ
are geometrically possible. To this end, we express
and σ
in terms of the internal degrees of freedom x1,x2:
![]() | (11) |
![]() | (12) |
![]() | (14) |
In our discussion here we included the internal degrees of freedom x1, x2 to demonstrate their connection to geometrically possible combinations of and σ
, and to obtain explicit values for
and a
. In general, however, the approach from ref. 18 does not require a discussion of internal degrees of freedom. Eqn (3)–(5) are sufficient to understand the overall system behavior close to the rigidity transition, unless one wants to derive the values of the coefficients
and a
from first principles.
Let us consider simulations where the dimensional spring rest length L0 is kept constant, but the system size V is changing. In this case, the combined control parameter 0 encodes isotropic strain. We define (linear) isotropic strain as ε := (V/Vref)1/D − 1, where the Vref is the system volume right after creation of the network. From our length non-dimensionalization follows that we can convert between
0 and bulk strain ε via:
![]() | (15) |
![]() | (16) |
Note that the linear order term in appears only because disordered systems with a finite size generally display a small but finite anisotropy. Eqn (16) can be simplified by removing this anisotropy through defining a new shear variable γ =
− Δγ0, where
= Δγ0 is defined as the shear where the function
is minimal: Δγ0 = − b1/2b. Defining
this leads to the minimal-length function:
![]() | (17) |
![]() | (18) |
![]() | (19) |
![]() | (20) |
![]() | (21) |
![]() | (22) |
Right after creation, where = 0, the disordered networks will generally display an anisotropy. To remove this anisotropy, we need to shear the system to the state
= Δγ0 (i.e. γ = 0, see Section 1.4). At this point, according to eqn (20), shear stress vanishes, σ = 0. Thus, the anisotropy in the networks can be numerically removed using shear stabilization.29 Shear stabilization means that shear strain is treated as an additional degree of freedom during the energy minimization. Unless stated otherwise, we always apply this method during the bisection phase to search for the transition point, so that our system right after the bisection phase is at (ε,γ) = (ε*,0). During the subsequent ε sweeps, we keep shear strain γ fixed (details in Appendix C).
![]() | ||
Fig. 3 Behavior of bulk and shear moduli across the transition for four different classes of networks and comparison to analytical predictions. (a)–(c) Sketches of network structures of phantom triangular (a, z = 3.2, W = 10), Delaunay (b, z = 3.2, W = 12), Voronoi (c, z = 3, W = 12) and honeycomb (c, z = 3, W = 12) networks. In (a), the solid lines are springs of length one, while the dashed ones are phantom springs, i.e. springs that cross one or more nodes without being connected to them. We show phantom springs, which are actually straight, slightly curved only for better visualization. In (b), gray lines indicate the removed springs from the initial full Delaunay network, leaving the black springs in the actual network. (d)–(i) Numerically obtained bulk modulus B and shear modulus G at γ = 0 against increasing isotropic strain ε for different network classes: phantom triangular (d, g, W = 40) and Delaunay (e, h, W = 20) networks with variable connectivity z, as well as Voronoi (f, i, W = 70) and honeycomb (f, i, W = 60). Here, we use harmonic spring potentials, and we shear stabilized the networks before the ε sweeps (Appendix C). The discontinuity ΔB in the bulk modulus at the transition point and linear scaling of G predicted from eqn (21) and (22) are indicated as solid bars and solid lines, respectively. (h inset) Log-log plot of G against strain difference ε − ε*, to resolve the vicinity of the transition point ε*. Symbols are numerical data and lines are analytical predictions. |
At the transition, all networks show a discontinuity ΔB in the bulk modulus, while the transition is continuous in the shear modulus G. This is qualitatively consistent with our analytical predictions (Section 1.5) and the behavior of packing-derived networks.18 We also observe that for both phantom triangular and Delaunay networks the transition point ε* decreases with the average connectivity z.
To compare these data to the prediction for the bulk modulus discontinuity ΔB according to eqn (21), we need the values of and a
for our simulations. To extract
, we insert the transition point strain value ε* into eqn (15). To extract a
, we plot σ
over
(inset of Fig. 4d) and perform a linear fit whose slope is a
for small
(see Appendix D). Note that for symmetry reasons, the honeycomb lattice has σ
= 0 and thus a
= 0. The resulting predictions for the bulk modulus discontinuities ΔB are respectively indicated as horizontal bars in Fig. 3d–f. Indeed, our predictions match well the discontinuities present in the simulation data for all four network classes and all connectivities z.
Some of the data points right at the transition fall below the analytically predicted value for ΔB. These deviations occur in our data for the strain values closest to the transition point, while ΔB values of the same network at similar strain values match closely with our analytical prediction. These deviations are likely due to numerical residues, an effect that we observed before.18
For the shear modulus, eqn (22) predicts a continuous transition with a linear scaling . Using eqn (15), this implies also a linear scaling
to lowest order in Δε. Indeed, this is what we observed close to the transition (inset of Fig. 4g). We indicate this linear scaling also in Fig. 3g–i. Note that for larger Δε, non-linearities in
and in eqn (15) create deviations from this prediction.
Note that both honeycomb and Voronoi networks have their transition points at ε* = 0. This means that these networks have a SSS already right at creation. While this is clearly the case for the honeycomb lattice, we show in Appendix E that it is also true for any Voronoi network.
Taken together, the elastic properties of the system close to the transition, such as the transition point ε*, the magnitude of the discontinuity ΔB in the bulk modulus, and the linear scaling coefficient for the shear modulus G, can be predicted from the coefficients , a
and b.
In both phantom triangular and Delaunay networks, close to the isostatic point the parameter exhibits a linear dependence on Δz with a negative coefficient (Fig. 4a and b), which has also been observed in 2D packing-derived networks.18
We also examined the z-scaling exponents of a and b close to isostaticity (Fig. 4d, e, g and h). For a
, we find for phantom triangular networks a scaling exponent of ≈0.2, for Delaunay networks, we find an exponent close to −1, while we found an exponent of −0.5 in earlier work for packing-derived networks. Meanwhile for b, we find for phantom triangular networks an exponent of ≈−0.5 or smaller, for Delaunay networks an exponent of roughly −2, while we have found before for packing-derived networks an exponent of −1. Hence, the scaling exponent of both parameters strongly depends on network class.
Note that for a small fraction of the Delaunay networks, we did not observe a linear scaling between σ and
, suggesting that the linear relation between
and σ
might be violated for these networks (Appendix D). A more detailed examination suggests that this could quite possibly be due to finite numerical cutoffs required to identify the transition point, which would make us miss the regime where this scaling is linear (Appendix F). We excluded these networks from the averages shown in Fig. 4. We stress that we only found deviations from the linear
scaling for Delaunay networks with harmonic springs, while we could numerically confirm the predicted linear scaling for all phantom triangular and Voronoi networks, as well as the honeycomb network.
G ∼ Tα with α = 1. | (23) |
To resolve this contradiction between the numerical results from ref. 19 and our analytical results from Section 1 and ref. 18, we simulate here different kinds of rope-like networks with a high numerical precision, where we vary linear system size W by more than an order of magnitude. Fig. 5a shows the scaling of the shear modulus G against the isotropic stress T, both averaged over 50 realizations, for phantom triangular networks, where we used two protocols. The open symbols correspond to a protocol without any shear stabilization. This means that no shear strain was applied after the creation of the network, and the ε sweep was carried out at = 0. The closed symbols correspond to a protocol where we used shear stabilization when searching for the transition point, and as a consequence the ε sweep was carried out at γ = 0 (see Sections 1.4).
![]() | ||
Fig. 5 The shear modulus G scales linearly with isotropic stress T for shear-stabilized networks. Without shear stabilization an additional plateau appears at small T. (a) Dependence of G on isotropic stress T for phantom triangular networks with z = 3.2 and rope-like spring potentials for varying system size W, where we either use shear stabilization (closed circles) or not (open circles). All shear-stabilized networks show a linear scaling close to the transition point (at small T). The gray vertical line indicates the lowest T value probed in previous work.19 (a inset) The linear scaling in G(T) also appears for shear-stabilized honeycomb (W = 60), Voronoi (W = 70) and Delaunay (W = 20) networks. Error bars in panel a & inset indicate the standard error of the mean. (b) The G(T) curves for individual phantom triangular networks with z = 3.2 and W = 40 without shear stabilization also exhibit a plateau, confirming that the plateaus in panel a are not due to an averaging effect. (b inset) The variance of the network anisotropy Δγ0 (defined below eqn (16)) across different randomly generated networks for a given system size W scales inversely proportional with W2. |
We find that indeed, for the protocol with shear stabilization (closed symbols), the shear modulus G scales linearly with isotropic stress T over many orders of magnitude (Fig. 5a for phantom triangular networks & inset for the other network classes). This observation is independent of system size. However, without shear stabilization (open symbols), at small stress T we observe a plateau, whose value depends on system size. Away from the plateau regions the curves largely collapse for different system sizes.
The appearance of a plateau in G(T) in the protocol without shear stabilization can be readily understood from our analytical results. eqn (22) states that G is proportional to , where
and γ =
− Δγ0. Without shear stabilization,
= 0 and so γ = −Δγ0. This implies a plateau in G that is proportional to Δγ02. In other words, the plateau in G(T) is related to the small anisotropy in the disordered networks. Shear stabilization removes this anisotropy and thus also the plateau in G(T).
To test whether the plateaus that we find in Fig. 5a do not result form an averaging effect, we plot in Fig. 5b the same curves for individual realizations for a given system size. We find that the plateau is also present in individual simulations, and that its height fluctuates across realizations. This makes sense, because the network anisotropy Δγ0 also fluctuates across realizations. Moreover, we find that the variance of Δγ0 decreases inversely proportional to the number of springs in the system (Fig. 5b), which scales as ∼W2. Hence, the plateau in G(T) corresponds to a finite-size effect. A similar conclusion was drawn also in ref. 30 following a different line of argument.
The system mechanics with respect to isotropic strain is crucially determined by how the minimal-length function scales with σ
in eqn (15) (Section 1, Appendix H). Hence, we were wondering whether the linear scaling of
with σ
is only valid close to the transition point with strains Δε < Δεmax ∼ W−1/ν
for some ν
> 0. In other words, we wondered whether the range Δεmax of linear
scaling would algebraically decrease to zero with increasing system size W.
In Fig. 6 we show the resulting dependency of Δεmax on system size W for both phantom triangular networks and packing-derived networks, both with rope-like spring potentials, where Δεmax is quantified as described in Appendix G. For the phantom networks, beyond an initial quick decrease in Δεmax for small W, we find that for W ≥ 60 our data indicates a finite-size scaling exponent in the range 1/ν ∈ [0.04,0.35]. Thus, the range of linear scaling in the
function slowly decreases with system size. In contrast, for the packing-derived networks discussed in ref. 18, we find a range of 1/ν
∈ [−0.03,0.08]. This means that the linear scaling range of
is subject to none, or at most a weak finite-size effect. Thus, intriguingly, the effect of finite-size effects on the linear scaling range of
appears to depend on the class of network studied.
![]() | ||
Fig. 6 Plot of the isotropic strain range Δεmax = εmax − ε* within which the ![]() ![]() |
Given that strain-controlled transitions in spring networks have been shown to be critical transitions,4,6,7,10,11,19 we wondered whether we would also observe a divergence in the fluctuations close to the transition. Focusing on the scaling behavior of a non-affine motion parameter Γ with system size W and distance to the transition point, ε − ε*, we find indeed such a divergence (Appendix G). Moreover, we also find finite-size effects with exponents of 1/νΓ ≈ 0.75 for phantom triangular networks and 1/νΓ ≈ 0.6 for packing-derived networks. Intriguingly, these exponents are very different from what we observe for the linear scaling regime of , i.e. νΓ ≠ ν
. This suggests that the linear range of
is not controlled by the diverging length scale that controls non-affine motion. A possible reason for this is that close to the transition the non-affinity parameter Γ mostly captures motions that are (to first-order) unconstrained by spring lengths, while
characterizes spring length behavior.
The formalism allows to make several predictions of the elastic network behavior close to the transition.18 These predictions include the rigid-floppy boundary with respect to shear and isotropic strain, the value of the bulk modulus discontinuity at the transition, the linear scaling coefficient of shear modulus with isotropic tension, the value of the shear modulus discontinuity for networks under shear strain, the coefficient of the linear shear modulus scaling beyond this transition, and the coefficient describing the anomalous Poynting effect. All of these predictions are based on the three parameters
, a
and b. In other words, ref. 18 reduced the question of quantitatively predicting the elastic properties of disordered spring networks close to the transition to the question of determining these three parameters a priori, which we believe is a very hard problem that remains for future work. Currently, these parameters need to be determined numerically. However, by combining our predictions one also obtains non-trivial parameter-free predictions that apply to any athermal under-constrained material.18
A key result required to derive all our predictions is that close to the transition the minimal average spring length depends linearly on the standard deviation of the spring lengths σ
. We have shown that this scaling results from the appearance of a state of self-stress (SSS) at the onset of rigidity.14 We note that an equivalent linear scaling has been reported before, in a system of spheres close to the jamming point.31 However, in such a system each contact change will also change the set of SSSs. Contact changes occur also in a host of other systems, such as vitrimers.32 Hence, investigating in depth how varying connectivity affects the relation between
and σ
is an interesting question for future research.
To numerically test the predictions, we first verified the linear scaling of the minimal-length function near the transition and extracted the three parameters , a
and b for four different network classes, including phantom triangular, Delaunay, honeycomb, and Voronoi networks. Based on these parameters, we compute the bulk modulus discontinuity ΔB, which predicts well our numerical results for all network classes (Fig. 3). Moreover, we also recovered the predicted linear scaling of the shear modulus G with isotropic tension T close to the transition.
Next we explored the scaling of the parameters , a
and b with respect to connectivity z. We found that the scaling of the parameters a
and b with the distance to isostaticity Δz = 4 − z strongly depends on the network class. The scaling exponent for a
can even change sign, varying from −1 for Delaunay networks to ≈0.2 for phantom triangular networks (Fig. 4, with an exponent of −0.5 for packing-derived networks18). The scaling exponent for b varies from −2 for Delaunay networks to −0.5 for phantom triangular networks (Fig. 4, with an exponent of −1 for packing-derived networks18). This dependency on network class is not too surprising, since the parameters
, a
and b depend on the microscopic network structure, which varies with network class. In contrast, the value of
always showed a linear dependency on Δz, where intercept and slope depend on network class.
One prediction of the formalism in ref. 18 is a linear scaling of the shear modulus G with the isotropic stress T close to the transition point: G ∼ Tα with α = 1. This is a direct consequence of the discontinuity ΔB in the bulk modulus and of the linear scaling of the shear modulus G with strain Δε. There are different ways to derive such a linear scaling (e.g. ref. 15 and 27); ref. 18 showed that it can be understood as a consequence of the linear scaling of the function with σ
. While in Section 1.4 we make the assumption that
at its minimum is analytical in γ, even certain non-analytic behavior in γ would still lead to an integer exponent α (Appendix H). However, the prediction of integer α seems to be at odds with recent numerical work, which suggested that the value of α can be different from one for networks with a rope-like interaction potential, depending on the disordered nature of the network.19 In particular, ref. 19 found an exponent of α ≈ 0.85 for phantom triangular networks and α ≈ 0.9 for Delaunay networks with connectivity of z = 3.2.
To reconcile the two results from ref. 18 and 19, we numerically studied the G(T) scaling with an increased numerical precision, and our results confirmed the analytically predicted scaling exponent of α = 1 in both phantom triangular and Delaunay networks (Fig. 5a and inset). We show that the result also depends on a small random anisotropy in the generated network. In the presence of such a finite anisotropy, we observed a plateau in the shear modulus G(T) for small isotropic stress T, consistent with the analytic prediction, eqn (22). This plateau disappears when using shear stabilization,29 which removes the network anisotropy by shearing the network by a shear strain Δγ0 (Section 1.4). We moreover show that the plateau disappears for larger system sizes (Fig. 5b inset). Hence, while without shear stabilization large system sizes are required to probe the behavior close to the transition, shear stabilization allows to explore this regime already for smaller systems.
We see two possible reasons for the discrepancy in the G(T) scaling between ref. 18 and 19. First, we used the conjugate gradient minimizer code developed in ref. 18, which allows us to probe the system at least two orders of magnitude closer to the transition point than ref. 19 (see gray vertical line in Fig. 5a). For instance in phantom triangular networks we observe an exponent of α < 1 for larger isotropic stress T ≳ 10−3, which seems consistent with the value of 0.85 given by ref. 19, while we observe an exponent of α = 1 for stress T smaller than that. Second, we show that a small anisotropy in the generated network can lead to a plateau in the shear modulus curve G(T), which could in turn affect the inferred scaling exponent.
Previous work suggested that finite-size effects could affect scaling exponents in spring networks.11 This can occur whenever the system size is on the order of or smaller than a length scale that diverges close to the transition point. While ref. 11 focused on shear simulations, we wanted to test whether such an effect could also arise in our isotropic-strain simulations. To this end, we numerically tested in what range around the transition point the linear scaling of the function holds. Our results suggest that this potentially depends on the class of network studied. While in phantom triangular networks, this range decreases weakly with system size, we did not find a significant decrease in packing-derived networks. This is also consistent with Fig. 5a, which suggests that G(T) is largely independent of system size W for the range of W probed.
Intriguingly, we found that non-affine motion Γ shows a much stronger system-size dependence, suggesting that it is controlled by a length scale that does not affect the linear range of . One possible reason for this is that close to the transition point non-affine motions are to linear order unconstrained in under-constrained networks. Better understanding this difference in the finite-size scaling behavior of Γ and
is an interesting avenue for future research.
![]() | (24) |
![]() | (25) |
![]() | (26) |
![]() | (27) |
![]() | (28) |
![]() | (29) |
In all four network classes, we set the dimensionless spring rest lengths 0i to the respective initial spring lengths before any deformation is applied, i.e. at (ε,
) = (0,0). We set the dimensionless spring constants as the inverse of the respective rest length at zero strain, ki = 1/
0i.
In the bisection to identify the transition point, we also implemented the option to perform shear stabilization to remove network anisotropy (Sections 1.4 and 2.1). This is done by treating the shear strain as an additional degree of freedom during each energy minimization of the bisection process. In any case, shear stabilization was always turned off (i.e. shear remains constant) after the transition point ε* has been identified.
We apply an exponential sweep of isotropic strain to probe the scaling behavior of network mechanics close to the transition point ε*. In particular, we probed strain values ε − ε* = 10−10+0.2k, where the step index k ranged from 0 to 51 by default, with only two exceptions. First, in Fig. 3, we apply the same exponential sweep, yet with k ranging from 0 to 7 only, which is then followed by a linear sweep. Second, for the Voronoi networks of size W = 70 (Fig. 4 and Fig. 5a inset) we needed to increase the residual force cutoff for the energy minimization to 10−10, and so we also raised the cutoff in isotropic stress T to identify the transition point to 10−8. Accordingly, we changed the sweep to the values ε − ε* = 10−8+0.2k with k ranging from 0 to 41.
We computed the elastic moduli using two different methods. For not too big networks, we diagonalized the Hessian of the system energy and used the resultant eigenvalues to compute elastic moduli.18,27,34–36 This approach produces a higher numerical precision and was suitable for typical system sizes W < 100 (Fig. 3 and 4). However, in Fig. 5 we studied networks with a large system size, and so we used a less time-intensive way of computing the shear modulus G. We computed G through a difference quotient of the shear stress over the shear strain: G(ε, γ = 0) = [σ(ε, Δ) − σ(ε, −Δ)]/2Δ, where we numerically tuned and found the optimized shear strain Δ = 5 × 10−5. We also noticed that for ε − ε* < 10−7 the shear modulus computed with this method could deviate significantly from the true value. We hence excluded these data points in Fig. 5 and the lowest isotropic stress there is accordingly T ≈ 10−7.
![]() | (30) |
![]() | (31) |
To extract the parameter b, we use the derived shear modulus formula (eqn (22)), instead of directly using the original minimal-length function (eqn (17)) since we do not shear the networks (i.e. γ = 0). As before, we intend not to use the critical value . Thus, to replace the term
that appears in the shear modulus formula (eqn (22)), we insert eqn (31) back into the minimal-length function (eqn (5)) and obtain
![]() | (32) |
![]() | (33) |
By default we use the first 25 data points from an exponential sweep to numerically fit eqn (31) and (33) and extract the parameters a and b. Note that a
in Fig. 6 is defined in the very same way, based on the first 25 data points of an exponential sweep. Meanwhile in Fig. 3 we use only the first 5 data points due to a decreased step number n in the exponential sweep of isotropic strain (Appendix C).
We note that rope-like spring potentials can be treated as well with the analytical framework in Section 1, which we took into account when computing and σ
here. While one way to treat rope-like spring potentials was discussed in ref. 18, where each spring is subdivided into a series of shorter springs, we chose here an alternative approach. We used the fact that for rope-like spring potentials, a spring i only affects the mechanics when
i >
0i, while springs with
i <
0i do not contribute. Thus, to compute
and σ
, whenever for any spring i the distance of the two connected nodes is smaller than the rest length
0i, we set the spring length to
i =
0i. This redefinition of
i does not affect the computation of shear modulus G and tension T.
The geometric structure of a Voronoi network allows for the following set of spring tensions ti (with i being a spring index) to be a state of self stress:
ti = η |C2i− C1i|. | (34) |
![]() | ||
Fig. 7 Illustration of local force balance at any node n of a Voronoi network, demonstrating that Voronoi networks have a SSS at creation. Red dots are the internal nodes, while blue dots are the neighboring random seeds used for the Voronoi tessellation. Geometrically, node n is created as the circumcenter of the local triangle (gray dashed lines) formed by these seeds, and the three local springs i, j and k (black segments) are the vertical bisectors of the respective sides. The vectors C1i and C2i refer to the two seed points at the side perpendicular to spring i (and similarly for springs j and k). The node n is force-balanced when the magnitude of the spring tensile forces (fi, fj and fk, in black arrows) follow the proportionality relation, eqn (34). These forces will form a closed triangle that is similar to the local triangle by a rotation of 90°, thus giving zero net force, see also eqn (35) and (36). |
To show that the set of spring tensions ti form a state of self stress, we demonstrate that they satisfy local force balance at each node. To this end, we focus here on a node n that is connected to springs i, j, k as shown in Fig. 7. The force that spring i exerts on the node n is fi = tiei, where ei is the unit tangent vector of spring i pointing away from node n. Furthermore, we have
![]() | (35) |
fi + fj + fk = 0. | (36) |
We wondered whether this non-linear scaling between σ and
was just due to finite numerical cutoffs, or whether it reflects the real scaling behavior infinitesimally close to the transition point. Numerical limitations arise because we cannot probe the networks arbitrarily close to the true transition point. Indeed, we used a cutoff value of Tcutoff = 10−10 for the isotropic stress T to numerically identify the transition point. In other words, at the detected transition point we are already in the rigid regime by some small extent beyond the true transition point. If the plateau in
exists only close to the true transition point until some isotropic stress value Tmax < Tcutoff, we will not detect it since we missed that regime. To test if this could be the case, we created histograms of the extent Tmax of the plateau for different connectivity z (Fig. 8b). For a given network, we define Tmax as the isotropic stress of the data point at which the quotient
first deviates by more than 10% from the value of this quotient at the detected transition point. For networks where the plateau ends below Tcutoff, we would find with this approach Tmax ≈ Tcutoff = 10−10. If there is a significant excess of networks where we numerically do not observe a plateau, this could be an indication that there is indeed no plateau.
Fig. 8b shows that for Delaunay networks with harmonic springs, Tmax generally decreases with connectivity z, and that we only observe a peak around Tmax ≈ Tcutoff occur mostly for the two largest values of z. Even in these cases, the peak is not very pronounced and may very well arise from the integral of the real Tmax distribution from 0 to Tcutoff. In other words, these networks may possibly have a plateau which ends just too close to the transition point for us to detect it.
This is also consistent with the observation that most of these curves appear to collapse with the curves that do show a plateau beyond the end of the plateau (Fig. 8a). This suggests that the non-linear scaling regime just corresponds to a regime governed by higher-order terms. In future work, it will be interesting to see if these higher-order terms could also be predicted from first principles.
![]() | ||
Fig. 9 Δεmax in Fig. 6 is defined as the strain range where the ratio ![]() ![]() |
Strain-stiffening of spring networks has been shown to be a critical transition when using shear strain as control parameter, which includes diverging fluctuations when approaching the transition point.6,10,11,19 We wondered whether we would also observe diverging fluctuations when using isotropic strain as control parameter. Analogous to previous work,6,10,11,19 we quantify fluctuations using a non-affinity parameter Γ, which we define as:
![]() | (37) |
![]() | (38) |
Using the same networks as in Fig. 6, we numerically studied Γ(ε) and its dependence on system size. For all system sizes we observed a plateau in Γ(ε) (Fig. 10a), for both phantom triangular and packing-derived networks.
![]() | ||
Fig. 10 Finite-size scaling of the non-affinity parameter Γ defined in eqn (37). (a) A plateau regime is observed in Γ at strain values close to the transition point ε*. Here we show only three example networks with W = 140 of different class. (b and c) As system size W increases, the range Δεpl of the plateau decreases as a power-law, while the plateau value Γpl increases as a power-law. The plateau range Δεpl here is defined as the strain difference between the transition point ε* and the point where Γ shows a 10% deviation from its plateau value Γpl. Error bars indicate the standard error of the mean (≈50 networks for each system size). Here we studied the same set of networks as in Fig. 6. |
We examined how both height Γpl and extent Δεpl of the plateau depend on system size (Fig. 10b and c). We quantified the extent Δεpl as the value of ε where Γ deviates by 10% from the plateau value, where we also performed linear interpolation between neighboring εk values. We found power law scaling with system size of both plateau value Γpl ∼ WλΓ/νΓ and plateau extent Δεpl ∼ W−1/νΓ. For the phantom triangular networks we found the plateau height exponent λΓ/νΓ ≈ 1.1 and for plateau extent 1/νΓ ≈ 0.75. For the packing-derived networks, we found the plateau height exponent λΓ/νΓ ≈ 0.5 and for plateau extent 1/νΓ ≈ 0.6.
These findings are consistent with the finite-size scaling behavior of the non-affinity parameter Γ with respect to shear strain γ:6,10,11,19 The non-affinity parameter generally diverges when approaching the transition as Γ ∼ |Δγ|−λΓ with λΓ > 0, but a diverging length scale ξΓ ∼ |Δγ|−νΓ with νΓ > 0 changes this behavior for system sizes W ≲ ξΓ. As a consequence, the non-affinity parameter Γ (γ) has a plateau whose height scales as Γpl ∼ WλΓ/νΓ, and whose extent scales as Δγpl ∼ W−1/νΓ. Here we demonstrated that this behavior also appears when using isotropic strain instead of shear strain as control parameter.
Noticeably, the 1/νΓ values are much larger than the power-law exponent 1/ν that characterizes the range of the linear scaling of
(Fig. 6; for phantom triangular networks 1/ν
∈ [0.04,0.35], while for packing-derived ones 1/ν
∈ [−0.03,0.08]). This indicates that the linear scaling regime of
is not controlled by the diverging length scale ξΓ that governs the apparent divergence of the non-affine motions.
![]() | (39) |
After minimizing the energy with respect to inner degrees of freedom and the standard deviation σ, the resultant energy e is:
![]() | (40) |
![]() | (41) |
Note that according to eqn (19), Δ is proportional to isotropic tension: T ∼ Δ
, which can be understood as a consequence of the bulk modulus discontinuity. Since the Qs in eqn (41) do not depend on Δ
, one already observes from this equation that any scaling G ∼ Tα needs to have α ∈ {0,1,2}. In this sense, the integer scaling exponent between G and T is inherited from the linear scaling of the
function with σ
in eqn (39).
Which of the three values α ∈ {0,1,2} is attained depends on the coefficients Q0 to Q2 in eqn (41), which are:
Q0 = (1 + a![]() | (42) |
![]() | (43) |
![]() | (44) |
With respect to the scaling exponent α we can say that first, α = 0 only if g has a finite first derivative. This corresponds to the case where there is a discontinuity in the shear modulus at the transition point. In these cases, the SSS that appears at the transition must have finite overlap with the shear deformation, i.e. the network is asymmetric (Section 1.4, e.g. the non-shear stabilized simulations in Fig. 5). Second, α = 1 only if g′ = 0 (i.e. the network is symmetric) and g has a finite second derivative. This is the typical case that we observe for shear-stabilized networks. Third, α = 2 would appear if the network is symmetric (g′ = 0), the second derivative of g vanishes, and a has finite first or second derivative. This situation might appear at a bifurcation (where g′′ as bifurcation parameter crosses zero), possibly related to a structural transition in the network.
Eqn (42)–(44) include first and second derivatives of g and a, which may formally not exist at γ = 0. An important possibility is that at least one of these four derivatives might diverge as γ → 0. However, with eqn (41) this would imply that generally also the shear modulus G diverges as γ → 0, which to our knowledge has not yet been observed in spring networks.
Footnotes |
† This is because eqn (12) can be transformed into where u = ![]() ![]() ![]() ![]() ![]() |
‡ That ![]() ![]() leads to the correct value for the standard deviation of the spring lengths σ ![]() holds, and that ![]() ![]() ![]() ![]() |
This journal is © The Royal Society of Chemistry 2022 |