Related papers: Lacunary matrices
We study the random graph G_{n,\lambda/n} conditioned on the event that all vertex degrees lie in some given subset S of the non-negative integers. Subject to a certain hypothesis on S, the empirical distribution of the vertex degrees is…
We give simple criteria to identify the exponential order of magnitude of the absolute value of the determinant for wide classes of random matrix models, not requiring the assumption of invariance. These include Gaussian matrices with…
In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate latent positions for random dot product graphs provided the latent positions are i.i.d. from some distribution. If class labels…
We calculate all decomposition matrices of the cyclotomic Hecke algebras of the rank 2 exceptional complex reflection groups in characteristic 0. We prove the existence of canonical basic sets in the sense of Geck-Rouquier and show that all…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
In this paper we show that all nodes can be found optimally for almost all random Erd\H{o}s-R\'enyi ${\mathcal G}(n,p)$ graphs using continuous-time quantum spatial search procedure. This works for both adjacency and Laplacian matrices,…
We reconsider density matrices of graphs as defined in [quant-ph/0406165]. The density matrix of a graph is the combinatorial laplacian of the graph normalized to have unit trace. We describe a simple combinatorial condition (the "degree…
Let $0<p,q \leq \infty$ and denote by $\mathcal S_p^N$ and $\mathcal S_q^N$ the corresponding finite-dimensional Schatten classes. We prove optimal bounds, up to constants only depending on $p$ and $q$, for the entropy numbers of natural…
The work considers an equivalence relation in the set of all $n\times m$ matrices with entries in the set $[p]=\{ 0,1,\ldots , p-1 \}$. In each element of the factor-set generated by this relation, we define the concept of canonical matrix,…
Patterned random matrices such as the reverse circulant, the symmetric circulant, the Toeplitz and the Hankel matrices and their almost sure limiting spectral distribution (LSD), have attracted much attention. Under the assumption that the…
We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of…
Density matrices of graphs are combinatorial laplacians normalized to have trace one (Braunstein \emph{et al.} \emph{Phys. Rev. A,} \textbf{73}:1, 012320 (2006)). If the vertices of a graph are arranged as an array, then its density matrix…
In this article we present new proofs for the boundedness and the compactness on $\ell^2$ of the Rhaly matrices, also known as terraced matrices. We completely characterize when such matrices belong to the Schatten class…
We consider the twin problems of estimating the effective rank and the Schatten norms $\|{\bf A}\|_{s}$ of a rectangular $p\times q$ matrix ${\bf A}$ from noisy observations. When $s$ is an even integer, we introduce a polynomial-time…
We study density estimates of an index set $\mathcal{A}$, under which unconditionality (or even a weaker property of the random unconditional divergence) of the corresponding Rademacher fractional chaos $\{r_{j_1}(t)\cdot…
Good frames were suggested in [Sh:h] as the (bare-bones) parallel, in the context of AECs, to superstable (among elementary classes). Here we consider $(\mu,\lambda,\kappa)$-frames as candidates for being (in the context of AECs) the…
We consider a charged spinless quantum particle confined to a graph consisting of a loop to which a halfline lead is attached; this system is placed into a homogeneous magnetic field perpendicular to the loop plane. We derive the reflection…
In the sufficiently sparse case, we find the probability that a uniformly random bipartite graph with given degree sequence contains no edge from a specified set of edges. This enables us to enumerate loop-free digraphs and oriented graphs…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
Random sampling of large Markov matrices with a tunable spectral gap, a nonuniform stationary distribution, and a nondegenerate limiting empirical spectral distribution (ESD) is useful. Fix $c>0$ and $p>0$. Let $A_n$ be the adjacency matrix…