We consider independent Hermitian heavy-tailed random matrices. Our model includes the Lévy matrices as well as sparse random matrices with O(1) non-zero entries per row. By representing these matrices as weighted graphs, we derive a large deviation principle for key macroscopic observables. Specifically, we focus on the empirical distribution of eigenvalues, the joint neighborhood distribution, and the joint traffic distribution. As an application, we define a notion of microstates entropy for traffic distribution which is additive under free traffic convolution.[-]

Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs – one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general theory, highlight the unbounded graphons, and show how they can be used to consistently estimate properties of large sparse networks. This talk will also give an application of these sparse graphons to collaborative filtering on sparse bipartite networks. Talk II, given by Christian, will recast limits of dense graphs in terms of exchangeability and the Aldous Hoover Theorem, and generalize this to obtain sparse graphons and graphexes as limits of subgraph samples from sparse graph sequences. This will provide a dual view of sparse graph limits as processes and random measures, an approach which allows a generalization of many of the well-known results and techniques for dense graph sequences.[-]

In this first lecture I will introduce a class of stochastic microscopic models very useful as toy models in non equilibrium statistical mechanics. These are multi-component stochastic particle systems like the exclusion process, the zero range process and the KMP model. I will discuss their scaling limits and the corresponding large deviations principles. Problems of interest are the computation of the current flowing across a system and the understanding of the structure of the stationary non equilibrium states. I will discuss these problems in specific examples and from two different perspectives. The stochastic microscopic and combinatorial point of view and the macroscopic variational approach where the microscopic details of the models are encoded just by the transport coefficients.[-]

In this second lecture I will discuss the basic ideas of the macroscopic fluctuation theory as an effective theory in non equilibrium statistical mechanics. All the theory develops starting from a principal formula that describes the distribution at large deviations scale of the joint fluctuations of the density and the current for a diffusive system. The validity of such a formula can be proved for diffusive stochastic lattice gases. I will discuss an infinite dimensional Hamilton-Jacobi equation for the quasi-potential of stationary non equilibrium states, fluctuation-dissipation relationships, the underlying Hamiltonian structure, a relation with work and Clausius inequality, a large deviations functional for the current flowing through a system.[-]

In the last lecture I will apply the macroscopic fluctuation theory to solve specific problems. I will show that several features and behaviors of non equilibrium systems can be deduced within the theory. In particular I will discuss the following issues: the presence of long range correlations in stationary non equilibrium states; the explicit computation of the large deviations rate functional for a few one dimensional stationary non equilibrium states; the existence of dynamical phase transitions in terms of the current flowing across the system, the existence of Lagrangian phase transitions.[-]

Graphons and graphexes are limits of graphs which allow us to model and estimate properties of large-scale networks. In this pair of talks, we review the theory of dense graph limits, and give two alterative theories for limits of sparse graphs – one leading to unbounded graphons over probability spaces, and the other leading to bounded graphons (and graphexes) over sigma-finite measure spaces. Talk I, given by Jennifer, will review the general theory, highlight the unbounded graphons, and show how they can be used to consistently estimate properties of large sparse networks. This talk will also give an application of these sparse graphons to collaborative filtering on sparse bipartite networks. Talk II, given by Christian, will recast limits of dense graphs in terms of exchangeability and the Aldous Hoover Theorem, and generalize this to obtain sparse graphons and graphexes as limits of subgraph samples from sparse graph sequences. This will provide a dual view of sparse graph limits as processes and random measures, an approach which allows a generalization of many of the well-known results and techniques for dense graph sequences.[-]

We propose a modulated free energy which combines of the method previously developed by the speaker together with the modulated energy introduced by S. Serfaty. This modulated free energy may be understood as introducing appropriate weights in the relative entropy to cancel the more singular terms involving the divergence of the flow. This modulated free energy allows to treat singular interactions of gradient-flow type and allows potentials with large smooth part, small attractive singular part and large repulsive singular part. As an example, a full rigorous derivation (with quantitative estimates) of some chemotaxis models, such as Patlak-Keller Segel system in the subcritical regimes, is obtained. This is joint work with D. Bresch and Z. Wang.[-]