Related papers: Asymptotic representation theory and the spectrum …

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

Let $\gamma \in (0,2)$ and let $h$ be the random distribution on $\mathbb C$ which describes a $\gamma$-Liouville quantum gravity (LQG) cone. Also let $\kappa = 16/\gamma^2 >4$ and let $\eta$ be a whole-plane space-filling SLE$_\kappa$…

Given two graphs $G$ and $H$, we investigate for which functions $p=p(n)$ the random graph $G_{n,p}$ (the binomial random graph on $n$ vertices with edge probability $p$) satisfies with probability $1-o(1)$ that every red-blue-coloring of…

We study the length of short cycles on uniformly random metric maps (also known as ribbon graphs) of large genus using a Teichm\"uller theory approach. We establish that, as the genus tends to infinity, the length spectrum converges to a…

These lectures provide an informal introduction into the notions and tools used to analyze statistical properties of eigenvalues of large random Hermitian matrices. After developing the general machinery of orthogonal polynomial method, we…

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

We show that, under mild assumptions, the spectrum of a sum of independent random matrices is close to that of the Gaussian random matrix whose entries have the same mean and covariance. This nonasymptotic universality principle yields…

In Random Matrix Theory the local correlations of the Laguerre and Jacobi Unitary Ensemble in the hard edge scaling limit can be described in terms of the Bessel kernel (containing a parameter $\alpha$). In particular, the so-called hard…

Many important results in extremal graph theory can be roughly summarised as "if a triangle-free graph $G$ has certain properties, then it has a homomorphism to a triangle-free graph $\Gamma$ of bounded size". For example, bounds on…

The renormalization group (RG) approach is largely responsible for the considerable success that has been achieved in developing a quantitative theory of phase transitions. Physical properties emerge from spectral properties of the…

A well-known result of R\"odl and Ruci\'nski states that for any graph $H$ there exists a constant $C$ such that if $p \geq C n^{- 1/m_2(H)}$, then the random graph $G_{n,p}$ is a.a.s. $H$-Ramsey, that is, any $2$-colouring of its edges…

Gaussian graphical models, where it is assumed that the variables of interest jointly follow a multivariate normal distribution with a sparse precision matrix, have been used to study intrinsic dependence among variables, but the normality…

We study asymptotics of reducible representations of the symmetric groups S_q for large q. We decompose such a representation as a sum of irreducible components (or, alternatively, Young diagrams) and we ask what is the character of a…

We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$ every vertex has one of two types, the…

The notion of $\Gamma$-symmetric space is a natural generalization of the classical notion of symmetric space based on $\Z_2$-grading of Lie algebras. In our case, we consider homogeneous spaces $G/H$ such that the Lie algebra $\g$ of $G$…

Poisson boundary is a measurable $\Gamma$-space canonically associated with a group $\Gamma$ and a probability measure $\mu$ on it. The collection of all measurable $\Gamma$-equivariant quotients, known as $\mu$-boundaries, of the Poisson…

Let $X$ be a symmetric, isotropic random vector in $\mathbb{R}^m$ and let $X_1...,X_n$ be independent copies of $X$. We show that under mild assumptions on $\|X\|_2$ (a suitable thin-shell bound) and on the tail-decay of the marginals…

We establish the conditions under which several algorithmically exploitable structural features hold for random intersection graphs, a natural model for many real-world networks where edges correspond to shared attributes. Specifically, we…

The most degenerate unitary principal series representations {\pi}_{i{\lambda},{\delta}} (with {\lambda} \in R, \delta \in Z/2Z) of G = GL(N,R) attain the minimum of the Gelfand-Kirillov dimension among all irreducible unitary…

A simple generalization of the Hall's condition in bipartite graphs, the Normalized Matching Property (NMP) in a graph $G(X,Y,E)$ with vertex partition $(X,Y)$ states that for any subset $S\subseteq X$, we have…