Stress Relaxation of Near-Critical Gels
arXiv:cond-mat/0011414 · doi:10.1103/PhysRevE.64.021404
Abstract
The time-dependent stress relaxation for a Rouse model of a crosslinked polymer melt is completely determined by the spectrum of eigenvalues of the connectivity matrix. The latter has been computed analytically for a mean-field distribution of crosslinks. It shows a Lifshitz tail for small eigenvalues and all concentrations below the percolation threshold, giving rise to a stretched exponential decay of the stress relaxation function in the sol phase. At the critical point the density of states is finite for small eigenvalues, resulting in a logarithmic divergence of the viscosity and an algebraic decay of the stress relaxation function. Numerical diagonalization of the connectivity matrix supports the analytical findings and has furthermore been applied to cluster statistics corresponding to random bond percolation in two and three dimensions.
29 pages, 15 figures
References in corpus (4)
Cited by in corpus (19)
- Sparse random matrices: the eigenvalue spectrum revisited
- Spectra of Sparse Random Matrices
- Cavity and replica methods for the spectral density of sparse symmetric random matrices
- Spectral properties of the Laplacian on bond-percolation graphs
- A random matrix definition of the boson peak
- Lifshitz tails for spectra of Erdős--Rényi random graphs
- Anderson Localization in Euclidean Random Matrices
- On the high-density expansion for Euclidean Random Matrices
- Fully localized and partially delocalized states in the tails of Erdös-Rényi graphs in the critical regime
- Dynamical Scaling Behavior of Percolation Clusters in Scale-free Networks
- Random matrices with row constraints and eigenvalue distributions of graph Laplacians
- Critical behaviour of the Rouse model for gelling polymers
- Anomalous stress relaxation in random macromolecular networks
- Normal stresses at the gelation transition
- The integrated density of states of the random graph Laplacian
- Dynamics of gelling liquids: a short survey
- Hammerstein equations for sparse random matrices
- First return times on sparse random graphs
- Statistical field theory of random graphs with prescribed degrees