This talk will focus on the fluctuations of a linear spectral statistic around its mean for $P\left(W_N, D_N\right)$ where $P$ is a polynomial, $W_N$ a Wigner matrix and $D_N$ a deterministic diagonal matrix. I will first consider the case when $P\left(W_N,D_N\right)=W_N+D_N$, based on a joint work with M. Février (U. Paris-Saclay). In the general case of $P$ a selfadjoint noncommutative polynomial, I will present results for the special case of the Stieltjes transform, based on a joint work with S. Belinschi (CNRS, U. Toulouse), M. Capitaine (CNRS,U. Toulouse) and M. Février (U. Paris-Saclay).[-]

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.[-]

A non-backtracking walk on a graph is a directed path such that no edge is the inverse of its preceding edge. The non-backtracking matrix of a graph is indexed by its directed edges and can be used to count non-backtracking walks of a given length. It has been used recently in the context of community detection and has appeared previously in connection with the Ihara zeta function and in some generalizations of Ramanujan graphs. In this work, we study the largest eigenvalues of the non-backtracking matrix of the Erdos-Renyi random graph and of the Stochastic Block Model in the regime where the number of edges is proportional to the number of vertices. Our results confirm the "spectral redemption" conjecture that community detection can be made on the basis of the leading eigenvectors above the feasibility threshold.[-]

We show that random walk on a stationary random graph with positive anchored expansion and exponential volume growth has positive speed. We also show that two families of random triangulations of the hyperbolic plane, the hyperbolic Poisson Voronoi tessellation and the hyperbolic Poisson Delaunay triangulation, have 1-skeletons with positive anchored expansion. As a consequence, we show that the simple random walks on these graphs have positive speed. We include a section of open problems and conjectures on the topics of stationary geometric random graphs and the hyperbolic Poisson Voronoi tessellation. [-]

A finite ergodic Markov chain exhibits cutoff if its distance to equilibrium remains close to its initial value over a certain number of iterations and then abruptly drops to near 0 on a much shorter time scale. Originally discovered in the context of card shuffling (Aldous-Diaconis, 1986), this remarkable phenomenon is now rigorously established for many reversible chains. Here we consider the non-reversible case of random walks on sparse directed graphs, for which even the equilibrium measure is far from being understood. We work under the configuration model, allowing both the in-degrees and the out-degrees to be freely specified. We establish the cutoff phenomenon, determine its precise window and prove that the cutoff profile approaches a universal shape. We also provide a detailed description of the equilibrium measure.[-]