Related papers: Finite size correction to the spectrum of regular …

In this paper, we study the fluctuation of linear eigenvalue statistics of Random Band Matrices defined by $M_{n}=\frac{1}{\sqrt{b_{n}}}W_{n}$, where $W_{n}$ is a $n\times n$ band Hermitian random matrix of bandwidth $b_{n}$, i.e., the…

We explicitly describe certain components of the finite size groundstate of the inhomogeneous transfer matrix of the O(n=1) loop model on a strip with non-trivial boundaries on both sides. In addition we compute explicitly the groundstate…

We compute the eigenvalue fluctuations of uniformly distributed random biregular bipartite graphs with fixed and growing degrees for a large class of analytic functions. As a key step in the proof, we obtain a total variation distance bound…

We consider the inverse problem of determining the fragmentation rate from noisy measurements in the growth-fragmentation equation. We use Fourier transform theory on locally compact groups to treat this problem for general fragmentation…

We consider the Schr\"odinger operator on a combinatorial graph consisting of a finite graph and a finite number of discrete half-lines, all jointed together, and compute an asymptotic expansion of its resolvent around the threshold $0$.…

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…

We propose an efficient $\epsilon$-differentially private algorithm, that given a simple {\em weighted} $n$-vertex, $m$-edge graph $G$ with a \emph{maximum unweighted} degree $\Delta(G) \leq n-1$, outputs a synthetic graph which…

Generalizing methods developed by Pinn, Pordt and Wieczerkowski for the hierarchical model with one component (N=1) and dimensions d between 2 and 4 we compute O(N)-symmetric fixed points of the hierarchical renormalization group equation…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

A critical task in graph signal processing is to estimate the true signal from noisy observations over a subset of nodes, also known as the reconstruction problem. In this paper, we propose a node-adaptive regularization for graph signal…

This paper analyzes the random fluctuations obtained by a heterogeneous multi-scale first-order finite element method applied to solve elliptic equations with a random potential. We show that the random fluctuations of such solutions are…

We analyze properties of non-hermitian matrices of size M constructed as square submatrices of unitary (orthogonal) random matrices of size N>M, distributed according to the Haar measure. In this way we define ensembles of random matrices…

Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…

We perform a systematic analytical study of finite size effects in separable recurrent neural network models with sequential dynamics, away from saturation. We find two types of finite size effects: thermal fluctuations, and…

McKay proved that the limiting spectral measures of the ensembles of $d$-regular graphs with $N$ vertices converge to Kesten's measure as $N\to\infty$. In this paper we explore the case of weighted graphs. More precisely, given a large…

In this paper we study the spectrum of the random geometric graph $G(n,r)$, in a regime where the graph is dense and highly connected. In the \erdren $G(n,p)$ random graph it is well known that upon connectivity the spectrum of the…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…

We consider a class of sparse random matrices, which includes the adjacency matrix of Erd\H{o}s-R\'enyi graphs $\mathcal G(N,p)$ for $p \in [N^{\varepsilon-1},N^{-\varepsilon}]$. We identify the joint limiting distributions of the…

We show that the fluctuations of the linear eigenvalue statistics of a non-Hermitian random band matrix of increasing bandwidth $b_{n}$ with a continuous variance profile $w_{\nu}(x)$ converges to a $N(0,\sigma_{f}^{2}(\nu))$, where…