اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدrigidPy: Rigidity Analysis in Python
78
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
rigidPy is a Python package that provides a set of tools necessary for studying rigidity and mechanical response in spring networks. It also includes suitable modules for generating new realizations of networks with applications in glassy systems and protein structures. rigidPy is available freely on GitHub and can be installed using Python Package Index (PyPi). The detailed setup information is provided in this paper, along with an overview of the mathematical framework that has been used in developing the package.
قيم البحث
اقرأ أيضاً
Rigidity percolation (RP) is the emergence of mechanical stability in networks. Motivated by the experimentally observed fractal nature of materials like colloidal gels and disordered fiber networks, we study RP in a fractal network. Specifically, we
calculate the critical packing fractions of site-diluted lattices of Sierpinski gaskets (SGs) with varying degrees of fractal iteration. Our results suggest that although the correlation length exponent and fractal dimension of the RP of these lattices are identical to that of the regular triangular lattice, the critical volume fraction is dramatically lower due to the fractal nature of the network. Furthermore, we develop a simplified model for an SG lattice based on the fragility analysis of a single SG. This simplified model provides an upper bound for the critical packing fractions of the full fractal lattice, and this upper bound is strictly obeyed by the disorder averaged RP threshold of the fractal lattices. Our results characterize rigidity in ultra-low-density fractal networks.
How can we manipulate the topological connectivity of a three-dimensional prismatic assembly to control the number of internal degrees of freedom and the number of connected components in it? To answer this question in a deterministic setting, we use
ideas from elementary number theory to provide a hierarchical deterministic protocol for the control of rigidity and connectivity. We then show that is possible to also use a stochastic protocol to achieve the same results via a percolation transition. Together, these approaches provide scale-independent algorithms for the cutting or gluing of three-dimensional prismatic assemblies to control their overall connectivity and rigidity.
We introduce two new concepts, frictional rigidity percolation and minimal rigidity proliferation, to help identify the nature of the frictional jamming transition as well as significantly broaden the scope of rigidity percolation. For frictional rig
idity percolation, we construct rigid clusters in two different lattice models using a $(3,3)$ pebble game, while taking into account contacts below and at the Coulomb threshold. The first lattice is a honeycomb lattice with next-nearest neighbors, the second, a hierarchical lattice. For both, we generally find a continuous rigidity transition. Our numerical results suggest that, for the honeycomb lattice, the exponents associated with the transition found with the frictional $(3,3)$ pebble game are distinct from those of a central-force $(2,3)$ pebble game. We propose that localized motifs, such as hinges, connecting rigid clusters that are allowed only with friction could give rise to this new frictional universality class. However, the closeness of the order parameter exponent between the two cases hints at potential superuniversality. To explore this possibility, we construct a bespoke cluster generating algorithm invoking generalized Henneberg moves, dubbed minimal rigidity proliferation. The minimally rigid clusters the algorithm generates appear to be in the same universality class as connectivity percolation, suggesting superuniversality between all three types of transitions. Finally, the hierarchical lattice is analytically tractable and we find that the exponents depend both on the type of force and on the fraction of contacts at the Coulomb threshold. These combined results allow us to compare two universality classes on the same lattice via rigid clusters for the first time to highlight unifying and distinguishing concepts within the set of all possible rigidity transitions in disordered systems.
Motivated by the formal argument that a non-zero shear modulus is the result of averaging over a constrained configurations space, we demonstrate that the shear modulus calculated over a range of temperatures and averaging times can be expressed (rel
ative to its infinite frequency value) as a single function of the mean squared displacement. This result is shown to hold for both a glass-liquid and a crystal-liquid system.
In biological tissues, it is now well-understood that mechanical cues are a powerful mechanism for pattern regulation. While much work has focused on interactions between cells and external substrates, recent experiments suggest that cell polarizatio
n and motility might be governed by the internal shear stiffness of nearby tissue, deemed plithotaxis. Meanwhile, other work has demonstrated that there is a direct relationship between cell shapes and tissue shear modulus in confluent tissues. Joining these two ideas, we develop a hydrodynamic model that couples cell shape, and therefore tissue stiffness, to cell motility and polarization. Using linear stability analysis and numerical simulations, we find that tissue behavior can be tuned between largely homogeneous states and patterned states such as asters, controlled by a composite morphotaxis parameter that encapsulates the nature of the coupling between shape and polarization. The control parameter is in principle experimentally accessible, and depends both on whether a cell tends to move in the direction of lower or higher shear modulus, and whether sinks or sources of polarization tend to fluidize the system.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
