ID: cond-mat/0602412

Self-organization with equilibration: a model for the intermediate phase in rigidity percolation

February 17, 2006

View on ArXiv

Similar papers 2

Rigidity and intermediate phases in glasses driven by speciation

March 31, 2006

85% Match
Matthieu Micoulaut
Disordered Systems and Neura...
Soft Condensed Matter

The rigid to floppy transitions and the associated intermediate phase in glasses are studied in the case where the local structure is not fully determined from the macroscopic concentration. The approach uses size increasing cluster approximations and constraint counting algorithms. It is shown that the location and the width of the intermediate phase and the corresponding structural, mechanical and energetical properties of the network depend crucially on the way local struc...

Find SimilarView on arXiv

On adaptability and "intermediate phase" in randomly connected networks

August 17, 2004

84% Match
J. Barre', A. R. Bishop, ... , Saxena A.
Statistical Mechanics
Disordered Systems and Neura...

We present a simple model that enables us to analytically characterize a floppy to rigid transition and an associated self-adaptive intermediate phase in a random bond network. In this intermediate phase, the network adapts itself to lower the stress due to constraints. Our simulations verify this picture. We use these insights to identify applications of these ideas in computational problems such as vertex cover and K-SAT.

Find SimilarView on arXiv

The random geometry of equilibrium phases

May 5, 1999

84% Match
H. -O. Georgii, O. Häggström, C. Maes
Probability
Mathematical Physics

This is a (long) survey about applications of percolation theory in equilibrium statistical mechanics. The chapters are as follows: 1. Introduction 2. Equilibrium phases 3. Some models 4. Coupling and stochastic domination 5. Percolation 6. Random-cluster representations 7. Uniqueness and exponential mixing from non-percolation 8. Phase transition and percolation 9. Random interactions 10. Continuum models

Find SimilarView on arXiv

Competition between entropy and energy in network glass: the hidden connection between intermediate phase and liquid-liquid transition

August 25, 2019

84% Match
J. Quetzalcoatl Toledo-Marin, Le Yan
Soft Condensed Matter
Disordered Systems and Neura...

In network glass including chalcogenides, the network topology of microscopic structures can be tuned by changing the chemical compositions. As the composition is varied, an intermediate phase (IP) singularly different from the adjacent floppy or rigid phases on sides has been revealed in the vicinity of the rigidity onset of the network. Glass formers in the IP appear to be reversible at glass transition and strong in dynamical fragility. Meanwhile, the calorimetry experimen...

Find SimilarView on arXiv

Rigidity transitions in anisotropic networks happen in multiple steps

September 13, 2024

84% Match
William Y. Wang, Stephen J. Thornton, Bulbul Chakraborty, Anna Barth, Navneet Singh, Japheth Omonira, Jonathan A. Michel, Moumita Das, ... , Cohen Itai
Soft Condensed Matter
Statistical Mechanics

We study how the rigidity transition in a triangular lattice changes as a function of anisotropy by preferentially filling bonds on the lattice in one direction. We discover that the onset of rigidity in anisotropic spring networks arises in at least two steps, reminiscent of the two-step melting transition in two dimensional crystals. In particular, our simulations demonstrate that the percolation of stress-supporting bonds happens at different critical volume fractions alon...

Find SimilarView on arXiv

Rigidity transitions and constraint counting in amorphous networks: beyond the mean-field approach

January 21, 2002

83% Match
Matthieu University Paris 6 Micoulaut
Condensed Matter

Subj-class: Disordered Systems and Neural Networks

Find SimilarView on arXiv

Algorithms for 3D rigidity analysis and a first order percolation transition

February 27, 2007

83% Match
M. V. Chubynsky, M. F. Thorpe
Disordered Systems and Neura...
Statistical Mechanics

A fast computer algorithm, the pebble game, has been used successfully to study rigidity percolation on 2D elastic networks, as well as on a special class of 3D networks, the bond-bending networks. Application of the pebble game approach to general 3D networks has been hindered by the fact that the underlying mathematical theory is, strictly speaking, invalid in this case. We construct an approximate pebble game algorithm for general 3D networks, as well as a slower but exact...

Find SimilarView on arXiv

Correlated rigidity percolation and colloidal gels

July 24, 2018

83% Match
Shang Zhang, Leyou Zhang, Mehdi Bouzid, D. Zeb Rocklin, ... , Mao Xiaoming
Soft Condensed Matter

Rigidity percolation (RP) occurs when mechanical stability emerges in disordered networks as constraints or components are added. Here we discuss RP with structural correlations, an effect ignored in classical theories albeit relevant to many liquid-to-amorphous-solid transitions, such as colloidal gelation, which are due to attractive interactions and aggregation. Using a lattice model, we show that structural correlations shift RP to lower volume fractions. Through molecula...

Find SimilarView on arXiv

Evolution of covalent networks under cooling: contrasting the rigidity window and jamming scenarios

June 11, 2014

83% Match
Le Yan, Matthieu Wyart
Disordered Systems and Neura...
Statistical Mechanics

We study the evolution of structural disorder under cooling in supercooled liquids, focusing on covalent networks. We introduce a model for the energy of networks that incorporates weak non-covalent interactions. We show that at low-temperature, these interactions considerably affect the network topology near the rigidity transition that occurs as the coordination increases. As a result, this transition becomes mean-field and does not present a line of critical points previou...

Find SimilarView on arXiv

Nucleation during phase transitions in random networks

February 19, 2019

83% Match
Joe Neeman, Charles Radin, Lorenzo Sadun
Combinatorics
Mathematical Physics
Probability

We analyze the 3-parameter family of random networks which are uniform on networks with fixed number of edges, triangles, and nodes (between 33 and 66). We find precursors of phase transitions which are known to be present in the asymptotic node regime as the edge and triangle numbers are varied, and focus on one of the discontinuous ones. By use of a natural edge flip dynamics we determine nucleation barriers as a random network crosses the transition, in analogy to the proc...

Find SimilarView on arXiv