相关论文: Finite size correction to the spectrum of regular …

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

For a fixed d-regular graph H, a random n-lift is obtained by replacing each vertex v of H by a "fibre" containing n vertices, then placing a uniformly random matching between fibres corresponding to adjacent vertices of H. We show that…

With the aid of simple examples we show how to make simple estimates of the sizes of higher-order Feynman graphs. Our methods enable appropriate values of renormalization and factorization scales to be made. They allow the diagnosis of the…

We consider the single eigenvalue fluctuations of random matrices of general Wigner-type, under a one-cut assumption on the density of states. For eigenvalues in the bulk, we prove that the asymptotic fluctuations of a single eigenvalue…

We study the random-link matching problem on random regular graphs, alongside with two relaxed versions of the problem, namely the fractional matching and the so-called "loopy" fractional matching. We estimated the asymptotic average…

We present a renormalization group (RG) approach to explain universal features of extreme statistics, applied here to independent, identically distributed variables. The outlines of the theory have been described in a previous Letter, the…

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…

It was conjectured by Alon and proved by Friedman that a random $d$-regular graph has nearly the largest possible spectral gap, more precisely, the largest absolute value of the non-trivial eigenvalues of its adjacency matrix is at most…

We provide a deterministic algorithm that finds, in $\epsilon^{-O(1)} n^2$ time, an $\epsilon$-regular Frieze-Kannan partition of a graph on $n$ vertices. The algorithm outputs an approximation of a given graph as a weighted sum of…

We consider a full rank deformation of the GUE $W_N+A_N$ where $A_N$ is a full rank Hermitian matrix of size $N$ and $W_N$ is a GUE. The empirical eigenvalue distribution $\mu_{A_N}$ of $A_N$ converges to a probability distribution $\nu$.…

We solve exactly the general one-dimensional $O(N)$-invariant spin model taking values in the sphere $S^{N-1}$, with nearest-neighbor interactions, in finite volume with periodic boundary conditions, by an expansion in hyperspherical…

Convergence of order $O(1/\sqrt{n})$ is obtained for the distance in total variation between the Poisson distribution and the distribution of the number of fixed size cycles in generalized random graphs with random vertex weights. The…

We study the fluctuations of eigenstate expectation values in a microcanonical ensemble. Assuming the eigenstate thermalization hypothesis, an analytical formula for the finite-size scaling of the fluctuations is derived. The same problem…

Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…

In the graph label selection problem, one is given an $n$-vertex graph and a budget $k$, and seeks to select $k$ vertices whose labels enable accurate prediction of the labels on the remaining vertices. This problem formalizes distilling a…

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit…

In this work I present a numerical study of the Finite Size Scaling (FSS) of a correlation length in the framework of the $CP ^{N-1}$ model by means of the 1/N expansion. This study has been thought as propedeutical to the application of…

We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…

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…

We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix…