Related papers: Duality of Orthogonal and Symplectic Matrix Integr…
We prove a number of results to the effect that generic quantum graphs (defined via operator systems as in the work of Duan-Severini-Winter / Weaver) have few symmetries: for a Zariski-dense open set of tuples $(X_1,\cdots,X_d)$ of…
We define totally-isotropic polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally-isotropic polynomials of graphical alternating matrix spaces…
Orthogonality is a fundamental theme in representation theory and Fourier analysis. An orthogonality relation for characters of finite abelian groups (now recognized as an orthogonality relation on GL(1)) was used by Dirichlet to prove…
We present a five-step method for the calculation of eigenvalue correlation functions for various ensembles of real random matrices, based upon the method of (skew-) orthogonal polynomials. This scheme systematises existing methods and also…
To any graph with external half-edges and internal masses, we associate canonical integrals which depend non-trivially on particle masses and momenta, and are always finite. They are generalised Feynman integrals which satisfy graphical…
In this paper we study random representations of fundamental groups of surfaces into special unitary groups. The random model we use is based on a symplectic form on moduli space due to Atiyah, Bott, and Goldman. Let $\Sigma_{g}$ denote a…
We reconsider the problem of calculating a general spectral correlation function containing an arbitrary number of products and ratios of characteristic polynomials for a N x N random matrix taken from the Gaussian Unitary Ensemble (GUE).…
We consider the asymptotic behaviour of the second-order correlation function of the characteristic polynomial of a real symmetric random matrix. Our main result is that the existing result for a random matrix from the Gaussian Orthogonal…
We consider convex maps f:R^n -> R^n that are monotone (i.e., that preserve the product ordering of R^n), and nonexpansive for the sup-norm. This includes convex monotone maps that are additively homogeneous (i.e., that commute with the…
We prove that the distribution function of the largest eigenvalue in the Gaussian Unitary Ensemble (GUE) in the edge scaling limit is expressible in terms of Painlev\'e II. Our goal is to concentrate on this important example of the…
It has recently been emphasized that all known exact evaluations of gap probabilities for classical unitary matrix ensembles are in fact $\tau$-functions for certain Painlev\'e systems. We show that all exact evaluations of gap…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
The enhanced power graph $\mathcal{P}_e(G)$ of a group $G$ is a graph with vertex set $G$ and two vertices are adjacent if they belong to the same cyclic subgroup. In this paper, we consider the minimum degree, independence number and…
We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…
The earlier proposed conditions of (bi)quaternionic differentiability are nonlinear, give rize to the 2-spinor and the self-dual gauge structures and may be considered as the it generating system of equations (GSE) with respect to the…
A \emph{self-complementary} graph is a graph isomorphic to its complement. An isomorphism between $G$ and its complement, viewed as a permutation of $V(G)$, is then called an \emph{antimorphism}. A \emph{skew partition} of $G$ is a…
A central tool in the study of nonhomogeneous random matrices, the noncommutative Khintchine inequality, yields a nonasymptotic bound on the spectral norm of general Gaussian random matrices $X=\sum_i g_i A_i$ where $g_i$ are independent…
We study the integrable structure and scaling limits of the conditioned eigenvector overlap of the symplectic Ginibre ensemble of Gaussian non-Hermitian random matrices with independent quaternion elements. The average of the overlap matrix…
We develop a spectral approach to Sidorenko-type inequalities and apply it to establish sharp edge-spectral supersaturation results. Let $H$ be a bipartite graph with $v$ vertices and $e$ edges, where $v\le e$, and write $M(G)=2e(G)$. We…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…