Search results for "Block matrix"

showing 1 items of 11 documents

Structure of eigenvectors of random regular digraphs

2018

Let $d$ and $n$ be integers satisfying $C\leq d\leq \exp(c\sqrt{\ln n})$ for some universal constants $c, C>0$, and let $z\in \mathbb{C}$. Denote by $M$ the adjacency matrix of a random $d$-regular directed graph on $n$ vertices. In this paper, we study the structure of the kernel of submatrices of $M-z\,{\rm Id}$, formed by removing a subset of rows. We show that with large probability the kernel consists of two non-intersecting types of vectors, which we call very steep and gradual with many levels. As a corollary, we show, in particular, that every eigenvector of $M$, except for constant multiples of $(1,1,\dots,1)$, possesses a weak delocalization property: its level sets have cardin…

Random graphDegree (graph theory)Applied MathematicsGeneral MathematicsProbability (math.PR)010102 general mathematicsBlock matrix16. Peace & justice01 natural sciencesCombinatoricsCircular lawFOS: MathematicsRank (graph theory)60B20 15B52 46B06 05C80Adjacency matrix0101 mathematicsRandom matrixEigenvalues and eigenvectorsMathematics - ProbabilityMathematics
researchProduct