Related papers: A Block Reduction Method for Random Band Matrices …
We study $N \times N$ random band matrices $H = (H_{xy})$ with mean-zero complex Gaussian entries, where $x,y$ lie on the discrete torus $(\mathbb{Z} / \sqrt[d]{N} \mathbb{Z})^d$ in dimensions $d \ge 3$. The variance profile satisfies…
Consider $N\times N$ symmetric one-dimensional random band matrices with general distribution of the entries and band width $W \geq N^{3/4+\varepsilon}$ for any $\varepsilon>0$. In the bulk of the spectrum and in the large $N$ limit, we…
We consider a general class of $n\times n$ random band matrices with bandwidth $W$. When $W^2\ll n$, we prove that with high probability the eigenvectors of such matrices are localized and decay exponentially at the sharp scale $W^2$.…
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…
We study a random band matrix $H=(H_{xy})_{x,y}$ of dimension $N\times N$ with mean-zero complex Gaussian entries, where $x,y$ belong to the discrete torus $(\mathbb{Z}/\sqrt{N}\mathbb{Z})^{2}$. The variance profile…
We study large $N\times N$ power-law random band matrices $H=(H_{ij})$ with centered complex Gaussian entries, where the variances satisfy a power-law decay $\mathbb{E}|H_{ij}|^2\propto (|i-j|/W+1)^{-1-\alpha}$, for some exponent…
Consider an $ N \times N$ Hermitian one-dimensional random band matrix with band width $W > N^{1 / 2 + \frak c} $ for any $ {\frak c} > 0$. In the bulk of the spectrum and in the large $ N $ limit, we obtain the following results: (i) The…
We consider $N\times N$ Hermitian random band matrices $H=(H_{xy})$, whose entries are centered complex Gaussian random variables. The indices $x,y$ range over the $d$-dimensional discrete torus $(\mathbb Z/L\mathbb Z)^d$ with $d\in…
We prove that a very general class of $N\times N$ Hermitian random band matrices is in the delocalized phase when the band width $W$ exceeds the critical threshold, $W\gg \sqrt{N}$. In this regime, we show that, in the bulk spectrum, the…
Restricted Boltzmann Machines (RBMs) are a common family of undirected graphical models with latent variables. An RBM is described by a bipartite graph, with all observed variables in one layer and all latent variables in the other. We…
We consider Hermitian random band matrices $H=(h_{xy})$ on the $d$-dimensional lattice $(\mathbb Z/L\mathbb Z)^d$. The entries $h_{xy}$ are independent (up to Hermitian conditions) centered complex Gaussian random variables with variances…
We study a general class of random block Schr\"odinger operators (RBSOs) in dimensions 1 and 2, which naturally extend the Anderson model by replacing the random potential with a random block potential. Specifically, we focus on two RBSOs…
We consider a general class of symmetric or Hermitian random band matrices $H=(h_{xy})_{x,y \in \llbracket 1,N\rrbracket^d}$ in any dimension $d\ge 1$, where the entries are independent, centered random variables with variances…
We consider the block band matrices, i.e. the Hermitian matrices $H_N$, $N=|\Lambda|W$ with elements $H_{jk,\alpha\beta}$, where $j,k \in\Lambda=[1,m]^d\cap \mathbb{Z}^d$ (they parameterize the lattice sites) and $\alpha, \beta= 1,\ldots,…
Random Batch Methods (RBM) for mean-field interacting particle systems enable the reduction of the quadratic computational cost associated with particle interactions to a near-linear cost. The essence of these algorithms lies in the random…
We consider $N\times N$ Hermitian random matrices $H$ consisting of blocks of size $M\geq N^{6/7}$. The matrix elements are i.i.d. within the blocks, close to a Gaussian in the four moment matching sense, but their distribution varies from…
We construct compact and high accuracy Reduced Basis (RB) representations of single and multiple quasinormal modes (QNMs). The RB method determines a hierarchical and relatively small set of the most relevant waveforms. We find that the…
Restricted Boltzmann Machine (RBM) is an importan- t generative model modeling vectorial data. While applying an RBM in practice to images, the data have to be vec- torized. This results in high-dimensional data and valu- able spatial…
For many applications in signal processing and machine learning, we are tasked with minimizing a large sum of convex functions subject to a large number of convex constraints. In this paper, we devise a new random projection method (RPM) to…
Block coordinate methods have been extensively studied for minimization problems, where they come with significant complexity improvements whenever the considered problems are compatible with block decomposition and, moreover, block…