5,086 research outputs found

    Structure and structure relaxation

    Full text link
    A discrete--dynamics model, which is specified solely in terms of the system's equilibrium structure, is defined for the density correlators of a simple fluid. This model yields results for the evolution of glassy dynamics which are identical with the ones obtained from the mode-coupling theory for ideal liquid--glass transitions. The decay of density fluctuations outside the transient regime is shown to be given by a superposition of Debye processes. The concept of structural relaxation is given a precise meaning. It is proven that the long-time part of the mode-coupling-theory solutions is structural relaxation, while the transient motion merely determines an overall time scale for the glassy dynamics

    The circular law for random matrices

    Full text link
    We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the unit disc without assumptions on the existence of a density for the distribution of entries. We assume that the entries have a finite moment of order larger than two and consider the case of sparse matrices. The results are based on previous work of Bai, Rudelson and the authors extending those results to a larger class of sparse matrices.Comment: Published in at http://dx.doi.org/10.1214/09-AOP522 the Annals of Probability (http://www.imstat.org/aop/) by the Institute of Mathematical Statistics (http://www.imstat.org

    On the Distribution of Complex Roots of Random Polynomials with Heavy-tailed Coefficients

    Full text link
    Consider a random polynomial Gn(z)=ξnzn+...+ξ1z+ξ0G_n(z)=\xi_nz^n+...+\xi_1z+\xi_0 with i.i.d. complex-valued coefficients. Suppose that the distribution of log(1+log(1+ξ0))\log(1+\log(1+|\xi_0|)) has a slowly varying tail. Then the distribution of the complex roots of GnG_n concentrates in probability, as nn\to\infty, to two centered circles and is uniform in the argument as nn\to\infty. The radii of the circles are ξ0/ξτ1/τ|\xi_0/\xi_\tau|^{1/\tau} and ξτ/ξn1/(nτ)|\xi_\tau/\xi_n|^{1/(n-\tau)}, where ξτ\xi_\tau denotes the coefficient with the maximum modulus.Comment: 8 page

    Comment on ``Spherical 2 + p spin-glass model: An analytically solvable model with a glass-to-glass transition''

    Full text link
    Guided by old results on simple mode-coupling models displaying glass-glass transitions, we demonstrate, through a crude analysis of the solution with one step of replica symmetry breaking (1RSB) derived by Crisanti and Leuzzi for the spherical s+ps+p mean-field spin glass [Phys. Rev. B 73, 014412 (2006)], that the phase behavior of these systems is not yet fully understood when ss and pp are well separated. First, there seems to be a possibility of glass-glass transition scenarios in these systems. Second, we find clear indications that the 1RSB solution cannot be correct in the full glassy phase. Therefore, while the proposed analysis is clearly naive and probably inexact, it definitely calls for a reassessment of the physics of these systems, with the promise of potentially interesting new developments in the theory of disordered and complex systems.Comment: 5 pages, third version (first version submitted to Phys. Rev. B on November 2006

    Limit Correlation Functions for Fixed Trace Random Matrix Ensembles

    Full text link
    Universal limits for the eigenvalue correlation functions in the bulk of the spectrum are shown for a class of nondeterminantal random matrices known as the fixed trace ensemble.Comment: 32 pages; Latex; result improved; proofs modified; reference added; typos correcte

    Preferred attachment model of affiliation network

    Full text link
    In an affiliation network vertices are linked to attributes and two vertices are declared adjacent whenever they share a common attribute. For example, two customers of an internet shop are called adjacent if they have purchased the same or similar items. Assuming that each newly arrived customer is linked preferentially to already popular items we obtain a preferred attachment model of an evolving affiliation network. We show that the network has a scale-free property and establish the asymptotic degree distribution.Comment: 9 page
    corecore