Related papers: Higher order fluctuations of extremal eigenvalues …
We consider the extremal values of the stationary distribution of sparse directed random graphs with given degree sequences and their relation to the extremal values of the in-degree sequence. The graphs are generated by the directed…
We present a general method to obtain the exact rate function $\Psi_{[a,b]}(k)$ controlling the large deviation probability $\text{Prob}[\mathcal{I}_N[a,b]=kN] \asymp e^{-N\Psi_{[a,b]}(k)}$ that a $N \times N$ sparse random matrix has…
This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…
The extreme eigenvalues of adjacency matrices are important indicators on the influences of topological structures to collective dynamical behavior of complex networks. Recent findings on the ensemble averageability of the extreme…
In this paper, we consider a sequence of selfadjoint matrices $A_n$ having a limiting spectral distribution as $n\to \infty$, and we consider a sequence of full flags $\{0\le p_1^n\le\ldots\le p_i^n\le\ldots\le 1_n\}$ chosen at random…
We generalize the concept of extremal index of a stationary random sequence to the series scheme of identically distributed random variables with random series sizes tending to infinity in probability. We introduce new extremal indices…
This paper systematically studies the behavior of the leading eigenvectors for independent edge undirected random graphs generated from a general latent position model whose link function is possibly infinite rank and also possibly…
In this article, the joint fluctuations of the extreme eigenvalues and eigenvectors of a large dimensional sample covariance matrix are analyzed when the associated population covariance matrix is a finite-rank perturbation of the identity…
We carry out a numerical study of fluctuations in the spectrum of regular graphs. Our experiments indicate that the level spacing distribution of a generic k-regular graph approaches that of the Gaussian Orthogonal Ensemble of random matrix…
We study eigenvalue distribution of the adjacency matrix $A^{(N,p, \alpha)}$ of weighted random bipartite graphs $\Gamma= \Gamma_{N,p}$. We assume that the graphs have $N$ vertices, the ratio of parts is $\frac{\alpha}{1-\alpha}$ and the…
In this paper we investigate the extremal relationship between two well-studied graph parameters: the order of the largest homogeneous set in a graph $G$ and the maximal number of distinct degrees appearing in an induced subgraph of $G$,…
We introduce the extremal range, a local statistic for studying the spatial extent of extreme events in random fields on $\mathbb{R}^d$. Conditioned on exceedance of a high threshold at a location $s$, the extremal range at $s$ is the…
We investigate extreme value theory of a class of random sequences defined by the all-time suprema of aggregated self-similar Gaussian processes with trend. This study is motivated by its potential applications in various areas and its…
We study random normal matrix models whose eigenvalues tend to be distributed within a narrow "band" around the unit circle of width proportional to $\frac1n$, where $n$ is the size of matrices. For general radially symmetric potentials…
We prove the first eigenvalue repulsion bound for sparse random matrices. As a consequence, we show that these matrices have simple spectrum, improving the range of sparsity and error probability from the work of the second author and Vu.…
We study the asymptotic behavior of eigenvalues of large complex correlated Wishart matrices at the edges of the limiting spectrum. In this setting, the support of the limiting eigenvalue distribution may have several connected components.…
Consider a random symmetric matrix with i.i.d.~entries on and above its diagonal that are products of Bernoulli random variables and random variables with sub-Gaussian tails. Such a matrix will be called a sparse Wigner matrix and can be…
We develop a formalism to compute the statistics of the top eigenpair of weighted sparse graphs with finite mean connectivity and bounded maximal degree. Framing the problem in terms of optimisation of a quadratic form on the sphere and…
Let $(M,g)$ be a closed Riemannian manifold of dimension $n\geq 3$. If $s$ is a positive integer satisfying $2s<n$, we let $P_g^s$ be the GJMS operator of order $2s$ in $M$. We investigate in this paper the extremal values taken by fixed…
Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…