scholarly journals Diffusions interacting through a random matrix: universality via stochastic Taylor expansion

Author(s):  
Amir Dembo ◽  
Reza Gheissari

AbstractConsider $$(X_{i}(t))$$ ( X i ( t ) ) solving a system of N stochastic differential equations interacting through a random matrix $${\mathbf {J}} = (J_{ij})$$ J = ( J ij ) with independent (not necessarily identically distributed) random coefficients. We show that the trajectories of averaged observables of $$(X_i(t))$$ ( X i ( t ) ) , initialized from some $$\mu $$ μ independent of $${\mathbf {J}}$$ J , are universal, i.e., only depend on the choice of the distribution $$\mathbf {J}$$ J through its first and second moments (assuming e.g., sub-exponential tails). We take a general combinatorial approach to proving universality for dynamical systems with random coefficients, combining a stochastic Taylor expansion with a moment matching-type argument. Concrete settings for which our results imply universality include aging in the spherical SK spin glass, and Langevin dynamics and gradient flows for symmetric and asymmetric Hopfield networks.

2019 ◽  
Vol 7 ◽  
Author(s):  
ASAF FERBER ◽  
VISHESH JAIN

Let $M_{n}$ denote a random symmetric $n\times n$ matrix whose upper-diagonal entries are independent and identically distributed Bernoulli random variables (which take values $1$ and $-1$ with probability $1/2$ each). It is widely conjectured that $M_{n}$ is singular with probability at most $(2+o(1))^{-n}$ . On the other hand, the best known upper bound on the singularity probability of $M_{n}$ , due to Vershynin (2011), is $2^{-n^{c}}$ , for some unspecified small constant $c>0$ . This improves on a polynomial singularity bound due to Costello, Tao, and Vu (2005), and a bound of Nguyen (2011) showing that the singularity probability decays faster than any polynomial. In this paper, improving on all previous results, we show that the probability of singularity of $M_{n}$ is at most $2^{-n^{1/4}\sqrt{\log n}/1000}$ for all sufficiently large $n$ . The proof utilizes and extends a novel combinatorial approach to discrete random matrix theory, which has been recently introduced by the authors together with Luh and Samotij.


2019 ◽  
Vol 52 (6) ◽  
pp. 1403-1458
Author(s):  
Nguyen Viet DANG ◽  
Gabriel RIVIERE

Sign in / Sign up

Export Citation Format

Share Document