Searcharxiv⌕ Search

arXiv subjects

Nicholas A. Cook

Publications and source records attributed to Nicholas A. Cook.

20 records · Page 2Linked to original sources

Discrepancy properties for random regular digraphs

For the uniform random regular directed graph we prove concentration inequalities for (1) codegrees and (2) the number of edges passing from one set of vertices to another. As a consequence, we can deduce discrepancy properties for the distribution of edges essentially matching results for Erdős-Rényi digraphs obtained from Chernoff-type bounds. The proofs make use of the method of exchangeable pairs, developed for concentration of measure by Chatterjee. Exchangeable pairs are constructed using two involutions on the set of regular digraphs: a well-known "simple switching" operation, as well as a novel "reflection" operation.

math.CO↗

Dense random regular digraphs: singularity of the adjacency matrix

Fix $c\in (0,1)$ and let $Γ$ be a $\lfloor c n\rfloor$-regular digraph on $n$ vertices drawn uniformly at random. We prove that when $n$ is large, the (non-symmetric) adjacency matrix $M$ of $Γ$ 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 $Γ$, recently proved by the author, to overcome certain difficulties stemming from the dependencies between the entries of $M$.

math.PR↗