Dense random regular digraphs: singularity of the adjacency matrix

MaRDI QIDQ6250078zbMATH OpenFDO

Authors Nicholas A. Cook

Publication date 24 March 2014

Mathematics Subject Classification ID

Random matrices (algebraic aspects) (15B52)

Abstract: Fix $cin(0,1)$ and let $Gamma$ be a $lfloorcnfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $Gamma$ is invertible with high probability. The proof uses a couplings approach based on the switchings method of McKay and Wormald. We also rely on discrepancy properties for the distribution of edges in $Gamma$, recently proved by the author, to overcome certain difficulties stemming from the dependencies between the entries of $M$.

This page was built for publication: Dense random regular digraphs: singularity of the adjacency matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6250078)